Abstract
The search for p-median vertices on a network (graph) is a classical location problem. The p facilities (medians) must be located so as to minimize the sum of the distances from each demand vertex to its nearest facility. The Capacitated p-Median Problem (CPMP) considers capacities for the service to be given by each median. The total service demanded by vertices identified by p-median clusters cannot exceed their service capacity. Primal-dual based heuristics are very competitive and provide simultaneously upper and lower bounds to optimal solutions. The Lagrangean/surrogate relaxation has been used recently to accelerate subgradient like methods. The dual lower bound have the same quality of the usual Lagrangean relaxation dual but is obtained using modest computational times. This paper explores improvements on upper bounds applying local search heuristics to solutions made feasible by the Lagrangean/surrogate optimization process. These heuristics are based on location-allocation procedures that swap medians and vertices inside the clusters, reallocate vertices, and iterate until no improvements occur. Computational results consider instances from the literature and real data obtained using a geographical information system.
Similar content being viewed by others
References
Bramel, J. and D. Simchi-Levi. (1995). “A Location Based Heuristic for General Routing Problems.” Operations Research 43, 649–660.
Cooper, L. (1963). “Location-Allocation Problems.” Operations Research 11, 331–343.
ESRI-Environmental Systems Research Institute, Inc. Avenue Customization and Application Development for ArcView, 1996.
Franca, P.M., N.M. Sosa, and V. Pureza. (1999). “An Adaptive Tabu Search Algorithm for the Capacitated p-Median Problem.” International Transactions in Operations Research 6, 665–678.
Held, M. and R.M. Karp. (1970). “The Traveling Salesman Problem and Minimum Spanning Trees.” Operations Research 18, 1138–1162.
Klein, K. and J.E. Aronson. (1991). “Optimal Clustering: A Model and Method.” Naval Research Logistics 38, 447–461.
Koskosidis, Y.A. and W.R. Powell. (1992). “Clustering Algorithms for Consolidation of Costumes Orders into Vehicle Shipments.” Transportation Research B 26, 365–379.
Lorena, L.A.N. and F.B. Lopes, (1994). “A Surrogate Heuristic for Set Covering Problems.” European Journal of Operational Research 79, 138–150.
Lorena, L.A.N. and M.G. Narciso. (1996). “Relaxation Heuristics for a Generalized Assignment Problem.” European Journal of Operational Research 91, 600–610.
Lorena, L.A.N. and E.L.F. Senne. (1999). “Improving Traditional Subgradient Scheme for Lagrangean Relaxation: An Application to Location Problems.” International Journal of Mathematical Algorithms 1, 133–151.
Maniezzo, V., A. Mingozzi, and R. Baldaci. (1998). “ABionomic Approach to the Capacitated p-Median Problem.” Journal of Heuristics 4, 263–280.
Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons.
Mulvey, J.M. and M.P. Beck. (1984). “Solving Capacitated Clustering Problems.” European Journal of Operational Research 18, 339–348.
Narciso, M.G. and L.A.N. Lorena. (1999). “Lagrangean/Surrogate Relaxation for Generalized Assignment Problems.” European Journal of Operational Research 114, 165–177.
Osman, I.H. and N. Christofides. (1994). “Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search.” International Transactions in Operational Research 1, 317–336.
Senne, E.L.F. and L.A.N. Lorena. (2000). “Lagrangean/Surrogate Heuristics for p-Median Problems.” In M. Laguna and J.L. Gonzalez-Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers, pp. 115–130.
Spath, H. (1980). Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood Publishers.
Taillard, E.D. (1996). “Heuristic Methods for Large Centroid Clustering Problems.” Technical Report IDSIA 96–96, IDSIA.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lorena, L.A.N., Senne, E.L.F. Local Search Heuristics for Capacitated p-Median Problems. Networks and Spatial Economics 3, 407–419 (2003). https://doi.org/10.1023/A:1027353520175
Issue Date:
DOI: https://doi.org/10.1023/A:1027353520175