Tabu search for large location-allocation problems

Journal of the Operational Research Society

Volumn 48, Issue 7, 1997, Pages 745-750

  Ohlemueller M ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Location; Location allocation problem; Tabu search

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; HEURISTIC METHODS; NUMERICAL METHODS; PRODUCTION;

LOCATION ALLOCATION PROBLEM; TABU SEARCH;

OPTIMIZATION;

EID: 0031188486     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600409     Document Type: Article

References (13)

1. Cooper, L., (1963). Location-allocation problems. Opns Res 11: 331-343.
2. Cooper, L., (1972). The transportation-location problem. Opns Res 20: 94-108.
3. Cooper, L., (1964). Heuristic methods for location-allocation problems. SIAM Rev 6: 37-53.
4. Kuenne, R.E., Sol RM, (1972). Exact approximate solutions to the multisourceWeber problem. Math Prog 3: 193-209.
5. Love, R.F., Morris, J.G., (1975). A computation procedure for the exact solution of location-allocation problems with rectangular distances. Naval Res Logist Q 22: 441-453.
6. Sherali, A.D., Shetty C.M., (1977). The rectilinear distance location-allocation problem. AIIE Trans 9: 136-143.
7. Love, R.F., Jue, l.H., (1982). Properties solution methods for large location-allocation problems. J Opl Res Soc 33: 443-452.
8. Liu, C.M., Kao, R.L., Wang, A.H., (1994). Solving location- allocation problems with rectilinear distances by simulated annealing. J Opl Res Soc 45: 1304-1315.
9. Wesolowsky, G.O., (1993). The Weber problem. Location Sci 1: 5-23.
10. Voû, S., (1993). Intelligent Search, Informal report, TH Darmstadt, Germany.
11. Glover, F., (1989). Tabu search part I. ORSA J Computing 1: 190-206.
12. Glover, F., (1990). Tabu search part II. ORSA J Computing 2: 4-32.
13. Eyster, J.W., White, J. A., Wierwille, W.W., (1973). On solving multifacility location problems using a hyperboloid approximation procedure. AIIE Trans 5: 1-6.