Deb, Kalyanmoy ; Sinha, Ankur (2009) Solving bilevel multi-objective optimization problems using evolutionary algorithms Lecture Notes in Computer Science, 5467/2 . pp. 110-124. ISSN 0302-9743
|
PDF
- Author Version
380kB |
Official URL: http://www.springerlink.com/index/R3508054Q26W9378...
Related URL: http://dx.doi.org/10.1007/978-3-642-01020-0_13
Abstract
Bilevel optimization problems require every feasible upper-level solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy development, transportation problems, and others. In the context of a bilevel single objective problem, there exists a number of theoretical, numerical, and evolutionary optimization results. However, there does not exist too many studies in the context of having multiple objectives in each level of a bilevel optimization problem. In this paper, we address bilevel multi-objective optimization issues and propose a viable algorithm based on evolutionary multi-objective optimization (EMO) principles. Proof-of-principle simulation results bring out the challenges in solving such problems and demonstrate the viability of the proposed EMO technique for solving such problems. This paper scratches the surface of EMO-based solution methodologies for bilevel multi-objective optimization problems and should motivate other EMO researchers to engage more into this important optimization task of practical importance.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Springer. |
ID Code: | 83500 |
Deposited On: | 21 Feb 2012 07:12 |
Last Modified: | 19 May 2016 00:19 |
Repository Staff Only: item control page