Capacitated location allocation problem with stochastic location and fuzzy demand: A hybrid algorithm

被引:55
作者
Mousavi, Seyed Mohsen [1 ]
Niaki, Seyed Taghi Akhavan [2 ]
机构
[1] Islamic Azad Univ, Dept Ind Engn, Fac Ind & Mech Engn, Qazvin Branch, Qazvin, Iran
[2] Sharif Univ Technol, Dept Ind Engn, Tehran 1458889694, Iran
关键词
Location allocation problem; Fuzzy programming; Fuzzy simulation; Hybrid intelligent algorithm; Evaluating expected distance; MODEL;
D O I
10.1016/j.apm.2012.10.038
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this article, a capacitated location allocation problem is considered in which the demands and the locations of the customers are uncertain. The demands are assumed fuzzy, the locations follow a normal probability distribution, and the distances between the locations and the customers are taken Euclidean and squared Euclidean. The fuzzy expected cost programming, the fuzzy beta-cost minimization model, and the credibility maximization model are three types of fuzzy programming that are developed to model the problem. Moreover, two closed-form Euclidean and squared Euclidean expressions are used to evaluate the expected distance between customers and facilities. In order to solve the problem at hand, a hybrid intelligent algorithm is applied in which the simplex algorithm, fuzzy simulation, and a modified genetic algorithm are integrated. Finally, in order to illustrate the efficiency of the proposed hybrid algorithm, some numerical examples are presented. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:5109 / 5119
页数:11
相关论文
共 24 条
[1]  
Abiri M.B., 2010, INT J ADV MANUF TECH, V52, P1
[2]   PROBABILISTIC FORMULATIONS OF THE MULTIFACILITY WEBER PROBLEM [J].
ALY, AA ;
WHITE, JA .
NAVAL RESEARCH LOGISTICS, 1978, 25 (03) :531-547
[3]   Cognitive radio engine parametric optimization utilizing Taguchi analysis [J].
Amanna, Ashwin E. ;
Ali, Daniel ;
Gadhiok, Manik ;
Price, Matthew ;
Reed, Jeffrey H. .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2012,
[4]  
[Anonymous], 2000, P 6 NAT C OP RES SOC
[5]   Combining the analytic hierarchy process and goal programming for global facility location-allocation problem [J].
Badri, MA .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1999, 62 (03) :237-248
[6]   A note on the optimal positioning of service units [J].
Carrizosa, E ;
Munoz-Marquez, M ;
Puerto, J .
OPERATIONS RESEARCH, 1998, 46 (01) :155-156
[7]  
CARRIZOSA E, 1995, RAIRO-RECH OPER, V29, P35
[8]   ON THE PARTITIONING OF SQUARED EUCLIDEAN DISTANCE AND ITS APPLICATIONS IN CLUSTER-ANALYSIS [J].
CARTER, RL ;
MORRIS, R ;
BLASHFIELD, RK .
PSYCHOMETRIKA, 1989, 54 (01) :9-23
[9]   LOCATION-ALLOCATION PROBLEMS [J].
COOPER, L .
OPERATIONS RESEARCH, 1963, 11 (03) :331-343
[10]   Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations [J].
Durmaz, Engin ;
Aras, Necad ;
Altinel, I. Kuban .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) :2139-2148