×

zbMATH — the first resource for mathematics

An algorithm for the capacitated, multi-commodity multi-period facility location problem. (English) Zbl 1080.90535

MSC:
90B80 Discrete location and assignment
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Geoffrion, A.M.; Graves, G.W., Multicommodity distribution system design by Bender’s decomposition, Management science, 20, 822-844, (1974) · Zbl 0304.90122
[2] Ballou, R.H., Dynamic warehouse location analysis, Journal of marketing research, 5, 271-276, (1968)
[3] Erlenkotter, D., A comparative study of approaches to dynamic location problems, European journal of operational research, 6, 133-143, (1981) · Zbl 0451.90038
[4] Aikens, C.H., Facility planning models for distribution planning, European journal of operational research, 22, 263-279, (1985) · Zbl 0583.90022
[5] Krarup, J.; Pruzan, P.M., The simple plant location problem: survey and synthesis, European journal of operational research, 12, 36-81, (1983) · Zbl 0506.90018
[6] Francis, R.L.; McGinnis, L.F.; White, J.A., Locational analysis, European journal of operational research, 12, 220-252, (1983) · Zbl 0502.90019
[7] Brandeau, M.; Chiu, S., An overview of representative problems in location research, Management science, 35, 6, 645-674, (1989) · Zbl 0669.90040
[8] Wesolowsky, G.O., Dynamic facility location, Management science, 19, 1241-1248, (1973)
[9] Wesolowsky, G.O.; Truscott, W.G., The multi-period location-allocation problem with relocation of facilities, Management science, 22, 57-65, (1975) · Zbl 0309.90066
[10] Warzawski, A., Multi-dimensional location problems, Operational research quarterly, 24, 165-179, (1973)
[11] Sweeney, D.J.; Tatham, R.L., An improved long run model for multiple warehouse location, Management science, 22, 7, 748-758, (1976) · Zbl 0327.90029
[12] Hormozi, A.M.; Khumawala, B.M., An improved model for multi-period facility location problems, IIE transactions, 28, 2, 105-115, (1996)
[13] Van Roy, T.J.; Erlenkotter, D., A dual-based procedure for dynamic facility location, Management science, 28, 1091-1095, (1982) · Zbl 0495.90033
[14] Shulman, A., An algorithm for solving capacitated plant location problems with discrete expansion sizes, Operations research, 39, 3, 423-436, (1991) · Zbl 0742.90049
[15] Kelly, D.L.; Marucheck, A.J., Planning horizon results for the dynamic warehouse location problem, Journal of operations management, 4, 279-294, (1984)
[16] Khumawala, B.M., An efficient branch and bound algorithm for the warehouse location problem, Management science, 18, 12, 718-731, (1972)
[17] Khumawala, B.M., An efficient heuristic procedure for the uncapacitated warehouse location problem, Naval research logistics quarterly, 20, 1, 109-121, (1973)
[18] Effroymson, M.A.; Ray, T.L., A branch and bound algorithm for plant location, Operations research, 14, 361-368, (1966)
[19] Khumawala, B.M., An efficient heuristic procedure for the capacitated warehouse location problem, Naval research logistics quarterly, 21, 609-623, (1974) · Zbl 0295.90030
[20] Nauss, R.M., An improved algorithm for capacitated facility location problem, Journal of operational research society, 29, 1195-1201, (1978) · Zbl 0402.90063
[21] Neebe, A.W.; Khumawala, B.M., An improved algorithm for the multi-commodity location problem, Journal of operational research, 32, 143-149, (1981) · Zbl 0447.90021
[22] Roodman, G.M.; Schwarz, L.B., Optimal and heuristic facility phase-out strategies, AIIE transactions, 7, 177-184, (1975)
[23] Barnhart, C.; Sheffi, Y., A network-based primal-dual heuristic for the solution of multicommodity network flow problems, Transportation science, 27, 2, 102-117, (1993) · Zbl 0791.93010
[24] Crainic, T.G., Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements, Transportation science, 27, 2, 90-101, (1993) · Zbl 0788.90043
[25] Aggarwal, A.K.; Oblak, M.; Vemuganti, R.R., A heuristic solution procedure for multicommodity integer flows, Computers and operations research, 22, 10, 1075-1088, (1995) · Zbl 0841.90062
[26] Lee, C.Y., An optimal algorithm for the multiproduct, capacitated facility location problem with a choice of facility type, Computers and operations research, 18, 2, 167-182, (1991) · Zbl 0734.90047
[27] Lee, C.Y., The multi-product warehouse location problem: applying a decomposition algorithm, International journal of physical distribution and logistics management, 23, 6, 3-13, (1993)
[28] Lee, C.Y., A cross decomposition algorithm for a multi-product, multi-type facility location problem, Computers and operations research, 20, 5, 527-540, (1993) · Zbl 0774.90054
[29] Pirkul, H.; Jayaraman, V., A multi-commodity. multi-plant, capacitated facility location problem: formulation and efficient heuristic solution, Computers and operations research, 25, 10, 869-878, (1998) · Zbl 1042.90580
[30] Akinc, U.; Khumawala, B.M., An efficient branch and bound algorithm for capacitated warehouse location problem, Management science, 23, 585-594, (1977) · Zbl 0348.90157
[31] Geoffrion, A.M.; McBride, R., Lagrangean relaxation applied to capacitated facility location problem, AIIE transactions, 10, 40-45, (1978)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.