Discrete Mathematical Programming for Public Library Location with a Line Barrier and K Passages: a Practical Application in Babolsar City
Amiri-Aref Mehdi1, Hashemi-Tilehnoi Maliheh2
1Department of Industrial Engineering, Mazandaran University of Science & Technology, Babol, Iran
2Department of Urbanism, Architecture & Urbanism Faculty, Tabriz Islamic Art University, Tabriz, Iran
Online published on 28 September, 2013.
This paper presents a discrete location problem to find p new public facilities’ location among the potential points with trespassing through K passages on a line barrier that is frequently encountered in practice. Indeed allocation of user points to established public facilities is also obtained by the proposed mathematical programming model. A Lagrangian relaxation algorithm in order to find the best location for a number of public centers is developed. To improve the solution quality, two constructive algorithms for initialization are presented, Myopic Algorithm and Greedy Algorithm. The empirical illustration for location of the public libraries and user allocation at the scale of Babolsar city is implemented.
Location, Lagrangian relaxation, Passages.