Abstract
Bilevel programming problem (BLPP) is a NP-hard problem and very difficult to be resolved by using the classical method. This paper attempts to develop an efficient method based on improved bilevel particle swarm optimization algorithm (IBPSO) to deal with BLPP. The improved algorithm adopts dynamic self-adapting inertia weight and Cauchy distribution to ensure global search ability and faster convergence speed of IBPSO. IBPSO employs two improved PSO as a main program and a subprogram respectively. According to the interactive iterations of two improved PSO algorithms, IBPSO can solve BLPP without some assumptions of BLPP, such as the gradient information of the objective functions, the convexity of constraint regions, and so on. Twelve bilevel problems in the literatures are employed to illustrate the performance of IBPSO and some comparisons are also given. The results demonstrate that the proposed algorithm IBPSO exhibits higher accuracy than other algorithms. Then IBPSO is adopted to solve two supply chain models proposed in this paper, and some features of the proposed bilevel model are given based on the experimental data. The results support the finding that IBPSO is effective in optimizing BLPP.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13042-013-0167-3/MediaObjects/13042_2013_167_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13042-013-0167-3/MediaObjects/13042_2013_167_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13042-013-0167-3/MediaObjects/13042_2013_167_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13042-013-0167-3/MediaObjects/13042_2013_167_Fig4_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Abad PL (2003) Optimal pricing and lot-sizing under conditions of perishability, finite production and partial backordering and lost sale. Eur J Oper Res 144(3):677–685
Bard JF (1991) Some properties of the bilevel linear programming. J Optim Theory Appl 68:371–378
Calvete HI, Galé C (2011) On linear bilevel problems with multiple objectives at the lower level. Omega 39:33–40
Calvete HI, Galé C, Mateo PM (2008) A new approach for solving linear bilevel problems using genetic algorithms. Eur J Oper Res 188:14–28
Clerc M, Kennedy J (2002) The particle swarm: explosion stability and convergence in a multi-dimensional complex space. IEEE Trans Evolut Comput 6(1):58–73
Dewez S, Labbé M, Marcotte P, Savard G (2008) New formulations and valid inequalities for a bilevel pricing problem. Oper Res Lett 2(36):141–149
Gao Y, Zhang GQ, Lu J, Wee HM (2011) Particle swarm optimization for bi-level pricing problems in supply chains. J Glob Optim 51:245–254
Guan YP, Liu TM (2010) Stochastic lot-sizing problem with inventory-bounds and constant order-capacities. Eur J Oper Res 3(207):1398–1409
Hejazia SR, Memariani A, Jahanshahloo G, Sepehri MM (2002) Linear bilevel programming solution by genetic algorithm. Comput Oper Res 29:1913–1925
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, Perth, 1995, pp 1942–1948
Khouja M, Park S (2003) Optimal lot-sizing under continuous price decrease. Omega 31:539–545
Kuo RJ, Huang CC (2009) Application of particle swarm optimization algorithm for solving bi-level linear programming problem. Comput Math Appl 58:678–685
Lan KM, Wen UP, Shih HS, Lee ES (2007) A hybrid neural network approach to bilevel programming problems. Appl Math Lett 20:880–884
Li HY, Meissner J (2011) Competition under capacitated dynamic lot-sizing with capacity acquisition. Int J Prod Econ 2(131):535–544
Li MQ, Lin D, Wang SY (2010) Solving a type of biobjective bilevel programming problem using NSGA-II. Comput Math Appl 59:706–715
Li XY, Tian P, Min XP (2006) A hierarchical particle swarm optimization for solving bilevel programming problems. In: Lecture notes in computer science, artificial intelligence and soft computing-ICAISC 2006, vol 4029 pp 1169–1178
Lin CM, Li MC, Ting AB, Lin MH (2011) A robust self-learning PID control system design for nonlinear systems using a particle swarm optimization algorithm. Int J Mach Learn Cyber 2:225–234
Lu L, Qi XT (2011) Dynamic lot-sizing for multiple products with a new joint replenishment model. Eur J Oper Res 1(212):74–80
Lukač Z, Šorić K, Rosenzweig VV (2008) Production planning problem with sequence dependent setups as a bilevel programming problem. Eur J Oper Res 187:1504–1512
Marcotte P, Savard G, Zhu DL (2009) Mathematical structure of a bilevel strategic pricing model. Eur J Oper Res 2(193):552–566
Rajesh J, Gupta K, Kusumakar HS, Jayaraman VK, Kulkarni BD (2003) A Tabu search based approach for solving a class of bilevel programming problems in chemical engineering. J Heuristics 9:307–319
Rana S, Jasola S, Kumar R (2012) A boundary restricted adaptive particle swarm optimization for data clustering. Int J Mach Learn Cyber. doi:10.1007/s13042-012-0103-y
Sadegheih A, Drake PR (2011) A new experimental study of genetic algorithm and simulated annealing with bounded variables. Appl Artif Intell 25:927–950
Sahin HK, Ciric RA (1998) A dual temperature simulated annealing approach for solving bilevel programming problem. Comput Chem Eng 23:11–25
Shi Y, Eberhart R (1999) Empirical study of particle swarm optimization. In: International conference on evolutionary computation, IEEE press, Washington, USA, pp 1945–1950
Shih HS, Wen UP, Lee ES, Lan KM, Hsiao HC (2004) A neural network approach to multi-objective and multilevel programming problems. Comput Math Appl 48:95–108
Sinha AK, Aditya HK, Tiwari MK, Chan FTS (2011) Agent oriented petroleum supply chain coordination: co-evolutionary particle swarm optimization based approach. Expert Syst Appl 38:6132–6145
Stackelberg HV (1952) The Theory of the Market Economy. Oxford University Press, York
Vicente L, Savard G, Judice J (1994) Descent approaches for quadratic bilevel programming. J Optim Theory Appl 81:379–399
Wang GM, Wan ZP, Wang XJ, Lv YB (2008) Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem. Comput Math Appl 56:2550–2555
Wang XZ, He YL, Dong LC, Zhao HY (2011) Particle swarm optimization for determining fuzzy measures from data. Inform Sci 181(19):4230–4252
Wen UP, Huang AD (1996) A simple Tabu Search method to solve the mixed-integer problem bi-level programming problem. Eur J Oper Res 88:563–571
Yao X, Liu Y, Lin C (1999) Evolutionary programming made faster. IEEE Trans Evolut Comput 3:82–102
Yıldırmaz C, Karabatı S, Sayın S (2009) Pricing and lot-sizing decisions in a two-echelon system with transportation costs. OR Spectrum 31:629–650
Zhu J, Li XP, Shen WM (2011) Effective genetic algorithm for resource-constrained project scheduling with limited preemptions. Int J Mach Learn Cyber 2:55–65
Acknowledgments
The work was partly supported by the National Natural Science Foundation of China (71071113), a Ph. D. Programs Foundation of Ministry of Education of China (20100072110011), the Fundamental Research Funds for the Central Universities.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Problem 1:
Problem 2:
Problem 3:
Problem 4:
Problem 5:
Problem 6:
Problem 7:
Problem 8:
Problem 9–12:
Problem 9:
Problem 10:
Problem 11:
Problem 12:
Rights and permissions
About this article
Cite this article
Ma, W., Wang, M. & Zhu, X. Improved particle swarm optimization based approach for bilevel programming problem-an application on supply chain model. Int. J. Mach. Learn. & Cyber. 5, 281–292 (2014). https://doi.org/10.1007/s13042-013-0167-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-013-0167-3