A genetic algorithm for solving a capacitated p-median problem

Numerical Algorithms

Volumn 35, Issue 2-4, 2004, Pages 373-388

  Correa, Elon Santos ^a   Steiner, Maria Teresinha A ^b   Freitas, Alex A ^c   Carnieri, Celso ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

^c PONTIFICAL CATHOLIC UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

Facility location; Genetic algorithms; p median problem; Tabu search

Indexed keywords

EID: 4043081276     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:NUMA.0000021767.42899.31     Document Type: Conference Paper

References (17)

1. T. Back, D.B. Fogel and T. Michalewicz, Evolutionary Computation 1: Basic Algorithms and Operators (Institute of Physics, Bristol, UK, 2000).
2. L.B. Booker, Improving search in genetic algorithms, in: Genetic Algorithms and Simulated Annealing, ed. L. Davis (Morgan Kauffmann, Los Altos, CA, 1987) pp. 61-73.
3. E.S. Correa, Algoritmos geneticos e busca tabu aplicados ao problema das p-medianas, Master dissertation, Programa de Pós-Graduação em Metodos Numericos em Engenharia, Universidade Federal do Parana, Brazil (2001).
4. C. Dibble and P.J. Densham, Generating interesting alternatives in GIS and SDSS using genetic algorithms, GIS/LIS Symposium, University of Nebraska, Lincoln, 1993.
5. E. Erkut, B. Bozkaya and J. Zhang, An effective genetic algorithm for the p-median problem, Preprint (2001).
6. A. Fairley, Comparison of choosing the crossover point in the genetic crossover operation, Preprint, Department of Computer Science, University of Liverpool (1991).
7. F. Glover, Scatter search and path relinking, Preprint, Graduate School of Business, University of Colorado, Boulder (1999).
8. F. Glover, Tabu search for the p-median problem, Preprint, University of Colorado, Boulder (1999).
9. F. Glover and M. Laguna, Tabu Search (Kluwer Academic, University of Colorado, 1997).
10. D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning (Addison-Wesley, Menlo Park, CA, 1989).
11. M.F. Goodchild and V. Noronha, Location-Allocation for Small Computers, Monograph No. 8 (University of Iowa, 1983).
12. C.M. Hosage and M.F. Goodchild, Discrete space location-allocation solutions from genetic algorithms, Ann. Oper. Res. 6 (1986) 35-46.
13. O. Kariv and S.L. Hakimi, The p-median problems, in: An Algorithmic Approach to Network Location Problems, SIAM J. Appl. Math. 37 (1979) 539-560.
14. S.F. Mayerle, Um algoritmo genetico para o problema do caixeiro viajante, Preprint, Programa de Pós-Graduação em Engenharia de Produção, Universidade Federal de Santa Catarina (UFSC), Florianopolis, Santa Catarina, Brazil (1996).
15. J.A. Moreno-Perez, J.M. Moreno-Vega and N. Mladenovic, Tabu search and simulated annealing in p-median problems, Talk at: The Canadian Operational Research Society Conf., Montreal, 1994.
16. C. Revelle and R. Swain, Central facilities location, Geographical Analysis 2 (1970) 30-42.
17. M.B. Teitz and P. Bart, Heuristic concentration: Two-stage solution construction, Oper. Res. Soc. 16 (1968) 955-961.