Dynamic-demand capacitated facility location problems with and without relocation

International Journal of Production Research

Volumn 49, Issue 13, 2011, Pages 3979-4005

  Torres Soto, Joaquin E ^a   Üster, Halit ^a  

^a Texas AandM University   (United States)

Author keywords

facility location; logistics; optimisation

Indexed keywords

BENDERS DECOMPOSITION ALGORITHM; CAPACITATED FACILITY LOCATION PROBLEMS; CAPACITATED LOCATION; COST STRUCTURE; CUSTOMER DEMANDS; FACILITY LOCATIONS; FIXED COST; LAGRANGIAN RELAXATION; MULTI-PERIOD; OPTIMISATION; PLANNING HORIZONS; SOLUTION ALGORITHMS; TIME-PERIODS;

ALGORITHMS; COST ACCOUNTING; COST BENEFIT ANALYSIS; DATA STRUCTURES; OPTIMIZATION;

RELOCATION;

EID: 79957533670     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.505588     Document Type: Article

References (35)

1. Balakrishnan, J., 2004. An improved algorithm for solving a multi-period facility location problem. IIE Transactions, 36 (1), 19-22.
2. Benders, J.F., 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4 (1), 238-252.
3. Blackhurst, J., Wu, T., and O'Grady, P., 2004. Network-based approach to modelling uncertainty in a supply chain. International Journal of Production Research, 42 (8), 1639-1658.
4. Canel, C. and Khumawala, B.M., 1996. A mixed-integer programming approach for the international facilities location problem. International Journal of Operations & Production Management, 16 (4), 49-68.
5. Canel, C. and Khumawala, B.M., 1997. Multi-period international facilities location: An algorithm and application. International Journal of Production Research, 35 (7), 1891-1910. (Pubitemid 127549702)
6. Canel, C. and Khumawala, B.M., 2001. International facilities location: A heuristic procedure for the dynamic uncapacitated problem. International Journal of Production Research, 39 (17), 3975-4000. (Pubitemid 35165495)
7. Chardaire, P., Sutter, A., and Costa, M.C., 1996. Solving the dynamic facility location problem. Networks, 28 (2), 117-124.
8. Cornuejols, G., Sridharan, R., and Thizy, J.M., 1991. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research, 50 (3), 280-297.
9. Dias, J., Captivo, M.E., and Clímaco, J., 2006. Capacitated dynamic location problems with opening, closure and reopening of facilities. IMA Journal of Management Mathematics, 17 (4), 317-348. (Pubitemid 44574109)
10. Dias, J., Captivo, M.E., and Clímaco, J., 2007. Efficient primal-dual heuristic for a dynamic location problem. Computers and Operations Research, 34 (6), 1800-1823. (Pubitemid 44556977)
11. Drezner, Z., 1995. Dynamic facility location: The progressive p-median problem. Location Science, 3 (1), 1-7. (Pubitemid 26432190)
12. Efroymson, M.A. and Ray, T.L., 1966. A branch-bound algorithm for plant location. Operations Research, 14 (3), 361-368.
13. Erlenkotter, D., 1978. A dual-based procedure for uncapacitated facility location. Operations Research, 26 (6), 992-1009. (Pubitemid 9412214)
14. Erlenkotter, D., 1981. A comparative study of approaches to dynamic location problems. European Journal of Operational Research, 6, 133-143. (Pubitemid 11466212)
15. Fisher, M.L., 1981. The Lagrangian relaxation method for solving integer programming problems. Management Science, 27 (1), 1-18.
16. Geoffrion, A.M. and Graves, G.W., 1974. Multicommodity distribution system design by Benders decomposition. Management Science, 20 (5), 822-844.
17. Guignard-Spielberg, M. and Spielberg, K., 1977. A dual method for the mixed plant location problem. Department of Statistics, University of Pennsylvania, The Wharton School.
18. Hakimi, S.L., Labbe, M., and Schmeichel, E.F., 1999. Locations on time-varying networks. Networks, 34 (4), 250-257. (Pubitemid 129318849)
19. Hormozi, A.M. and Khumawala, B.M., 1996. An improved algorithm for solving a multi-period facility location problem. IIE Transactions, 28 (2), 105-114. (Pubitemid 126759971)
20. Kelly, D.L. and Marucheck, A.J., 1984. Planning horizon results for the dynamic warehouse location problem. Journal of Operations Management, 4, 279-294.
21. Khumawala, B.M., 1972. An efficient branch-bound algorithm for the warehouse location problem. Management Science, 18 (12), 718-732.
22. Magnanti, T.L. and Wong, R.T., 1981. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research, 29 (3), 464-484. (Pubitemid 12437576)
23. Manne, A.S., 1967. Investments for capacity expansion: Size, location and time phasing. Cambridge, MA: MIT Press.
24. Manzini, R. and Gebennini, E., 2008. Optimization models for the dynamic facility location and allocation problem. International Journal of Production Research, 46 (8), 2061-2086. (Pubitemid 351272730)
25. Roodman, G.M. and Schwarz, L.B., 1975. Optimal and heuristic facility phase-out strategies. AIIE Transactions, 7 (2), 177-184.
26. Roodman, G.M. and Schwarz, L.B., 1977. Extensions of the multi-period facility phase-out model: New procedures and applications to a phase-in/phase-out problem. AIIE Transactions, 9 (1), 103-107.
27. Shulman, A., 1991. An algorithm for solving capacitated plant location problems with discrete expansion sizes. Operations Research, 39 (3), 423-436.
28. Silva, F.J.F. and de la Figuera, D.S., 2007. A capacitated facility location problem with constrained backlogging probabilities. International Journal of Production Research, 45 (21), 5117-5134. (Pubitemid 47507501)
29. Sweeney, D.J. and Tatham, R.L., 1976. An improved long-run model for multiple warehouse location. Management Science, 22 (7), 748-758.
30. Van Roy, T.J., 1986. A cross decomposition algorithm for capacitated facility location. Operations Research, 34 (1), 145-163.
31. Van Roy, T.J. and Erlenkotter, D., 1982. A dual based procedure for dynamic facility location. Management Science, 28, 1091-1105.
32. Wadhwa, S., Saxena, A., and Chan, F.T.S., 2008. Framework for flexibility in dynamic supply chain management. International Journal of Production Research, 46 (6), 1373-1404. (Pubitemid 350157674)
33. Wentges, P., 1996. Accelerating Benders decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research, 44 (2), 267-290. (Pubitemid 126578766)
34. Wesolowsky, G.O., 1973. Dynamic facility location. Management Science, 19 (11), 1241-1248.
35. Wesolowsky, G.O. and Truscott, W.G., 1975. The multiperiod location-allocation problem with relocation of facilities. Management Science, 22 (1), 57-65.