A population based hybrid metaheuristic for the p-median problem

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 75-82

  Pullan, Wayne ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS; POPULATION STATISTICS;

COMPUTER PROCESSORS; CROSSOVER OPERATORS; CUT AND PASTES; HYBRID SEARCH ALGORITHMS; LARGE RANGES; LOCAL SEARCHES; METAHEURISTIC; OVERALL COSTS; P-MEDIAN PROBLEMS;

PROBLEM SOLVING;

EID: 55749100492     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4630779     Document Type: Conference Paper

References (25)

1. C. ReVelle and R. Swain, "Central facilities location," Geographical Analysis, vol. 2, pp. 30-42, 1970.
2. B. C. Tansel, R. L. Francis, and T. J. Lowe, "Location on networks: a survey," Management Science, vol. 29, pp. 482-511, 1983.
3. M. R. Rao, "Cluster analysis and mathematical programming," Journal of the American Statistical Association, vol. 66, pp. 622-626, 1971.
4. O. Kariv and L. Hakimi, "An algorithmic approach to nework location problems, part ii the p-medians," SIAM Journal of Applied Mathematics, vol. 37, pp. 539-560, 1979.
5. J. E. Beasley, "A note on solving large p-median problems," European Journal of Operational Research, vol. 21, pp. 270-273, 19S5.
6. R. D. Galvão, "A dual-bounded algorithm for the p-median problem," Operations Research, vol. 28, pp. 1112-1121, 1980,
7. K. E. Rosing, C. S. ReVelle, and H. Rosing-Vogelaar, 'The p-median and its linear programming relaxation: An approach to large problems," Journal of the Operational Research Society, vol. 30, pp. 815-823, 1979.
8. R. M. Nauss and R. E. Markland, 'Theory and application of an optimizing procedure for lock box location analysis," Management Science, vol. 27, pp. 855-865, 1981.
9. P. Hansen, N. Mladenović, and D. Perez-Brito, "Variable neighborhood decomposition search," Journal of Heuristics, vol. 7, pp. 335-350, 2001.
10. P. Hansen and N. Mladenović, "Variable neighborhood search for the p-median," Location Science, vol. 5, pp. 207-226, 1997.
11. T. Cranic, M. Gendreau, P. Hansen, and N. Mladenović, "Cooperative parallel variable neighbourhood search for the p-median," Journal of Heuristics, vol. 10, pp. 293-314, 2004.
12. E. D. Taillard, "Heuristic methods for large centroid clustering problems," Journal of Heuristics, vol. 9, pp. 51-74, 2003.
13. E. L. F. Senne and L. A. N. Lorena, "Langrangean/surrogate heuristics for p-median problems," in Computing Tools for Modeling, Optimization and Simulation Interfaces in Computer Science and Operations Research, M. Laguna and J. L. Gonzalez-Velarde, Eds, Kluwer, 2000, pp. 115-130.
14. _, "Stabilizing column generation using lagrangean/surrogate relaxation an application to p-median location problems," European Journal of Operational Research, 2002.
15. O. Alp, E. Erkut, and Z. Drezner, "An efficient genetic algorithm for the p-median problem." Annals of Operations Research, vol. 122. pp. 21-12, 2003.
16. M. Resende and R. Werneck, "A hybrid heuristic for the p-median problem," Journal of Heuristics, vol. 10, pp. 59-S8, 2004.
17. A. Kuehn and M. Hamburger, "A heuristic program for locating warehouses," Management Science, vol. 9, pp. 643-666, 1963.
18. S. Kirkpatrick, J. Gellatt, and P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
19. F. Glover, "Tabu search - part 1," ORSA Journal on Computing, vol. 1, pp. 190-206, 1989.
20. R. D. Galvão and C. S. ReVelle, "A lagrangean heuristic for the maximal covering problem," European Journal of Operational Research, vol. 18, pp. 114-123, 1996.
21. G. Reinelt, "Tsplib a traveling salesman problem library," ORSA Journal on Computing, vol. 3, pp. 376-384, 1991.
22. E. L. F. Senne, "Personal communication to m.c.g. resende," 2002.
23. H. H. Hoos and T. Stützle, Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, USA, 2004.
24. W. Pullan and H. Hoos, "Dynamic local search for the maximum clique problem," Journal of Artificial Intelligence Research, vol. 26, pp. 159-185, 2006.
25. J. Watson, L. Whitley, and A. Howe, "Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search," Journal of Artificial Intelligence, vol. 24, pp. 221-261, 2005.