An efficient tabu search procedure for the p-Median Problem

European Journal of Operational Research

Volumn 96, Issue 2, 1997, Pages 329-342

  Rolland, Erik ^a   Schilling, David A ^b   Current, John R ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Facility location; Heuristics; P median; Tabu search

Indexed keywords

CALCULATIONS; FACILITIES; HEURISTIC METHODS; LOCATION; RANDOM PROCESSES;

FACILITY LOCATION; TABU SEARCH;

ONLINE SEARCHING;

EID: 0030736572     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00141-5     Document Type: Article

References (34)

1. Brandeau, M.L., and Chiu, S.S. (1989), "An overview of some representative location problems," Management Science 35, 645-674.
2. Cornuejols, G., Fisher, M.L., and Nemhauser, G.L. (1977), "Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms". Management Science 23, 789-810.
3. Current, J., and Schilling, D.A. (1994), "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research 73, 1994.
4. Daṡkin, M. (1995), Network and Discrete Location Analysis, John Wiley and Sons, New York.
5. Densham, P.J., and Rushton, G. (1992), "A more efficient heuristic for solving large p-median problems", Papers in Regional Science: The Journal of the RSAI 71/3, 307-329.
6. deWerra, D., and Hertz, A. (1989), "Tabu search techniques: A tutorial and an application to neural networks", OR Spectrum 11, 131-141.
7. Friden, C., Hertz, A. and deWerra, D. (1989), "Stabulus: A technique for finding stable sets in large graphs with tabu search", ORSA Journal of Computing 42, 35-44.
8. Galvao, R.D. (1980), "A dual-bounded algorithm for the p-median problem", Operations Research 28, 1112-1121.
9. Galvao, R.D. (1993), "Use of lagrangean relaxation in the solution of uncapacitated facility location problems", Location Science 1, 57-70.
10. Glover, F. (1986), "Future paths for integer programming and links to artificial intelligence", Computers and Operations Research 13, 533-549.
11. Glover, F. (1990a), "Tabu search; A tutorial", Technical Report, University of Colorado, Boulder, CO 80309.
12. Glover, F. (1989), "Tabu search - Part I", ORSA Journal of Computing 1/3.
13. Glover, F. (1990b), "Tabu search - Part II", ORSA Journal of Computing 2/1.
14. Glover, F., and Laguna, M. (1993), "Tabu search", in: C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Publishing.
15. Glover, F., Taillard, E., and deWerra, D. (1992), "A user's guide to tabu search", Annals of Operations Research.
16. Hansen, P. (1986), "The steepest ascent mildest descent heuristic for combinatorial programming", Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
17. Goodchild, M.F., and Noronha, V. (1983), Location-Allocation for Small Computers, University of Iowa, Monograph No. 8.
18. Hakimi, S.L. (1964), "Optimal locations of switching centers and the absolute centers and the medians of a graph", Operations Research 12, 450-459.
19. Hakimi, S.L. (1965), "Optimum distribution of switching centers in a communications network and some related graph theoretic problems", Operations Research 13, 462-475.
20. Hertz, A., and deWerra, D. (1987), "Using tabu search techniques for graph coloring", ORSA Journal of Computing 29, 345-351.
21. Kariv, O., and Hakimi, S.L. (1979), "An algorithmic approach to network location problems, Part 2: The p-medians", SIAM Journal of Applied Mathematics 37, 539-560.
22. Klincewicz, J.G. (1992), "Avoiding local optima in the p-hub location problem using tabu search and grasp", Annals of Operations Research 40, 121-132.
23. Laguna, M., Barnes, J.W., and Glover, F. (1991), "Tabu search for a single machine scheduling problem", Journal of Intelligent Manufacturing 2, 253-260.
24. Narula, S.C., Ogbu, U.I., and Samuelson, H.M. (1977), "An algorithm for the p-median problem", Operations Research 25, 709-713.
25. ReVelle, C. and Swain, R. (1970) Central facilities location, Geographical Analysis, 2, 30-42.
26. Rolland, E., Pirkul, H., and Glover, F. (1995), "Tabu search for graph partitioning", Annals of Operations Research.
27. Rolland, E., and Gupta, R. (1995), "Visual exploratory heuristic design: An example of tabu search animation", Working Paper, The A. Gary Anderson Graduate School of Management, University of California, Riverside.
28. Ryan, J. (1992), "The depth and width of local minima in discrete solution spaces", Technical Report, Department of Mathematics, University of Colorado, Denver.
29. Skorin-Kapov, J. (1990a), "Tabu search applied to the quadratic assignment problem", ORSA Journal of Computing 2/1.
30. Skorin-Kapov, J. (1990b), "Extensions of a tabu search adaptation to the quadratic assignment problem", Working Paper HAR-90-006, Harriman School for Management and Policy, SUNY at Stony Brook, Stony Brook, NY.
31. Taillard, E. (1991), "Robust taboo search for the quadratic assignment problem", Parallel Computing 17, 443-455.
32. Tansel, B.C., Francis, R.L., and Lowe, T.J. (1983), "Location on networks: A survey, Part I: The p-center and p-median problems", Management Science 29/4.
33. Teitz, M.B., and Bart, P. (1968), "Heuristic methods for estimating the generalized vertex median of a weighted graph", Operations Research 16, 955-961.
34. Weaver, J.R., and Church, R. (1985), "A median location model with nonclosest facility services", Transportation Science 19/1, 58-74.