Heuristic concentration and Tabu search: A head to head comparison

European Journal of Operational Research

Volumn 104, Issue 1, 1998, Pages 93-99

  Rosing, K E ^a   ReVelle, C S ^b   Rolland, E ^c   Schilling, D A ^d   Current, J R ^d  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b The Johns Hopkins University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d OHIO STATE UNIVERSITY   (United States)

Author keywords

Heuristic concentration; Heuristics; Location; P median; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING;

HEURISTIC CONCENTRATION; TABU SEARCH;

HEURISTIC METHODS;

EID: 0031699497     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00310-X     Document Type: Article

References (21)

1. Cplex, 1995. Using the Cplex Callable Library, Cplex Optimization. Incline Village, NV.
2. Densham, P.J., Rushton, G., 1992a. Strategies for solving large location-allocation problems by heuristic methods. Environment and Planning A 24, 289-304.
3. Densham, P.J., Rushton, G., 1992b. A more efficient heuristic for solving large P-median problems. Papers in Regional Science 71, 307-329.
4. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 5, 533-549.
5. Glover, F., 1989. Tabu search - Part I. ORSA Journal of Computing 1 (3), 190-206.
6. Glover, F., 1990. Tabu search - Part II. ORSA Journal of Computing 2 (1), 4-32.
7. Glover, F., Laguna, M., 1993. Tabu search. In: Reeves, C. (Ed.), Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford, pp. 70-150.
8. Goodchild, M.F., Noronha, V., 1983. Location-Allocation for Small Computers, Monograph No. 8. Department of Geography, University of Iowa, Iowa City, Iowa.
9. Hansen, P., 1986. The steepest ascent mildest descent heuristic for combinatorial programming. Paper Presented at Congress on Numerical Methods in Combinatorial Optimization. Capri, Italy.
10. Hakimi, S.L., 1964. Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450-459.
11. Hakimi, S.L., 1965. Optimal distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research 13, 462-475.
12. Morris, J.D., 1978. On the extent to which certain fixed charge depot location problems can be solved by LP. Journal of the Operational Research Society 29, 71-76.
13. Pirlot, M., 1992. General local search heuristics in combinatorial optimization: A tutorial. JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science 32, 7-67.
14. Pirlot, M., 1996. General local search methods. European Journal of Operational Research 92, 493-511.
15. ReVelle, C.S., 1993. Facility siting and integer-friendly programming. European Journal of Operational Research 65, 147-158.
16. ReVelle, C.S., Swain, R., 1970. Central facilities location. Geographical Analysis 2, 30-42.
17. Rolland, E., Schilling, D.A., Current, J.R., 1997. An efficient Tabu search procedure for the P-median problem. European Journal of Operational Research 96, 329-342.
18. Rosing, K.E., 1997. An empirical investigation of the power of a vertex substitution heuristic. Environment and Planning B 24, 59-67.
19. Rosing, K.E., ReVelle, C.S., 1997. Heuristic concentration: Two stage solution construction. European Journal of Operational Research 97, 75-86.
20. Rosing, K.E., ReVelle, C.S., Rosing-Vogelaar, H., 1979. The P-median and its linear programming relaxation: An approach to large problems. Journal of the Operational Research Society 30, 815-823.
21. Teitz, M.B., Bart, P., 1968. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16, 955-961.