Selahattin Karabay
Turkish Military Academy
Erkan Köse
Turkish Military Academy
Mehmet Kabak
Gazi University
Eren Ozceylan
Gaziantep University
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.
Weber A. About the location of industries [in German]. Erster Teil: Reine Theorie des Standortes; 1909.
ReVelle CS, Eiselt HA. Location analysis: A synthesis and survey. Eur J Oper Res. 2005 Aug;165(1):1-19.
Hakimi SL. Optimum locations of switching centres and the absolute centres and medians of a graph. Oper Res. 1964 May;12(3):450-459.
Kariv O, Hakimi SL. An algorithmic approach to network location problems. Part II: The p-median. SIAM
J Applied Math. 1979 Dec;37(3):539-560.
Reese J. Solution methods for the p-median problem: an annotated bibliography. Networks. 2006 Aug;48(3):125-142.
Lim GJ, Reese J, Holder A. Fast and robust techniques for the euclidean p-median problem with uniform weights. Comp & Ind Eng. 2009 Oct;57(3):896-905.
Teitz MB, Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res. 1968 Oct;16(5):955-961.
Aguado JS, Trandafir PC. Some heuristic methods for solving p-median problems with a cover
Guest Editor: Eleonora Papadimitriou, PhD
Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD
Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal