Bi-objective location problem with balanced allocation of customers and Bernoulli demands: two solution approaches

被引:4
作者
Shiripour, Saber [1 ]
Mahdavi-Amiri, Nezam [2 ]
机构
[1] Univ Garmsar, Fac Engn, Garmsar, Iran
[2] Sharif Univ Technol, Fac Math Sci, Tehran, Iran
关键词
Capacitated location-allocation problem; Bi-objective model; Stochastic demands; Augmented epsilon-constraint method; Metaheuristic algorithm; FACILITY LOCATION; SERVICE; DESIGN; MODEL;
D O I
10.1007/s00500-018-3163-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A bi-objective stochastic capacitated multi-facility location-allocation problem is presented where the customer demands have Bernoulli distributions. The capacity of a facility for accepting customers is limited so that if the number of allocated customers to the facility is more than its capacity, a shortage will occur. The problem is formulated as a bi-objective mathematical programming model. The first objective is to find optimal locations of facilities among potential locations and optimal allocations of stochastic customers to the facilities so that the total sum of fixed costs of establishment of the facilities and the expected values of servicing and shortage costs is minimized. The second objective is to balance the number of allocated customers to the facilities. To solve small problems, the augmented epsilon-constraint method is used. Also, two metaheuristic solution approaches, non-dominated sorting genetic algorithm II (NSGA-II) and controlled elitist non-dominated sorting genetic algorithm II (CNSGA-II), are presented for solving large problems. Several sample problems are generated and with various criteria are tested to show the performance of the proposed model and the solution approaches.
引用
收藏
页码:4999 / 5018
页数:20
相关论文
共 43 条
[1]   Exact solutions to a class of stochastic generalized assignment problems [J].
Albareda-Sambola, Maria ;
van der Vlerk, Maarten H. ;
Fernandez, Elena .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) :465-487
[2]   The facility location problem with Bernoulli demands [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Saldanha-da-Gama, Francisco .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2011, 39 (03) :335-345
[3]   Heuristic and lower bound for a stochastic location-routing problem [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) :940-955
[4]   Modeling and solving a capacitated stochastic location-allocation problem using sub-sources [J].
Alizadeh, Morteza ;
Mahdavi-Amiri, Nezam ;
Shiripour, Saber .
SOFT COMPUTING, 2016, 20 (06) :2261-2280
[5]  
[Anonymous], 2005, TOP, DOI [DOI 10.1007/BF02578982, 10. 1007/BF02578982.]
[6]  
[Anonymous], 2001, Algorithms, Multi-objective Optimization Using Evolutionary, DOI DOI 10.5555/559152
[7]   EQUITY MAXIMIZING FACILITY LOCATION SCHEMES [J].
BERMAN, O ;
KAPLAN, EH .
TRANSPORTATION SCIENCE, 1990, 24 (02) :137-144
[8]   Optimal location with equitable loads [J].
Berman, Oded ;
Drezner, Zvi ;
Tamir, Arie ;
Wesolowsky, George O. .
ANNALS OF OPERATIONS RESEARCH, 2009, 167 (01) :307-325
[9]   A PROJECTION METHOD FOR L(P) NORM LOCATION-ALLOCATION PROBLEMS [J].
BONGARTZ, I ;
CALAMAI, PH ;
CONN, AR .
MATHEMATICAL PROGRAMMING, 1994, 66 (03) :283-312
[10]  
Boukani FH, 2014, COMPUT APPL MATH, V76, P1091