Evolutionary Bilevel Optimization

Congress on Evolutionary Computation 2013

June 20-23 2013, Cancun, Mexico

Bilevel optimization problems are special kind of optimization problems which require every feasible upper-level solution to satisfy the optimality conditions of a lower-level optimization problem. These problems are commonly found in many practical problem solving tasks which include optimal control, process optimization, game-playing strategy development, transportation problems, coordination of multi-divisional firms, and others. Due to the computation expense and other difficulties involved in handling such problems, they are often handled using approximate solution procedures. There is a need for theoretical as well as methodological advancements to handle such problems efficiently.

The aim of this special session at CEC 2013 is to give an opportunity to researchers and practitioners to discuss and exchange ideas for handling bilevel problems, which have yet not been widely explored by the evolutionary computation community. Topics of this session include (but are not limited to):

1. Evolutionary algorithms for bilevel optimization problems
2. Evolutionary algorithms for multi-objective bilevel optimization problems
3. Approximate procedures to handle bilevel optimization problems
4. Hybrid approaches to handle bilevel optimization problems
5. Theoretical results on bilevel optimization problems
6. Hierarchical decision making
7. Bilevel Application Problems

Organizers

Dr. Kalyanmoy Deb
Indian Institute of Technology, Kanpur, India

Dr. Frank Neumann
University of Adelaide, Australia

Dr. Ankur Sinha
Aalto University School of Business, Helsinki, Finland

Dr. Claudia Szabo
University of Adelaide, Australia

Keywords

Bilevel Optimization, Bilevel Multi-objective Optimization, Evolutionary Algorithms, Multi-Criteria Decision Making, Theory on Bilevel Programming, Hierarchical Decision Making, Bilevel Applications, Hybrid Algorithms.