Advertisement

Hybrid Genetic Algorithm for Solving the p-Median Problem

  • Vladimir Estivill-Castro
  • Rodolfo Torres-Velázquez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1585)

Abstract

The p-median problem is an NP-complete combinatorial optimisation problem well investigated in the fields of facility location and more recently, clustering and knowledge discovery. We show that hybrid optimisation algorithms provide reasonable speed and high quality of solutions, allowing effective trade-of of quality of the solution with computational effort. Our approach to hybridisation is a tightly coupled approach rather than a serialisation of hill-climbers with genetic algorithms. Our hybrid algorithms use genetic operators that have some memory about how they operated in their last invocation.

Keywords

Genetic Algorithm Facility Location Travelling Salesman Problem Crossover Operator Facility Location Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Bianchi and R. Church, A non-binary encoded GA for a facility location problem, Working Paper, 1992 D. Geography, U. California, Santa Barbara.Google Scholar
  2. 2.
    B. Bozkaya, J. Zhang, and E. Erkut, An effective genetic algorithm for the p-median problem, Paper presented at INFORMS Conf. in Dallas, October 1997.Google Scholar
  3. 3.
    G. Cornuejols, M. Fisher, and G. Nemhauser. Location of bank accounts to optimize float: An analystic study of exact and approximate algorithms. Management Science, 23:789–910, 1977.zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    P. Densham and G. Rushton. A more efficient heuristic for solving large p-median problems. Papers in Regional Science, 71:307–329, 1992.CrossRefGoogle Scholar
  5. 5.
    V. Estivill-Castro and A.T. Murray. Discovering associations in spatial data-an efficient medoid based approach. In X. Wu, R. Kotagiri, and K.K. Korb, Proc. of the 2nd Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD-98), 110–121, Melbourne, Australia, 1998. Springer-Verlag LNAI 1394.Google Scholar
  6. 6.
    V. Estivill-Castro and A.T. Murray. Spatial clustering for data mining with genetic algorithms. Int. ICSC Symp. Engineering of Intelligent Systems EIS-98. 1998.Google Scholar
  7. 7.
    E. Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123–144, 1994.CrossRefGoogle Scholar
  8. 8.
    F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5:533–549, 1986.CrossRefMathSciNetGoogle Scholar
  9. 9.
    M. Goodchild and V. Noronha. Location-allocation for small computers. Monograph 8, U. of Iowa, 1983.Google Scholar
  10. 10.
    L. Hakimi. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12:450–459, 1964.zbMATHGoogle Scholar
  11. 11.
    C. Hosage and M. Goodchild. Discrete space location-allocation solutions from genetic algorithms. Annals of Operations Research, 6:35–46, 1986.CrossRefGoogle Scholar
  12. 12.
    R.C. Johnson. Record travelling salesman solution. TechWeb, June 29th 1998. http://www.techweb.com/.
  13. 13.
    L. Kaufman and P.J. Rousseuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, NY, US, 1990.Google Scholar
  14. 14.
    J.E. Maranzana. On the location of supply points to minimize transport costs. Operational Research Quarterly, 15:261–270, 1964.Google Scholar
  15. 15.
    H. Mühlenbein, M. Gorger-Schleuter, and O. Krämer. Evolution algorithms in combinatorial optimization. Parallel Computing, 7:65–85, 1988.zbMATHCrossRefGoogle Scholar
  16. 16.
    A.T. Murray and R.L. Church. Applying simulated annealing to location-planning models. J. of Heuristics, 2:31–53, 1996.CrossRefGoogle Scholar
  17. 17.
    A.T. Murray and V. Estivill-Castro. Cluster discovery techniques for exploratory spatial data analysis. Int. J. of GIS, 12(5):431–443, 1998.Google Scholar
  18. 18.
    S. Narula, U. Ogbu, and H. Samuelsson. An algorithm for the p-median problem. Operations Research, 25:709–713, 1977.zbMATHMathSciNetGoogle Scholar
  19. 19.
    R.T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In J. Bocca, M. Jarke, and C. Zaniolo, Proc. of the 20th Conf. on Very Large Data Bases (VLDB), 144–155, 1994. Santiago, Chile, Morgan Kaufmann.Google Scholar
  20. 20.
    N.J. Radcliffe. Genetic set recombination. In L. D. Whitley, Foundations of Genetic Algorithms 2, 203–219, San Mateo, CA, 1993. FOGA-92 Morgan Kaufmann.Google Scholar
  21. 21.
    N.J. Radcliffe and F.A.W. George. A study of set recombination. Proc. Fifth Int. Conf. Genetic Algorithms, 23–30, San Mateo, CA, 1993. Morgan Kaufmann.Google Scholar
  22. 22.
    C. Reeves. Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63:371–396, May 1996.Google Scholar
  23. 23.
    C. ReVelle and R. Swain. Central facilities location. Geographical Analysis, 2:30–42, 1970.CrossRefGoogle Scholar
  24. 24.
    Rice News. Researchers forge new optimal path for traveling salesman problem. Rice University, June 25th 1998.Google Scholar
  25. 25.
    D. Rolland, E. Schilling and J. Current. An efficient tabu search procedure for the p-median problem. European J. of Operations Research, 96:329–342, 1996.CrossRefGoogle Scholar
  26. 26.
    K. Rosing. An optimal method for solving the (generalized) multi-Weber problem. European J. of Operations Research, 58:414–426, 1992.zbMATHCrossRefGoogle Scholar
  27. 27.
    K. Rosing, E. Hillsman, and H. Rosing. A note comparing optimal and heuristic solutions to the p-median problem. Geographical Analysis, 11:86–89, 1979.CrossRefGoogle Scholar
  28. 28.
    K.E. Rosing, C.S. Revelle, and H. Rosing-Voyelaar. The p-median and its linear programming relaxation: An approach to large problems. J. of the Operational Research Society, 30:815–823, 1979.zbMATHCrossRefGoogle Scholar
  29. 29.
    P. Sorensen. Analysis and design of heuristics for the p-median location-allocation problem. MSc’s thesis, D. Geography, U. California, Santa Barbara, 1994.Google Scholar
  30. 30.
    M.B. Teitz and P. Bart. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16:955–961, 1968.zbMATHGoogle Scholar
  31. 31.
    N.L.J. Ulder, E.H.L. Aarts, H.-J. Bandelt, P.J.M. van Laarhoven, and E. Pesch. Genetic local search algorithms for the travelling salesman problem. H.-P. Schwefel and P. Manner, eds., Proc. of 1st Workshop on Parallel Problem Solving from Nature, 109–116, Berlin, 1991. Springer Verlag.Google Scholar
  32. 32.
    J. Weaver and R. Church. A median location model with nonclosest facility service. Transportation Science, 19:107–119, 1985.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Vladimir Estivill-Castro
    • 1
  • Rodolfo Torres-Velázquez
    • 2
  1. 1.Department of Computer Science & Software EngineeringThe University of NewcastleCallaghanAustralia
  2. 2.Institut d’Investigacifó en Intelligencia Artificial (IIIA), Spanish Scientific Research Council (CSIC)Campus Universitat Autónoma de BarcelonaBellaterra, BarcelonaSpain

Personalised recommendations