TY - JOUR
T1 - A solution to bi/tri-level programming problems using particle swarm optimization
AU - Han, Jialin
AU - Zhang, Guangquan
AU - Hu, Yaoguang
AU - Lu, Jie
N1 - Publisher Copyright:
© 2016 Elsevier Inc.
PY - 2016
Y1 - 2016
N2 - Multilevel (including bi-level and tri-level) programming aims to solve decentralized decision-making problems that feature interactive decision entities distributed throughout a hierarchical organization. Since the multilevel programming problem is strongly NP-hard and traditional exact algorithmic approaches lack efficiency, heuristics-based particle swarm optimization (PSO) algorithms have been used to generate an alternative for solving such problems. However, the existing PSO algorithms are limited to solving linear or small-scale bi-level programming problems. This paper first develops a novel bi-level PSO algorithm to solve general bi-level programs involving nonlinear and large-scale problems. It then proposes a tri-level PSO algorithm for handling tri-level programming problems that are more challenging than bi-level programs and have not been well solved by existing algorithms. For the sake of exploring the algorithms' performance, the proposed bi/tri-level PSO algorithms are applied to solve 62 benchmark problems and 810 large-scale problems which are randomly constructed. The computational results and comparison with other algorithms clearly illustrate the effectiveness of the proposed PSO algorithms in solving bi-level and tri-level programming problems.
AB - Multilevel (including bi-level and tri-level) programming aims to solve decentralized decision-making problems that feature interactive decision entities distributed throughout a hierarchical organization. Since the multilevel programming problem is strongly NP-hard and traditional exact algorithmic approaches lack efficiency, heuristics-based particle swarm optimization (PSO) algorithms have been used to generate an alternative for solving such problems. However, the existing PSO algorithms are limited to solving linear or small-scale bi-level programming problems. This paper first develops a novel bi-level PSO algorithm to solve general bi-level programs involving nonlinear and large-scale problems. It then proposes a tri-level PSO algorithm for handling tri-level programming problems that are more challenging than bi-level programs and have not been well solved by existing algorithms. For the sake of exploring the algorithms' performance, the proposed bi/tri-level PSO algorithms are applied to solve 62 benchmark problems and 810 large-scale problems which are randomly constructed. The computational results and comparison with other algorithms clearly illustrate the effectiveness of the proposed PSO algorithms in solving bi-level and tri-level programming problems.
KW - Bi-level programming
KW - Computational intelligence
KW - Multilevel decision-making
KW - Particle swarm optimization
KW - Tri-level programming
UR - http://www.scopus.com/inward/record.url?scp=84988947255&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2016.08.022
DO - 10.1016/j.ins.2016.08.022
M3 - Article
AN - SCOPUS:84988947255
SN - 0020-0255
VL - 370-371
SP - 519
EP - 537
JO - Information Sciences
JF - Information Sciences
ER -