Advertisement

Journal of Heuristics

, Volume 9, Issue 1, pp 51–73 | Cite as

Heuristic Methods for Large Centroid Clustering Problems

  • Éric D. Taillard
Article

Abstract

This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and the multi-source Weber problems. Centroid clustering is to partition a set of entities into a given number of subsets and to find the location of a centre for each subset in such a way that a dissimilarity measure between the entities and the centres is minimized. The first method proposed is a candidate list search that produces good solutions in a short amount of time if the number of centres in the problem is not too large. The second method is a general local optimization approach that finds very good solutions. The third method is designed for problems with a large number of centres; it decomposes the problem into subproblems that are solved independently. Numerical results show that these methods are efficient—dozens of best solutions known to problem instances of the literature have been improved—and fast, handling problem instances with more than 85,000 entities and 15,000 centres—much larger than those solved in the literature. The expected complexity of these new procedures is discussed and shown to be comparable to that of an existing method which is known to be very fast.

clustering location-allocation p-median sum-of-squares clustering multi-source Weber problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beasley, J. (1985). “A Note on Solving Large p-Median Problems.” European Journal of Operational Research 21, 270–273.Google Scholar
  2. Bhaskaran, S. (1992). “Identification of Transshipment Center Locations.” European Journal of Operational Research 63, 141–150.Google Scholar
  3. Bongartz, I., P.H. Calamai, and A.R. Conn. (1994). “A Projection Method for l p Norm Location-Allocation Problems.” Mathematical Programming 66, 283–313.Google Scholar
  4. Brimberg, J., P. Hansen, N. Mladenovic, and É.D. Taillard. (2000). “Improvements and Comparison of Heuristics for Solving the Multisource Weber Problem.” Operations Research 48(1), 129–135.Google Scholar
  5. Chen, R. (1983). “Solution of Minisum and Minimax Location-Allocation Problems with Euclidean Distances.” Naval Research Logistics Quarterly 30, 449–459.Google Scholar
  6. Cooper, L. (1963). “Location-Allocation Problems.” Operations Research 11, 331–343.Google Scholar
  7. Daskin, M.S. (1995). Network and Discrete Location. New-York: J. Wiley & Sons.Google Scholar
  8. Diehr, G. (1985). “Evaluation of a Branch and Bound Algorithm for Clustering.” SIAM Journal on Scientific and Statistical Computing 6, 268–284.Google Scholar
  9. Dokmeci, V.F. (1977). “A Quantitative Model to Plan Regional Health Facility Systems.” Management Science 24, 411–419.Google Scholar
  10. Dyer, M.E. and A.M. Frieze. (1985). “A Simple Heuristic for the p-Centre Problem.” Operations Research Letters 3, 285–288.Google Scholar
  11. Edwards, A.W.F. and L.L. Cavalli-Sforza. (1965). “A Method for Cluster Analysis.” Biometrics 21, 362–375.Google Scholar
  12. Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” Operation Research 26, 1590–1602.Google Scholar
  13. Fleischmann, B. and J.N. Paraschis. (1988). “Solving a Large Scale Districting Problem: A Case Report.” Computers & Operations Research 15, 521–533.Google Scholar
  14. Glover, F. (1990). “Tabu Search for the p-Median Problem.” Technical Report.Google Scholar
  15. Goodchild, M.F. and V. Noronha. (1983). “Location-Allocation for Small Computers.” University of Iowa, Monograph No. 8.Google Scholar
  16. Gordon, A.D. (1981). Classification: Methods for the Exploratory Analysis of Multivariate Data. New York: Chapman and Hall.Google Scholar
  17. Hakimi, S.L. (1965). “Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems.” Operations Research 13, 462–475.Google Scholar
  18. Hanjoul, P. and D. Peeters. (1985). “A Comparison of Two Dual-Based Procedures for Solving the p-Median Problem.” European Journal of Operational Research 20, 387–396.Google Scholar
  19. Hansen, P. and N. Mladenovic. (1999). “An Introduction to Variable Neighborhood Search.” In S. Voss, S. Martello, I.H. Osman, and C. Roucairol (eds.), Meta-Heuristic: Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer. pp. 433–458.Google Scholar
  20. Hansen, P., N. Mladenovic and É.D. Taillard. (1998). “Heuristic Solution of the Multisource Weber Problem as a p-Median Problem.” OR Letters 22, 55–62.Google Scholar
  21. Hartigan, J.A. (1975). Clustering Algorithms. New York: Wiley.Google Scholar
  22. Hidaka, K. and H. Okano. (1997). “An Approach for Solving a Real-World Facility Location Problem Using Digital Map.” Presented at the EURO XV—INFORMS XXXIV Meeting, Barcelona, Spain.Google Scholar
  23. Jancey, R.C. (1966). “Multidimensional Group Analysis.” Australian Journal of Botany 14, 127–130.Google Scholar
  24. Koontz, W.L.G., P.M. Narendra, and K. Fukunaga. (1975). “A Branch and Bound Clustering Algorithm.” IEEE Transactions on Computers 24, 908–915.Google Scholar
  25. Krau, S. (1997). “Extensions du problème de Weber.” Thèse de doctorat de l’ École Polytechnique de Montréal, Canada.Google Scholar
  26. Lentnek, B., A. MacPerson, and D. Phillips. (1993). “Optimum Producer Services Location.” Environment and Planning A 24, 467–479.Google Scholar
  27. MacQueen, J.B. (1967). “Some Methods for Classification and Analysis of Multivariate Observations.” In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability 1. pp. 281–297.Google Scholar
  28. Mirchandani, P. and R. Francis (eds.). (1990). Discrete Location Theory. Wiley-Interscience.Google Scholar
  29. Mladenovic, N. and J. Brimberg. (1996). “A Degeneracy Property in Continuous Location-Allocation Problems.” Publication of the GERAD G-96–37, University of Montreal, Canada.Google Scholar
  30. Moreno, J., C. Rodrígez, and N. Jiménez. (1991). “Heuristic Cluster Algorithm for Multiple Facility Location-Allocation Problem.” Recherche Opérationnelle/Operations Research 25, 97–107.Google Scholar
  31. Murtagh, B.A. and S.R. Niwattisyawong. (1982). “An Efficient Method for the Multi-Depot Location-Allocation Problem.” Journal of the Operational Research Society 33, 629–634.Google Scholar
  32. Rapin, C. (1983). “Cours d'informatique générale.” École Polytechnique Fédérale de Lausanne.Google Scholar
  33. Reinelt, G. (1995). “TSPLIB95.” Publication of the Institut für Angewandte Mathematik, Universität Heidelberg. Also available at http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95.Google Scholar
  34. ReVelle, L. and R. Swain. (1970). “Central Facilities Location.” Geographical Analysis 2, 30–42.Google Scholar
  35. Rolland, E., D.A. Schilling, and J.R. Current. (1997). “An Efficient Tabu Search Procedure for the p-Median Problem.” European Journal of Operational Research 96, 329–342.Google Scholar
  36. Rosing, K.E. (1992). “An Optimal Method for Solving the (Generalized) Multi-Weber Problem.” European Journal of Operational Research 58, 414–426.Google Scholar
  37. Rosing, K.E., C.S. ReVelle, and H. Rosing-Vogelaar. (1979). “The p-Median and its Linear Programming Relaxation: An Approach to Large Problems.” Journal of the Operational Research Society 30, 815–823.Google Scholar
  38. Saaty, T.L. (1972). “Optimum Positions for Airports.” Naval Research Logistics Quarterly 19, 101–109.Google Scholar
  39. Späth, H. (1985). Cluster Dissection and Analysis (Theory, Fortran Programs Examples). Chichester: Ellis Hérword.Google Scholar
  40. Taillard, É.D. (1993). “Parallel Iterative Search Methods for Vehicle Routing Problems.” Networks 23, 661–676.Google Scholar
  41. Taillard, É.D. and S. Voβ. (2002). “POPMUSIC: Partial Optimization Metaheuristic Under Special Intensification Conditions.” In C.C. Ribeiro and P. Hansen (eds.), Essay and Survey in Metaheuristics. Kluwer, pp. 613–629.Google Scholar
  42. Voβ, S. (1996). “A Reverse Elimination Approach for the p-Median Problem.” Studies in Locational Analysis 8, 49–58.Google Scholar
  43. Ward, J.H. (1963). “Hierarchical Grouping to Optimize an Objective Function.” Journal of the American Statistical Association 58, 236–244.Google Scholar
  44. Weiszfeld, E. (1937). “Sur le point pour lequel la somme des distances de n points donnés est minimum.” Tôhoku Mathematical Journal 43, 355–386.Google Scholar
  45. Wesolowsky, G. (1993). “The Weber Problem: History and Perspectives.” Location Science 1, 5–23.Google Scholar
  46. Whitaker, R. (1983). “A Fast Algorithm for the Greedy Interchange for Large-Scale Clustering and Median Location Problems.” INFOR 21, 95–108.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Éric D. Taillard
    • 1
  1. 1.EIVDUniversity of Applied Sciences of Western SwitzerlandYverdon-les-BainsSwitzerland

Personalised recommendations