A solution to bi/tri-level programming problems using particle swarm optimization

被引:54
作者
Jialin, Han [1 ,2 ]
Guangquan, Zhang [1 ]
Yaoguang, Hu [2 ]
Jie, Lu [1 ]
机构
[1] Univ Technol Sydney, Decis Syst & E Serv Intelligence Lab, Ctr Quantum Computat & Intelligent Syst, Fac Engn & Informat Technol, Sydney, NSW 2007, Australia
[2] Beijing Inst Technol, Sch Mech Engn, Ind & Syst Engn Lab, Beijing, Peoples R China
基金
澳大利亚研究理事会;
关键词
Bi-level programming; Tri-level programming; Multilevel decision-making; Particle swarm optimization; Computational intelligence; PENALTY-FUNCTION APPROACH; KTH-BEST APPROACH; DECISION-MAKING; BILEVEL; ALGORITHM; FRAMEWORK; MODEL;
D O I
10.1016/j.ins.2016.08.022
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:519 / 537
页数:19
相关论文
共 49 条
[1]   Interactive balance space approach for solving multi-level multi-objective programming problems [J].
Abo-Sinna, Mahmoud A. ;
Baky, Ibrahim A. .
INFORMATION SCIENCES, 2007, 177 (16) :3397-3410
[2]  
ANANDALINGAM G, 1988, J OPER RES SOC, V39, P1021, DOI 10.1057/palgrave.jors.0391105
[3]   An exact penalty on bilevel programs with linear vector optimization lower level [J].
Ankhili, Z. ;
Mansouri, A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (01) :36-41
[4]  
[Anonymous], 1998, Practical bi-level optimization
[5]   Interactive fuzzy goal programming approach for bilevel programming problem [J].
Arora, S. R. ;
Gupta, Ritu .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 194 (02) :368-376
[6]   Disjunctive cuts for continuous linear bilevel programming [J].
Audet, Charles ;
Haddad, Jean ;
Savard, Gilles .
OPTIMIZATION LETTERS, 2007, 1 (03) :259-267
[7]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[8]   AN INVESTIGATION OF THE LINEAR 3 LEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1984, 14 (05) :711-717
[9]   SOME PROPERTIES OF THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1991, 68 (02) :371-378
[10]   COMPUTATIONAL DIFFICULTIES OF BILEVEL LINEAR-PROGRAMMING [J].
BENAYED, O ;
BLAIR, CE .
OPERATIONS RESEARCH, 1990, 38 (03) :556-560