Distance Constrained Location Problems
- *Corresponding Author:
- Mowffq Al-Sanousi
Contract advisor - Industrial engineer
ARAMCO, 11383, KSA
Tel: 234-4888 055
E-mail: [email protected]
Received September 14, 2015; Accepted October 31, 2015; Published November 03, 2015
Citation:Al-Sanousi M, Pirim H (2015) Distance Constrained Location Problems. Ind Eng Manage 4:181. doi:10.4172/2169-0316.1000181
Copyright: © 2015 Al-Sanousi M, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Organizations are subject to decisions regarding the location of facilities and the required minimum number of the facilities to satisfy certain needs. In this regard, p-median and set covering problems are discussed in a way that they are not adequate under some real-world scenarios. Hence, this paper introduces an optimization model for providing the required number of facilities and their locations to serve different sets of nodes (i.e., departments) within a specified distance range. A deterministic integer programming model is developed and implemented on a real-world problem.