Gamma heuristic for the p-median problem

European Journal of Operational Research

Volumn 117, Issue 3, 1999, Pages 522-532

  Rosing, K E ^a   ReVelle, C S ^b   Schilling, D A ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b The Johns Hopkins University   (United States)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACILITIES; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LOCATION;

CONCENTRATION SET; GAMMA HEURISTICS; HEURISTIC CONCENTRATION; P-MEDIAN PROBLEM;

PROBLEM SOLVING;

EID: 0032674095     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00268-9     Document Type: Article

References (24)

1. Cornuejols, G., Fisher, M.L., Nemhauser, G.L., 1977. Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms. Management Science 23, 789-810.
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. Galvão, R.D., 1980. A dual-Bounded algorithm for the p-median problem. Operations Research 28, 1112-1121.
5. Garfinkel, R.S., Neebe, A.W., Rao, M.R., 1974. An algorithm for the m-median plant location problem. Transportation Science 8, 217-236.
6. Goodchild, M.F., Noronha, V., 1983. Location-allocation for small computers, Monograph No. 8, Department of Geography, University of Iowa, Iowa City, Iowa.
7. Hakimi, S.L., 1964. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450-459.
8. Hakimi, S.L., 1965. Optimum distribution of switching centers in a communications network and some related graph theoretic problems. Operations Research 13, 462-475.
9. Hillsman, E.L., 1984. The p-median structure as a unified linear model for location-allocation analysis. Environment and Planning A 16, 305-318.
10. Horn, M., 1996. Analysis and computational schemes for p-median heuristics. Environment and Planning A 28, 1699-1708.
11. Maranzana, F.E., 1964. On the location of supply points to minimize transport costs. Operational Research Quarterly 15, 261-270.
12. Narula, S.C., Ogbu, U.I., Samuelsson, H.M., 1977. An algorithm for the p-median problem. Operations Research 25, 709-713.
13. ReVelle, C.S., Swain, R.W., 1970. Central facilities location. Geographical Analysis 2, 30-42.
14. 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.
15. Rosing, K.E., 1997. An empirical investigation of the effectiveness of a vertex substitution heuristic. Environment and Planning B 24, 59-67.
16. Rosing, K.E., 1998. Heuristic concentration: A study of stage one. Tinbergen Institute Discussion Papers. Tinbergen Institute, Amsterdam/Rotterdam.
17. Rosing, K.E., Hodgson, M.J., 1998. A geographical and combinatorial analysis of p-median solutions. Tinbergen Institute Discussion Papers. Tinbergen Institute, Amsterdam/Rotterdam.
18. Rosing, K.E., ReVelle, C.S., 1997. Heuristic concentration: Two stage solution construction. European Journal of Operational Research 97, 75-86.
19. Rosing, K.E., ReVelle, C.S., Rolland, E., Schilling, D.A., Current, J.R., 1998. Heuristic concentration and tabu search: A head to head comparison. European Journal of Operational Research 104, 93-99.
20. Rushton, G., Kohler, J.A., 1973. Alloc. in: Rushton, G., Goodchild, M.F., Ostresh Jr., L.W., Computer programs for location-allocation problems, Monograph No. 6, Department of Geography, University of Iowa, Iowa City, Iowa, pp. 163-187.
21. Serra, D., ReVelle, C.S., 1999. Surviving in a competitive spatial market: The threshold capture model. Journal of Regional Science, in review.
22. Swain, R.W., 1974. A parametric decomposition approach for the solution of uncapacitated location problems. Management Science 21, 189-198.
23. Teitz, M.B., Bart, P., 1968. Heuristic methods for estimating the generalised vertex median of a weighted graph. Operations Research 16, 955-961.
24. Whitaker, R.A., 1983. A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21, 95-108; see also Errata, 1984. INFOR 22, 70-71.