Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 820747, 16 pages
http://dx.doi.org/10.1155/2014/820747
Research Article

A Differential Evolution with Two Mutation Strategies and a Selection Based on an Improved Constraint-Handling Technique for Bilevel Programming Problems

School of Mathematics and Statistics, Xidian University, Xi’an 710071, China

Received 29 April 2014; Revised 1 July 2014; Accepted 1 July 2014; Published 23 July 2014

Academic Editor: Yuping Wang

Copyright © 2014 Hong Li and Li Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. F. Bard, Practical Bilevel Optimization: Algorithms and Applications, vol. 30, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  2. L. N. Vicente and P. H. Calamai, “Bilevel and multilevel programming: a bibliography review,” Journal of Global Optimization, vol. 5, no. 3, pp. 291–306, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. S. Dempe, “Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints,” Optimization, vol. 52, no. 3, pp. 333–359, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. B. Colson, P. Marcotte, and G. Savard, “Bilevel programming: a survey,” 4OR, vol. 3, no. 2, pp. 87–107, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. B. Colson, P. Marcotte, and G. Savard, “A trust-region method for nonlinear bilevel programming: algorithm and computational experience,” Computational Optimization and Applications, vol. 30, no. 3, pp. 211–227, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. P. Hansen, B. Jaumard, and G. Savard, “New branch-and-bound rules for linear bilevel programming,” Society for Industrial and Applied Mathematics, vol. 13, no. 5, pp. 1194–1217, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  7. L. Vicente, G. Savard, and J. Júdice, “Descent approaches for quadratic bilevel programming,” Journal of Optimization Theory and Applications, vol. 81, no. 2, pp. 379–399, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. H. I. Calvete, C. Galé, and P. M. Mateo, “A new approach for solving linear bilevel problems using genetic algorithms,” European Journal of Operational Research, vol. 188, no. 1, pp. 14–28, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. F. Bard and J. T. Moore, “A branch and bound algorithm for the bilevel programming problem,” SIAM Journal on Scientific and Statistical Computing, vol. 11, no. 2, pp. 281–292, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  10. C. H. M. de Sabóia, M. Campêlo, and S. Scheimberg, “A computational study of global algorithms for linear bilevel programming,” Numerical Algorithms, vol. 35, no. 2–4, pp. 155–173, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. K. Lan, U. Wen, H. Shih, and E. S. Lee, “A hybrid neural network approach to bilevel programming problems,” Applied Mathematics Letters, vol. 20, no. 8, pp. 880–884, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. C. Audet, G. Savard, and W. Zghal, “New branch-and-cut algorithm for bilevel linear programming,” Journal of Optimization Theory and Applications, vol. 134, no. 2, pp. 353–370, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. H. Li, Y. Jiao, F. S. Zhang, and L. Zhang, “An efficient method for linear bilevel programming problems based on the orthogonal genetic algorithm,” International Journal of Innovative Computing, Information and Control, vol. 5, no. 9, pp. 2837–2846, 2009. View at Google Scholar · View at Scopus
  14. S. R. Hejazi, A. Memariani, G. Jahanshahloo, and M. M. Sepehri, “Linear bilevel programming solution by genetic algorithm,” Computers and Operations Research, vol. 29, no. 13, pp. 1913–1925, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. H. Tuy, A. Migdalas, and N. T. Hoai-Phuong, “A novel approach to bilevel nonlinear programming,” Journal of Global Optimization, vol. 38, no. 4, pp. 527–554, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. G. Anandalingam and D. J. White, “A solution method for the linear static Stackelberg problem using penalty functions,” IEEE Transactions on Automatic Control, vol. 35, no. 10, pp. 1170–1173, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J. S. Angelo, E. Krempser, and H. J. C. Barbosa, “Differential evolution for bilevel programming,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '13), pp. 470–477, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. Y. H. Liu and T. H. Spencer, “Solving a bilevel linear program when the inner decision maker controls few variables,” European Journal of Operational Research, vol. 81, no. 3, pp. 644–651, 1995. View at Publisher · View at Google Scholar · View at Scopus
  19. K. Moshirvaziri, M. A. Amouzegar, and S. E. Jacobsen, “Test problem construction for linear bilevel programming problems,” Journal of Global Optimization, vol. 8, no. 3, pp. 235–243, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  20. Y. Wang and C. Dang, “An evolutionary algorithm for global optimization based on level-set evolution and latin squares,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 5, pp. 579–595, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Perth, Australia, December 1995. View at Scopus
  23. B. Liu, “Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms,” Computers & Mathematics with Applications, vol. 36, no. 7, pp. 79–89, 1998. View at Google Scholar · View at Scopus
  24. V. Oduguwa and R. Roy, “Bi-level optimization using genetic algorithm,” in Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems, pp. 123–128, 2002.
  25. Y. Wang, Y.-C. Jiao, and H. Li, “An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 35, no. 2, pp. 221–232, 2005. View at Publisher · View at Google Scholar · View at Scopus
  26. X. Li, P. Tian, and X. Min, “A hierarchical particle swarm optimization for solving bilevel programming problems,” in Artificial Intelligence and Soft Computing—ICAISC 2006, vol. 4029 of Lecture Notes in Computer Science, pp. 1169–1178, Springer, Berlin, Germany, 2006. View at Google Scholar
  27. Y. Wang, H. Li, and C. Dang, “A new evolutionary algorithm for a class of nonlinear bilevel programming problems and its global convergence,” INFORMS Journal on Computing, vol. 23, no. 4, pp. 618–629, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  28. A. Sinha, P. Malo, and K. Deb, “Test problem construction for single-objective bilevel optimization,” Evolutionary Computation Journal, 2014. View at Publisher · View at Google Scholar
  29. H. Li and L. Zhang, “A differential evolution with two mutation strategies for linear bilevel programming problems,” in Proceedings of the 9th International Conference on Computational Intelligence and Security (CIS '13), pp. 55–60, 2013. View at Publisher · View at Google Scholar
  30. M. A. Amouzegar, “A global optimization method for nonlinear bilevel programming problems,” IEEE Transactions on Systems, Man, and Cybernetics B: Cybernetics, vol. 29, no. 6, pp. 771–777, 1999. View at Publisher · View at Google Scholar · View at Scopus
  31. J. F. Bard, “Convex two-level optimization,” Mathematical Programming, vol. 40, no. 1, pp. 15–27, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. H. I. Calvete and C. Galé, “The bilevel linear/linear fractional programming problem,” European Journal of Operational Research, vol. 114, no. 1, pp. 188–197, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. S. Das and P. N. Suganthan, “Differential evolution: a survey of the state-of-the-art,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4–31, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. K. Deb, “An efficient constraint handling method for genetic algorithms,” Computer Methods in Applied Mechanics and Engineering, vol. 186, no. 2–4, pp. 311–338, 2000. View at Publisher · View at Google Scholar · View at Scopus
  35. E. Aiyoshi and K. Shimizu, “A solution method for the static constrained Stackelberg problem via penalty method,” IEEE Transactions on Automatic Control, vol. 29, no. 12, pp. 1111–1114, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus