Budget constrained location problem with opening and closing of facilities

Computers and Operations Research

Volumn 30, Issue 13, 2003, Pages 2047-2069

  Wang, Qian ^a   Batta, Rajan ^a   Bhadury, Joyendu ^b   Rump, Christopher M ^a  

^a the State University of New York   (United States)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Facility location; Greedy algorithm; Lagrangian relaxation; Tabu search

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING;

LOCATION PROBLEMS;

PROBLEM SOLVING;

BANKING; FACILITY LOCATION; LOCATION DECISION;

UNITED STATES;

EID: 0042311381     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00123-5     Document Type: Article

References (30)

1. Hakimi SL. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 1964;12:450-9.
2. Levy J. An extended theorem for location on a network. Operational Research Quarterly 1967;18:433-42.
3. Handler GY, Mirchandani P. Location on networks, theory and algorithms. Cambridge, MA: MIT Press, 1979.
4. Kariv O, Hakimi SL. An algorithmic approach to network location problems, part 2: the p-medians. SIAM Journal of Applied Mathematics 1979;37:539-60.
5. Cornuejols G, Fisher ML, Nemhauser GL. Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms. Management Science 1977;23:789-810.
6. Maranzana FE. On the location of supply points to minimize transport costs. Operational Research Quarterly 1964;15:261-71.
7. Teitz BC, Bart P. Heuristic method for estimating the generalized vertex median of a weighted graph. Operations Research 1968;16:955-61.
8. Jarvinen P, Fajala J, Sinervo H. A branch-and-bound algorithm for seeking the p-median. Operations Research 1972;20:173-82.
9. Captivo ME. Fast primal and dual heuristic for the p-median location problem. European Journal of Operational Research 1991;52:65-74.
10. Maniezzo V, Mingozzi A, Baldacci R. Binomic approach to the capacitated p-median problem. Journal of Heuristics 1998;4:263-80.
11. Rosing KE, ReVelle CS, Schilling DA. Gamma heuristic for the p-median problem. European Journal of Operational Research 1999;117:552-632.
12. Cornuejols G, Nemhauser GL, Wolsey LA. The uncapacitated facility location problem. In: Mirchandani PB, Francis RL, editors. Discrete location theory. New York: Wiley, 1990. p. 119-71.
13. Kuehn AA, Hamburger MJ. A heuristic program for locating warehouse. Management Science 1963;9:643-66.
14. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research 1978;26:992-1009.
15. Tcha DW, Ro HB, Yoo CB. A dual-based add heuristic for uncapacitated facility location. Journal of the Operational Research Society 1988;39:873-8.
16. Balinski ML. Integer programming: methods, uses, computation. Management Science 1965;12:253-313.
17. Denshan P, Rushton G. Strategies for solving large location-allocation problem by heuristics. Environment and Planning 1992;A 24:289-304.
18. Jones P, Lowe TJ, Muller G, Xu N. Specially structured uncapacitated facility location problems. Operations Research 1995;43:661-9.
19. Berman O, Simchi-Levi D. Conditional location problems on networks. Transportation Science 1990;24:77-8.
20. Drezner Z. On the conditional p-median problem. Computers and Operations Research 1995;22:84-91.
21. Chhajed D, Lowe TJ. An O(nm) algorithm for a special case of the multi-median location problem on a tree. European Journal of Operational Research 1992;63:222-30.
22. Leorch AG, Boland N, Johnson EL, Nemhauser GL. Finding an optimal stationing policy for the US army in Europe after the force drawdown. Military Operations Research 1996;2:39-51.
23. Dell R. Optimizing army base realignment and closure. Interfaces 1998;28:1-18.
24. Associated Press. Wells funds ATM access study. The Daily Review, Stanford, 1998.
25. Min H, Melachrinoudis E. The relocation of a hybrid manufacturing/distribution facility from supply chain perspectives: a case study, Omega. The International Journal of Management Science 1999;27:75-85.
26. Melachrinoudis E, Min H. The dynamic relocation and phase-out of a hybrid, twoechelon plant/warehousing facility: a multiple objective approach. European Journal of Operational Research 2000;33:1-15.
27. Wang Q. Discrete facility location design with stochastic customer demand and immobile servers. Unpublished Ph.D. Dissertation, Department of Industrial Engineering, University at Buffalo (SUNY), 2000.
28. Glover F, Laguna M. Tabu search. In: Reeves CR, editor. Modern heuristic techniques for combinatorial problems. New York: Wiley, 1993. p. 70-150.
29. Narula SC, Ogbu VI, Samuelsson HM. An algorithm for the p-median problem. Operations Research 1977;25: 709-12.
30. Beasley JE. Lagrangian Relaxation. In: Reeves CR, editor. Modern heuristic techniques for combinatorial problems. New York: Wiley, 1993. p. 243-303.