Bilevel Optimization Using Bacteria Foraging Optimization Algorithm

Bilevel programming problems involve two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. There are number of different algorithms developed based on classical deterministic optimization methods for Bilevel Optimizations Problems (BLOP), but these are very much problem specific, non-robust and computation intensive when number of decision variables increase, while not applicable for multi-modal problems. Evolutionary Algorithms are inherently parallel, capable of local as well as global search, random, and robust techniques and can used to solve these BLOPs. In this paper, Bilevel Bacteria Foraging Optimization Algorithm (BiBFOA) is proposed for solving BLOP based on the foraging technique of common bacteria. Experimental results demonstrate the validity of the BFOA-based algorithm for solution of BLOPs.

[1]  Ajith Abraham,et al.  Bacterial Foraging Optimization Algorithm: Theoretical Foundations, Analysis, and Applications , 2009, Foundations of Computational Intelligence.

[2]  Stephan Dempe,et al.  Foundations of Bilevel Programming , 2002 .

[3]  Herminia I. Calvete,et al.  A new approach for solving linear bilevel problems using genetic algorithms , 2008, Eur. J. Oper. Res..

[4]  Kalyanmoy Deb,et al.  Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization , 2013, ArXiv.

[5]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[6]  Kalyanmoy Deb,et al.  Test Problem Construction for Single-Objective Bilevel Optimization , 2014, Evolutionary Computation.

[7]  Jianwu Dang,et al.  Analysis and Improvement of the Bacterial Foraging Optimization Algorithm , 2014, J. Comput. Sci. Eng..

[8]  Soumya Banerjee,et al.  A Study of Bacterial Foraging Optimization Algorithm and its Applications to Solve Simultaneous Equations , 2013 .

[9]  Ajith Abraham,et al.  Adaptive Computational Chemotaxis in Bacterial Foraging Optimization: An Analysis , 2009, IEEE Transactions on Evolutionary Computation.

[10]  Pierre Hansen,et al.  New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..

[11]  Zhongping Wan,et al.  Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem , 2008, Comput. Math. Appl..

[12]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[13]  L. N. Vicente,et al.  Descent approaches for quadratic bilevel programming , 1994 .

[14]  Jie Lu,et al.  A bilevel optimization model and a PSO-based algorithm in day-ahead electricity markets , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[15]  Kalyanmoy Deb,et al.  An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm , 2010, Evolutionary Computation.

[16]  Jonathan F. Bard,et al.  Practical Bilevel Optimization , 1998 .