A Novel Method for Solving Nonlinear Bilevel Programming Based on hybrid Particle Swarm Optimization

Particle swarm optimization (PSO) algorithm has been developing rapidly and has been applied widely since it was introduced, as it is easily understand and realized. For nonlinear bilevel programming whose leader is a nonlinear function, a hybrid PSO algorithm with a simplex algorithm is presented. So far using PSO to solve the nonlinear bilevel programming problem has not been found in the literature. Some numerical examples are given to verify the effectiveness of proposed approach.

[1]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  D. White,et al.  A solution method for the linear static Stackelberg problem using penalty functions , 1990 .

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

[4]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

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

[6]  Yang Guangyou,et al.  A Modified Particle Swarm Optimizer Algorithm , 2007, 2007 8th International Conference on Electronic Measurement and Instruments.

[7]  Wilfred Candler,et al.  A linear two-level programming problem, , 1982, Comput. Oper. Res..

[8]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[9]  Kerstin Dautenhahn,et al.  Book Review: Swarm Intelligence by James Kennedy, Russell C. Eberhart, with Yuhui Shi , 2002, Genetic Programming and Evolvable Machines.