Application of particle swarm optimization algorithm for solving bi-level linear programming problem

被引：104
作者：
Kuo, R. J. [1 ]
Huang, C. C. [2 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
[2] Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei 106, Taiwan
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2009年 / 58卷 / 04期
关键词：
Bi-level linear programming; Particle swarm optimization algorithm; Genetic algorithm; NEURAL-NETWORK APPROACH;
D O I：
10.1016/j.camwa.2009.02.028
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Bi-level linear programming is a technique for modeling decentralized decision. It consists of the upper-level and lower-level objectives. This paper attempts to develop an efficient method based on particle swarm optimization (PSO) algorithm with swarm intelligence. The performance of the proposed method is ascertained by comparing the results with genetic algorithm (GA) using four problems in the literature and an example of supply chain model. The results illustrate that the PSO algorithm outperforms GA in accuracy. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码：678 / 685
页数：8
相关论文
共 31 条
[1]  
[Anonymous], P 7 INT C EV PROGR
[2]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[3]  
Bard JF., 1998, PRACTICAL BILEVEL OP
[4]  
Bialas W.F., 1978, Technical Report No. 78-1
[5]   ON 2-LEVEL OPTIMIZATION [J].
BIALAS, WF ;
KARWAN, MH .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1982, 27 (01) :211-214
[6]   2-LEVEL LINEAR-PROGRAMMING [J].
BIALAS, WF ;
KARWAN, MH .
MANAGEMENT SCIENCE, 1984, 30 (08) :1004-1020
[7]  
Clerc M, 1999, P C EV COMP, DOI [10.1109/CEC.1999.785513, DOI 10.1109/CEC.1999.785513]
[8]  
COLSON B, 2005, Q J OPERATIONS RES, V3, P87
[9]   DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
OPERATIONS RESEARCH, 1960, 8 (01) :101-111
[10]  
Eberhart R., MHS 95 P 6 INT S MIC, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/mhs.1995.494215, 10.1109/MHS.1995.494215]
1234