MATHEMATICAL MODEL AND STOCHASTIC MULTI-CRITERIA ACCEPTABILITY ANALYSIS FOR FACILITY LOCATION PROBLEM

被引:8
作者
Karabay, Selahattin [1 ]
Kose, Erkan [2 ]
Kabak, Mehmet [3 ]
Ozceylan, Eren [4 ]
机构
[1] Turkish Mil Acad, Def Sci Inst, TR-06654 Ankara, Turkey
[2] Aksaray Univ, Dept Ind Engn, TR-68100 Aksaray, Turkey
[3] Gazi Univ, Dept Ind Engn, TR-06570 Ankara, Turkey
[4] Gaziantep Univ, Dept Ind Engn, TR-27310 Gaziantep, Turkey
来源
PROMET-TRAFFIC & TRANSPORTATION | 2016年 / 28卷 / 03期
关键词
case study; facility location problem; mixed integer linear programming; Stochastic Multi-criteria Acceptability Analysis; public sector; SINGLE-SOURCE; BOUND ALGORITHM; HEURISTICS; NETWORK; SEARCH; SET;
D O I
10.7307/ptt.v28i3.1843
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper studies a real-life public sector facility location problem. The problem fundamentally originated from the idea of downsizing the number of service centres. However, opening of new facilities is also considered in case the current facilities fail to fulfil general management demands. Two operation research methodologies are used to solve the problem and the obtained results are compared. First, a mathematical programming model is introduced to determine where the new facilities will be located, and which districts get service from which facilities, as if there were currently no existing facilities. Second, the Stochastic Multi-criteria Acceptability Analysis-TRI (SMAA-TRI) method is used to select the best suitable places for service centres among the existing facilities. It is noted that the application of mathematical programming model and SMAA-TRI integration approach on facility location problem is the first study in literature. Compression of outcomes shows that mixed integer linear programming (MILP) model tries to open facilities in districts which are favoured by SMAA-TRI solution.
引用
收藏
页码:245 / 256
页数:12
相关论文
共 60 条
[1]  
Agar MC, 1998, J OPER RES SOC, V49, P1072, DOI 10.1057/palgrave.jors.2600621
[2]   A multi-exchange heuristic for the single-source capacitated facility location problem [J].
Ahuja, RK ;
Orlin, JB ;
Pallottino, S ;
Scaparra, MP ;
Scutellà, MG .
MANAGEMENT SCIENCE, 2004, 50 (06) :749-760
[3]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[4]   LP-based heuristics for the capacitated lot-sizing problem: the interaction of model formulation and solution algorithm [J].
Alfieri, A ;
Brandimarte, P ;
D'Orazio, S .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2002, 40 (02) :441-458
[5]   Network hub location problems: The state of the art [J].
Alumur, Sibel ;
Kara, Bahar Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (01) :1-21
[6]   A new method for solving capacitated location problems based on a set partitioning approach [J].
Baldacci, R ;
Hadjiconstantinou, E ;
Maniezzo, V ;
Mingozzi, A .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (04) :365-386
[7]   INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].
BALINSKI, ML .
MANAGEMENT SCIENCE, 1965, 12 (03) :253-313
[8]   AN ALGORITHM FOR SOLVING LARGE CAPACITATED WAREHOUSE LOCATION-PROBLEMS [J].
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 33 (03) :314-325
[9]   Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem [J].
Chen, Chia-Ho ;
Ting, Ching-Jung .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (06) :1099-1122
[10]  
Church Richard, 1974, PAPERS REGIONAL SCI, V32, P101, DOI [DOI 10.1007/BF01942293, 10.1007/BF01942293]