Hybrid Genetic Algorithm for Solving the p-Median Problem
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.
KeywordsGenetic Algorithm Facility Location Travelling Salesman Problem Crossover Operator Facility Location Problem
Unable to display preview. Download preview PDF.
- 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.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
- 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.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
- 9.M. Goodchild and V. Noronha. Location-allocation for small computers. Monograph 8, U. of Iowa, 1983.Google Scholar
- 12.R.C. Johnson. Record travelling salesman solution. TechWeb, June 29th 1998. http://www.techweb.com/.
- 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.J.E. Maranzana. On the location of supply points to minimize transport costs. Operational Research Quarterly, 15:261–270, 1964.Google Scholar
- 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
- 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.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.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.C. Reeves. Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63:371–396, May 1996.Google Scholar
- 24.Rice News. Researchers forge new optimal path for traveling salesman problem. Rice University, June 25th 1998.Google Scholar
- 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
- 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