Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2017 (2017), Article ID 1853131, 14 pages
https://doi.org/10.1155/2017/1853131
Research Article

The Artificial Neural Networks Based on Scalarization Method for a Class of Bilevel Biobjective Programming Problem

1School of Information and Mathematics, Yangtze University, Jingzhou 434023, China
2School of Management, Huaibei Normal University, Huaibei 235000, China
3School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China

Correspondence should be addressed to Tao Zhang; moc.621@189htam_tz

Received 6 January 2017; Revised 19 May 2017; Accepted 7 August 2017; Published 14 September 2017

Academic Editor: Leonardo Franco

Copyright © 2017 Tao Zhang et al. 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. L. s. 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
  2. S. Dempe, “Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints,” Optimization. A Journal of Mathematical Programming and Operations Research, vol. 52, no. 3, pp. 333–359, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. B. t. Colson, P. Marcotte, and G. Savard, “Bilevel programming: a survey,” 4OR. A Quarterly Journal of Operations Research, vol. 3, no. 2, pp. 87–107, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. B. t. Colson, P. Marcotte, and G. Savard, “An overview of bilevel optimization,” Annals of Operations Research, vol. 153, pp. 235–256, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. K. Shimizu, Y. Ishizuka, and J. F. Bard, Nondifferentiable and two-level mathematical programming, Kluwer Academic Publishers, Boston, Mass, USA, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  6. 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
  7. A. Migdalas, P. M. Pardalos, and P. Värbrand, Eds., Multilevel Optimization: Algorithms and Applications, Kluwer Academic, Dordrecht, The Netherlands, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  8. S. Dempe, Foundations of Bilevel Programming, vol. 61, Kluwer Academic Publishers, London, UK, 2002. View at MathSciNet
  9. R. G. Jeroslow, “The polynomial hierarchy and a simple model for competitive analysis,” Mathematical Programming, vol. 32, no. 2, pp. 146–164, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. O. Ben-Ayed and C. E. Blair, “Computational difficulties of bilevel linear programming,” Operations Research, vol. 38, no. 3, pp. 556–560, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. J. F. Bard, “Some properties of the bilevel programming problem,” Journal of Optimization Theory and Applications, vol. 68, no. 2, pp. 371–378, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. 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
  13. J. F. Bard, “An algorithm for solving the general bilevel programming problem,” Mathematics of Operations Research, vol. 8, no. 2, pp. 260–272, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. T. A. Edmunds and J. F. Bard, “Algorithms for nonlinear bilevel mathematical programs,” Institute of Electrical and Electronics Engineers. Transactions on Systems, Man, and Cybernetics, vol. 21, no. 1, pp. 83–89, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. 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
  16. J. B. Etoa Etoa, “Solving quadratic convex bilevel programming problems using a smoothing method,” Applied Mathematics and Computation, vol. 217, no. 15, pp. 6680–6690, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. J. F. Bard and J. E. Falk, “An explicit solution to the multi-level programming problem,” Computers and Operations Research, vol. 9, no. 1, pp. 77–100, 1982. View at Publisher · View at Google Scholar · View at Scopus
  18. K. Shimizu and E. Aiyoshi, “A new computational method for Stackelberg and min-max problems by use of a penalty method,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 26, no. 2, pp. 460–466, 1981. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. E. Aiyoshi and K. Shimizu, “A solution method for the static constrained Stackelberg problem via penalty method,” Institute of Electrical and Electronics Engineers. 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
  20. Y. Ishizuka and E. Aiyoshi, “Double penalty method for bilevel optimization problems,” Annals of Operations Research, vol. 34, no. 1-4, pp. 73–88, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. Y. Lv, T. Hu, G. Wang, and Z. Wan, “A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming,” Applied Mathematics and Computation, vol. 188, no. 1, pp. 808–813, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. G. Savard and J. Gauvin, “The steepest descent direction for the nonlinear bilevel programming problem,” Operations Research Letters, vol. 15, no. 5, pp. 265–272, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. J. E. Falk and J. Liu, “On bilevel programming, Part I: general nonlinear cases,” Mathematical Programming, vol. 70, no. 1, Ser. A, pp. 47–72, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  24. R. Mathieu, L. Pittard, and G. Anandalingam, “Genetic algorithm based approach to bi-level linear programming,” Operations Research, vol. 28, no. 1, pp. 1–21, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  25. 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 Scopus
  26. Y.-P. 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: Applications and Reviews, vol. 35, no. 2, pp. 221–232, 2005. View at Publisher · View at Google Scholar · View at Scopus
  27. G.-m. Wang, X.-j. Wang, Z.-p. Wan, and S.-h. Jia, “An adaptive genetic algorithm for solving bilevel linear programming problem,” Applied Mathematics and Mechanics. English Edition, vol. 28, no. 12, pp. 1605–1612, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. 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
  29. K. M. Lan, U. P. Wen, H.-S. Shih, and E. Lee, “A hybrid neural network approach to bilevel programming problems,” Applied Mathematics Letters. An International Journal of Rapid Publication, vol. 20, no. 8, pp. 880–884, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  30. Y. Lv, T. Hu, G. Wang, and Z. Wan, “A neural network approach for solving nonlinear bilevel programming problem,” Computers & Mathematics with Applications. An International Journal, vol. 55, no. 12, pp. 2823–2829, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  31. S. B. Yaakob and J. Watada, “Double-Layered Hybrid Neural Network Approach for Solving Mixed Integer Quadratic Bilevel Problems,” in Integrated Uncertainty Management and Applications, vol. 68 of Advances in Intelligent and Soft Computing, pp. 221–230, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010. View at Publisher · View at Google Scholar
  32. W. S. McCulloch and W. Pitts, “A logical calculus of the ideas immanent in nervous activity,” The Bulletin of Mathematical Biophysics, vol. 5, no. 4, pp. 115–133, 1943. View at Publisher · View at Google Scholar · View at Scopus
  33. I. B. Pyne, “Linear programming on an electronic analog computer,” Transactions of the American Institute Electrical Engineers, vol. 75, pp. 139–143, 1956. View at Google Scholar
  34. Z. Sheng, Z. Lv, and R. Xu, “A new algorithm based on the Frank-Wolfe method and neural network for a class of bilevel decision making problems,” Acta Automatic Sinica, vol. 22, no. 6, pp. 657–665, 1996. View at Google Scholar
  35. H.-S. Shih, U.-P. Wen, E. S. Lee, K.-M. Lan, and H.-C. Hsiao, “A neural network approach to multiobjective and multilevel programming problems,” Computers & Mathematics with Applications. An International Journal, vol. 48, no. 1-2, pp. 95–108, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  36. Y. Lv, Z. Chen, and Z. Wan, “A neural network for solving a convex quadratic bilevel programming problem,” Journal of Computational and Applied Mathematics, vol. 234, no. 2, pp. 505–511, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. X. Li, P. Tian, and X. Min, “A hierarchical particle swarm optimization for solving bilevel programming problems,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4029, pp. 1169–1178, 2006. View at Publisher · View at Google Scholar · View at Scopus
  38. R. J. Kuo and C. C. Huang, “Application of particle swarm optimization algorithm for solving bi-level linear programming problem,” Computers & Mathematics with Applications. An International Journal, vol. 58, no. 4, pp. 678–685, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  39. Y. Jiang, X. Li, C. Huang, and X. Wu, “Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem,” Applied Mathematics and Computation, vol. 219, no. 9, pp. 4332–4339, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  40. Y. Gao, G. Zhang, J. Lu, and H.-M. Wee, “Particle swarm optimization for bi-level pricing problems in supply chains,” Journal of Global Optimization, vol. 51, no. 2, pp. 245–254, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  41. G. Zhang, G. Zhang, Y. Gao, and J. Lu, “Competitive strategic bidding optimization in electricity markets using bilevel programming and swarm technique,” IEEE Transactions on Industrial Electronics, vol. 58, no. 6, pp. 2138–2146, 2011. View at Publisher · View at Google Scholar · View at Scopus
  42. S. B. Yaakob and J. Watada, “A hybrid intelligent algorithm for solving the bilevel programming models,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6277, no. 2, pp. 485–494, 2010. View at Publisher · View at Google Scholar · View at Scopus
  43. R. J. Kuo and Y. S. Han, “A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem—a case study on supply chain model,” Applied Mathematical Modelling, vol. 35, no. 8, pp. 3905–3917, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  44. Z. Wan, G. Wang, and B. Sun, “A hybrid intelligent algorithm by combining particle swarm optimization with chaos searching technique for solving nonlinear bilevel programming problems,” Swarm and Evolutionary Computation, vol. 8, pp. 26–32, 2013. View at Publisher · View at Google Scholar · View at Scopus
  45. U. P. Wen and A. D. Huang, “A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem,” European Journal of Operational Research, vol. 88, no. 3, pp. 563–571, 1996. View at Publisher · View at Google Scholar · View at Scopus
  46. M. Gendreau, P. Marcotte, and G. Savard, “A hybrid tabu-ascent algorithm for the linear bilevel programming problem,” Journal of Global Optimization, vol. 8, no. 3, pp. 217–233, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  47. J. Rajesh, K. Gupta, H. S. Kusumakar, V. K. Jayaraman, and B. D. Kulkarni, “A Tabu Search Based Approach for Solving a Class of Bilevel Programming Problems in Chemical Engineering,” Journal of Heuristics, vol. 9, no. 4, pp. 307–319, 2003. View at Publisher · View at Google Scholar · View at Scopus
  48. K. H. Sahin and A. R. Ciric, “A dual temperature simulated annealing approach for solving bilevel programming problems,” Computers and Chemical Engineering, vol. 23, no. 1, pp. 11–25, 1998. View at Publisher · View at Google Scholar · View at Scopus
  49. H. I. Calvete, C. Galé, and M. Oliveros, “Bilevel model for production distribution 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
  50. Y. Gao, G. Zhang, J. Ma, and J. Lu, “A λ-cut and goal-programming-based algorithm for fuzzy-linear multiple-objective bilevel optimization,” IEEE Transactions on Fuzzy Systems, vol. 18, no. 1, pp. 1–13, 2010. View at Publisher · View at Google Scholar · View at Scopus
  51. X. Shi and H. Xia, “Interactive bilevel multi-objective decision making,” Journal of the Operational Research Society, vol. 48, no. 9, pp. 943–949, 1997. View at Publisher · View at Google Scholar · View at Scopus
  52. X. Shi and H. S. Xia, “Model and interactive algorithm of bi-level multi-objective decision-making with multiple interconnected decision makers,” Journal of Multi-Criteria Decision Analysis, vol. 10, no. 1, pp. 27–34, 2001. View at Publisher · View at Google Scholar
  53. M. A. Abo-Sinna and I. A. Baky, “Interactive balance space approach for solving multi-level multi-objective programming problems,” Information Sciences, vol. 177, no. 16, pp. 3397–3410, 2007. View at Publisher · View at Google Scholar · View at Scopus
  54. I. Nishizaki and M. Sakawa, “Stackelberg solutions to multiobjective two-level linear programming problems,” Journal of Optimization Theory and Applications, vol. 103, no. 1, pp. 161–182, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  55. G. Eichfelder, “Multiobjective bilevel optimization,” Mathematical Programming. A Publication of the Mathematical Programming Society, vol. 123, no. 2, Ser. A, pp. 419–449, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  56. K. Deb and A. Sinha, “Constructing test problems for bilevel evolutionary multi-objective optimization,” in Proceedings of the 2009 IEEE Congress on Evolutionary Computation, CEC 2009, pp. 1153–1160, nor, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  57. K. Deb and A. Sinha, “Solving bilevel multi-objective optimization problems using evolutionary algorithms,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5467, pp. 110–124, 2010. View at Publisher · View at Google Scholar · View at Scopus
  58. K. Deb and A. Sinha, “An evolutionary approach for bilevel multi-objective problems,” Communications in Computer and Information Science, vol. 35, pp. 17–24, 2009. View at Publisher · View at Google Scholar · View at Scopus
  59. A. Sinha and K. Deb, “Towards Understanding Evolutionary Bilevel Multi-Objective Optimization Algorithm,” IFAC Proceedings Volumes, vol. 42, no. 2, pp. 338–343, 2009. View at Publisher · View at Google Scholar
  60. K. Deb and A. Sinha, “An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm,” Evolutionary Computation, vol. 18, no. 3, pp. 403–449, 2010. View at Publisher · View at Google Scholar · View at Scopus
  61. A. Sinha, “Bilevel multi-objective optimization problem solving using progressively interactive EMO,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6576, pp. 269–284, 2011. View at Publisher · View at Google Scholar · View at Scopus
  62. T. Zhang, T. Hu, Y. Zheng, and X. Guo, “An improved particle swarm optimization for solving bilevel multiobjective programming problem,” Journal of Applied Mathematics, Article ID 626717, Art. ID 626717, 13 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  63. T. Zhang, T. Hu, J.-W. Chen, Z. Wan, and X. Guo, “Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization,” Abstract and Applied Analysis, vol. 2012, Article ID 102482, 20 pages, 2012. View at Publisher · View at Google Scholar · View at Scopus
  64. T. Zhang, T. Hu, X. Guo, Z. Chen, and Y. Zheng, “Solving high dimensional bilevel multiobjective programming problem using a hybrid particle swarm optimization algorithm with crossover operator,” Knowledge-Based Systems, vol. 53, pp. 13–19, 2013. View at Publisher · View at Google Scholar · View at Scopus
  65. K. Deb, “Multi-Objective Optimization using Evolutionary Algorithms,” IEEE Transactions on Evolutionary Computation, vol. 6, pp. 182–197, 2002. View at Google Scholar
  66. G. Zhang, J. Lu, and T. Dillon, “Decentralized multi-objective bilevel decision making with fuzzy demands,” Knowledge-Based Systems, vol. 20, no. 5, pp. 495–507, 2007. View at Publisher · View at Google Scholar · View at Scopus