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

An Evolutionary Algorithm Using Duality-Base-Enumerating Scheme for Interval Linear Bilevel Programming Problems

1Department of Mathematics, Qinghai Normal University, Xining 810008, China
2Business School, Nankai University, Tianjin 300070, China

Received 2 June 2014; Accepted 29 July 2014; Published 13 August 2014

Academic Editor: Yuping Wang

Copyright © 2014 Hecheng Li and Lei Fang. 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. H. V. Stackelberg, The Theory of the Market Economy, Oxford University Press, 1952.
  2. J. Bracken and J. T. McGill, “Mathematical programs with optimization problems in the constraints,” Operations Research, vol. 21, pp. 37–44, 1973. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. J. Bracken and J. T. McGill, “Defense applications of mathematical programs with optimization problems in the constraints,” Operations Research, vol. 22, no. 5, pp. 1086–1096, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J. Bracken and J. T. McGill, “Production and marketing decisions with multiple objectives in a competitive environment,” Journal of Optimization Theory and Applications, vol. 24, no. 3, pp. 449–458, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. W. Candler and R. Norton, “Multilevel programing,” Tech. Rep. 20, World Bank Development Research Center, Washington, DC, USA, 1977. View at Google Scholar
  6. E. Aiyoshi and K. Shimizu, “Hierarchical decentralized systems and its new solution by a barrier method,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 11, no. 6, pp. 444–449, 1981. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. B. Colson, P. Marcotte, and G. Savard, “Bilevel programming: a survey,” A Quarterly Journal of Operations Research (4OR), vol. 3, no. 2, pp. 87–107, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. S. Dempe, Foundations of Bilevel Programming, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002. View at MathSciNet
  9. H. Abou-Kandil and P. Bertrand, “Government-private sector relations as a Stackelberg game: a degenerate case,” Journal of Economic Dynamics & Control, vol. 11, no. 4, pp. 513–517, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. H. I. Calvete, C. Galé, and M. Oliveros, “Bilevel model for productiondistribution planning solved by using ant colony optimization,” Computers & Operations Research, vol. 38, no. 1, pp. 320–327, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Migdalas, “Bilevel programming in traffic planning: models, methods and challenge,” Journal of Global Optimization, vol. 7, no. 4, pp. 381–405, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. O. Ben-Ayed, D. Boyce, and C. Blair, “A general bilevel linear programming formulation of the network design problem,” Transportation Research B, vol. 22, no. 4, pp. 311–318, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J. M. Arroyo and F. D. Galiana, “On the solution of the bilevel programming formulation of the terrorist threat problem,” IEEE Transactions on Power Systems, vol. 20, no. 2, pp. 789–797, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. J. F. Bard, Practical Bilevel Optimization, Kluwer Academic, Dordrecht, The Netherlands, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  15. 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 C, vol. 35, no. 2, pp. 221–232, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. 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
  17. A. G. Mersha and S. Dempe, “Linear bilevel programming with upper level constraints depending on the lower level solution,” Applied Mathematics and Computation, vol. 180, no. 1, pp. 247–254, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. H. I. Calvete and C. Galé, “Linear bilevel programming with interval coefficients,” Journal of Computational and Applied Mathematics, vol. 236, no. 15, pp. 3751–3762, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. S. Chanas and D. Kuchta, “Multiobjective programming in optimization of interval objective functions: a generalized approach,” European Journal of Operational Research, vol. 94, no. 3, pp. 594–598, 1996. View at Publisher · View at Google Scholar · View at Scopus
  20. H. Ishibuchi and M. Tanaka, “Multiobjective programming in optimization of the interval objective function,” European Journal of Operational Research, vol. 48, no. 2, pp. 219–225, 1990. View at Publisher · View at Google Scholar · View at Scopus
  21. K. K. Lai, S. Y. Wang, J. P. Xu, S. S. Zhu, and Y. Fang, “A class of linear interval programming problems and its application to portfolio selection,” IEEE Transactions on Fuzzy Systems, vol. 10, no. 6, pp. 698–704, 2002. View at Publisher · View at Google Scholar · View at Scopus
  22. A. A. Molai and E. Khorram, “Linear programming problem with interval coefficients and an interpretation for its constraints,” Iranian Journal of Science and Technology A, vol. 31, no. 4, pp. 369–390, 2007. View at Google Scholar · View at Scopus
  23. J. W. Chinneck and K. Ramadan, “Linear programming with interval coefficients,” Journal of the Operational Research Society, vol. 51, no. 2, pp. 209–220, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. M. Hladik, “Optimal value range in interval linear programming,” Fuzzy Optimization and Decision Making, vol. 8, no. 3, pp. 283–294, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. C. Oliveira and C. H. Antunes, “Multiple objective linear programming models with interval coefficients—an illustrated overview,” European Journal of Operational Research, vol. 181, no. 3, pp. 1434–1463, 2007. View at Publisher · View at Google Scholar · View at Scopus
  26. M. Hladík, “Generalized linear fractional programming under interval uncertainty,” European Journal of Operational Research, vol. 205, no. 1, pp. 42–46, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. W. Li and X. Tian, “Numerical solution method for general interval quadratic programming,” Applied Mathematics and Computation, vol. 202, no. 2, pp. 589–595, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  28. A. Ren and Y. Wang, “An interval programming approach for bilevel linear programming problem with fuzzy random coefficients,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp. 462–469, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  29. 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