[ij] [ij] [ij] 
Email id

Asian Journal of Development Matters
Year : 2013, Volume : 7, Issue : 1
First page : ( 94) Last page : ( 114)
Print ISSN : 0973-9629. Online ISSN : 0976-4674.

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.


║ Site map ║ Privacy Policy ║ Copyright ║ Terms & Conditions ║ Page Rank Tool
755,073,335 visitor(s) since 30th May, 2005.
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.