Facility location with and without maximum distance constraints through the p‐median problem
- 1 October 1995
- journal article
- Published by Emerald in International Journal of Operations & Production Management
- Vol. 15 (10), 75-81
- https://doi.org/10.1108/01443579510098338
Abstract
The p‐median problem involves the locating of a fixed number of facilities to serve a set of customers such that the aggregate distance travelled is minimized. Considers the p‐median problem with and without distance constraints. Solves the two versions of the p‐median problems utilizing the heuristic proposed by Teitz and Bart using three different data sets. Also provides optimal solutions to these problems using the Lagrangian relaxation and subgradient methods in the branch‐and‐bound procedure. Shows that the heuristic performs quite well except for the cases where the constraints are tight (few facilities and/or small maximum distance).Keywords
This publication has 5 references indexed in Scilit:
- A Comparison of Two Heuristic Methods for the p‐Median Problem with and without Maximum Distance ConstraintsInternational Journal of Operations & Production Management, 1991
- A Comparison of Heuristic Methods for Service Facility LocationsInternational Journal of Operations & Production Management, 1988
- The Location of Emergency Service FacilitiesOperations Research, 1971
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted GraphOperations Research, 1968
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic ProblemsOperations Research, 1965