Parallelization of the scatter search for the p-median problem

Parallel Computing

Volumn 29, Issue 5 SPEC., 2003, Pages 575-589

  García López, Félix ^a   Melián Batista, Belén ^a   Moreno Pérez, José A ^a   Moreno Vega, J Marcos ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Metaheuristics; p median problem; Parallelization; Scatter search

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; HEURISTIC METHODS; PROBLEM SOLVING;

SCATTER SEARCH;

PARALLEL PROCESSING SYSTEMS;

EID: 0037879126     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00043-7     Document Type: Article

References (41)

1. Beasley J.E. A note on solving large. p-median problems European Journal of Operational Research. 21:1985;270-273.
2. C. Brunschen, M. Brorsson, OdinMP/CCp-A Portable Implementation of OpenMP for C, in: Proceedings of First European Workshop on OpenMP EWOMP99, 1999, pp. 21-26.
3. Cornuejols G., Fisher M.L., Nemhauser G.L. Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms. Management Science. 23:1977;789-810.
4. du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilized column generation. Discrete Mathematics. 194:1999;229-237.
5. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research. 26:1978;992-1009.
6. Feo T.A., Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization. 6:1995;109-133.
7. Galvão R.D. A dual-bounded algorithm for the. p-median problem Operations Research. 28:1980;1112-1121.
8. García-López F., Melián-Batista B., Moreno-Pérez J.A., Moreno-Vega J.M. The parallel variable neighborhood search for the. p-median problem Journal of Heuristics. 8:2002;375-388.
9. Garey M.R., Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. 1979;W.H. Freeman and Co, San Francisco.
10. Glover F. Tabu search-part I. ORSA Journal on Computing. 1:1989;190-206.
11. Glover F. Tabu search-part II. ORSA Journal on Computing. 2:1990;4-32.
12. Glover F., Laguna M., Martí R. Fundamentals of scatter search and path relinking. Control and Cybernetics. 39(3):2000;653-684.
13. Hakimi S.L. Optimum location of switching centers and the absolute centers and the medians of a graph. Operations Research. 12:1964;450-459.
14. Hakimi S.L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research. 13:1965;462-475.
15. Hansen P., Mladenović N. Variable neighborhood search for the. p-Median Location Science. 5:1997;207-226.
16. Hansen P., Mladenović N. An introduction to variable neighborhood search. Voss S.et al. Metaheuristics Advances and Trends in Local Search Paradigms for Optimization. 1999;433-458 Kluwer.
17. Hansen P., Mladenović N. Variable neighborhood search: principles and applications. European Journal of Operational Research. 130:2001;449-467.
18. Hansen P., Mladenović N., Pérez-Brito D. Variable neighborhood decomposition search. Journal of Heuristics. 7:2001;335-350.
19. Hanjoul P., Peeters D. A comparison of two dual-based procedures for solving the. p-median problem European Journal of Operational Research. 20:1985;387-396.
20. Hodgson M.J. Toward more realistic allocation in location-allocation models: an interaction approach. Environment and Planning A. 10:1978;1273-1285.
21. Kariv O., Hakimi S.L. An algorithmic approach to network location problems, part 2. The. p-medians SIAM Journal on Applied Mathematics. 37:1969;539-560.
22. Kuehn A.A., Hamburger M.J. A heuristic program for locating warehouses. Management Science. 9:1963;643-666.
23. Laguna M. Scatter search. Pardalos P.M., Resende M.G.C. Handbook of Applied Optimization. 2002;183-193 Oxford University Press.
24. Lai T., Sahni S. Anomalies in parallel branch-and-bound algorithms. Communications of the ACM. 27(6):1984;594-602.
25. Lai T., Sprague A. Performance of parallel branch-and-bound algorithms. IEEE Transactions on computers C. 34(10):1985;962-964.
26. Maranzana F.E. On the location of supply points to minimize transportation costs. Operations Research Quarterly. 12:1964;138-139.
27. Mladenović N., Moreno-Pérez J.A., Moreno-Vega J.M. A chain-interchange heuristic method. Yugoslav Journal of Operational Research. 6:1996;41-54.
28. Nauss R.M., Markland R.E. Theory and application of an optimizing procedure for lock box location analysis. Management Science. 27:1981;855-865.
29. OpenMP: A proposed Industry Standard API for Shared Memory Programming, White Paper, October 1997. Available from http://www.openmp.org/openmp/mp-documents/paper/paper.html.
30. Reinelt G. TSP-Lib a travelling salesman library. ORSA Journal of Computing. 3:1991;376-384 http://www.iwr.uni-heidelberg.de/iwr/comopt/software/tsplib95.
31. M.G.C. Resende, R.F. Werneck, A GRASP with path-relinking for the p-median problem, Journal of Heuristics, in press.
32. M.G.C. Resende, R.F. Werneck, On the implementation of a swap-based local search procedure for the p-median problem, Technical Report TD-5E4QKA, AT&T Labs Research, 2002.
33. Rosing K.E. An empirical investigation of the effectiveness of a vertex substitution heuristic. Environment and Planning B. 24:1997;59-67.
34. Rosing K.E., ReVelle C.S., Rosing-Vogelaar H. The. p-median and its linear programming relaxation: an approach to large problems Journal of the Operational Research Society. 30(9):1979;815-823.
35. Rosing K.E., ReVelle C.S. Heuristic concentration: two stage solution construction. European Journal of Operational Research. 97:1997;75-86.
36. Rolland E., Schilling D.A., Current J.R. An efficient tabu search procedure for the. p-median problem European Journal of Operational Research. 96:1996;329-342.
37. Senne E.L.F., Lorena L.A.N. Langrangean/surrogate heuristics for. p-median problems Laguna M., González-Velarde J.L. Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research. 2000;115-130 Kluwer.
38. E.L.F. Senne, L.A.N. Lorena, Stabilizing column generation using Lagrangean/surrogate relaxation: an application to p-median location problems, European Journal of Operational Research, in press.
39. Teitz M.B., Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research. 16:1968;955-961.
40. Voss S. A reverse elimination approach for the. p-median problem Studies in Locational Analysis. 8:1996;49-58.
41. Whitaker R. A fast algorithm for the greedy interchange of large-scale clustering and median location prolems. INFOR. 21:1983;95-108.