A multi-objective bi-level location planning problem for stone industrial parks

被引:37
作者
Gang, Jun [1 ,3 ]
Tu, Yan [1 ,2 ]
Lev, Benjamin [2 ]
Xu, Jiuping [1 ]
Shen, Wenjing [2 ]
Yao, Liming [1 ]
机构
[1] Sichuan Univ, Sch Business, Chengdu 610064, Peoples R China
[2] Drexel Univ, LeBow Coll Business, Dept Decis Sci, Philadelphia, PA 19104 USA
[3] Sichuan Inst Bldg Res, Chengdu 610064, Peoples R China
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Stone industry; Location; Multi-objective bi-level optimization; Random variables; Particle swarm optimization; CONSTRAINED PROGRAMMING APPROACH; PARTICLE SWARM OPTIMIZATION; SUPPLY CHAIN NETWORK; ALGORITHM; ALLOCATION; EXPANSION; STRATEGY;
D O I
10.1016/j.cor.2014.10.005
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper focuses on a stone industrial park location problem with a hierarchical structure consisting of a local government and several stone enterprises under a random environment. In contrast to previous studies, conflicts between the local authority and the stone enterprises are considered. The local government, being the leader in the hierarchy, aims to minimize both total pollution emissions and total development and operating costs. The stone enterprises, as the followers in the hierarchy, only aim to minimize total costs. In addition, unit production cost and unit transportation cost are considered random variables. This complicated multi-objective bi-level optimization problem poses several challenges, including randomness, two-level decision making, conflicting objectives, and difficulty in searching for the optimal solutions. Various approaches are employed to tackle these challenges. In order to make the model trackable, expected value operator is used to deal with the random variables in the objective functions and a chance constraint-checking method is employed to deal with such variables in the constraints. The problem is solved using a bi-level interactive method based on a satisfactory solution and Adaptive Chaotic Particle Swarm Optimization (ACPSO). Finally, a case study is conducted to demonstrate the practicality and efficiency of the proposed model and solution algorithm. The performance of the proposed bi-level model and ACPSO algorithm was highlighted by comparing to a single-level model and basic PSO and GA algorithms. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:8 / 21
页数:14
相关论文
共 48 条
[1]   A multi-stage stochastic integer programming approach for capacity expansion under uncertainty [J].
Ahmed, S ;
King, A ;
Parija, G .
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (01) :3-24
[2]   A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery [J].
Ai, The Jin ;
Kachitvichyanukul, Voratas .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1693-1702
[3]  
Akgun I, 2014, RISK BASED IN PRESS
[4]  
Al-Jabari M, 2002, P 28 WEDC C SUST ENV
[5]   Recycling of stone slurry in industrial activities: Application to concrete mixtures [J].
Almeida, Nuno ;
Branco, Fernando ;
Santos, Jose Roberto .
BUILDING AND ENVIRONMENT, 2007, 42 (02) :810-819
[6]  
[Anonymous], 2001, SWARM INTELL-US
[7]   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
[8]   Plant location with minimum inventory [J].
Barahona, F ;
Jensen, D .
MATHEMATICAL PROGRAMMING, 1998, 83 (01) :101-111
[9]   The probabilistic gradual covering location problem on a network with discrete random demand weights [J].
Berman, Oded ;
Krass, Dmitry ;
Wang, Jiamin .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) :1493-1500
[10]   Chaotic sequences to improve the performance of evolutionary algorithms [J].
Caponetto, R ;
Fortuna, L ;
Fazzino, S ;
Xibilia, MG .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (03) :289-304