×

zbMATH — the first resource for mathematics

Facility location models for distribution planning. (English) Zbl 0583.90022
Strategic planners are interested in the design and location of physical facilities (factories and warehouses) so that the costs associated with production, storage, and transportation are minimized while, at the same time, minimum levels of customer service are achieved. Models range from simple single-commodity source-to-destination only shipments versions to complex multi-commodity multi-echelon transshipment problems with many side constraints. This paper reviews some of the algorithms which, through the use of heuristics and optimization techniques, have contributed significantly to the current state-of-knowledge for dealing with many of these models.

MSC:
90B05 Inventory, storage, reservoirs
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
90C10 Integer programming
90C90 Applications of mathematical programming
90C05 Linear programming
90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Akine, U.; Khumawala, B.M., An efficient branch and bound algorithm for the capacitated warehouse location problem, Management science, 23, 585-594, (1977) · Zbl 0348.90157
[2] Balachandran, V.; Jain, S., Optimal facility location under random demand with general cost structure, Naval research logistics quarterly, 23, 421-436, (1976) · Zbl 0342.90024
[3] Balinski, M.L., On finding integer solutions to linear programs, Mathematica, (1964), Princeton, NJ
[4] Benders, J.F., Partioning procedures for solving mixed-variables programming problems, Numerische Mathematik, 4, 238-252, (1962) · Zbl 0109.38302
[5] Bilde, O.; Krarup, J., Sharp lower bounds for the simple location problem, Annals of discrete mathematics, 1, 79-97, (1977)
[6] Bowersox, D.J.; Helferich, O.K.; Marien, E.J.; Gilmore, P.; Lawrence, M.L.; Morgan, F.W.; Rogers, R.T., Dynamic simulation of physical distribution system, (1972), Division of Research, Michigan State University Business Studies East Lansing, MI
[7] Cabot, A.V.; Ergenguc, S.S., Some branch-and-bound procedures for fixed-cost transportation problems, Naval research logistics quarterly, 31, 145-154, (1984) · Zbl 0537.90074
[8] Chen, S.; Saigal, R., A primal algorithm for solving a capacitated network flow problem with additional linear constraints, Networks, 7, 59-79, (1977) · Zbl 0363.90107
[9] Conners, M.M.; Coray, C.; Cuccaro, C.J.; Green, W.K.; Low, D.W.; Markowitz, H.M., The distribution system simulator, Management science, 18, B425-B453, (1972)
[10] Dearing, P.M.; Newruck, F.C., A capacitated bottleneck facility location problem, Management science, 11, 1093-1104, (1979) · Zbl 0466.90022
[11] Efroymson, M.A.; Ray, T.L., A branch and bound algorithm for plant location, Operations research, 14, 361-368, (1966)
[12] Elson, D.G., Site location via mixed-integer programming, Operational research quarterly, 23, 31-43, (1972) · Zbl 0231.90027
[13] Erlenkotter, D., A dual-based procedure for uncapacitated facility location, Operations research, 26, 992-1009, (1978) · Zbl 0422.90053
[14] Firth, D.; Denham, F.R.; Griffin, K.R.; Heffernan, J.; Press, S.H.; Robson, N.C.; Saipe, A.I., ()
[15] Garfinkel, R.S.; Rao, M.R., The bottleneck transportation problem, Naval research logistics quarterly, 18, 465-472, (1971) · Zbl 0262.90040
[16] Geoffrion, A.M., Better distribution planning with computer models, Harvard business review, (1976), (July-August)
[17] Geoffrion, A.M.; Graves, G.W., Multicommodity distribution system design by benders decomposition, Management science, 20, 822-844, (1974) · Zbl 0304.90122
[18] Geoffrion, A.M.; Graves, G.W.; Lee, S., Strategic distribution system planning: A status report, (), Chapter 7
[19] Geoffrion, A.M.; Graves, G.W.; Lee, S., A portable management support system for distribution planning, (1979), Graduate School of Management, UCLA, unpublished paper
[20] Geoffrion, A.M.; McBride, R., Lagrangean relaxation applied to the capacitated facility location problem, AIIE transactions, 10, 40-47, (1978)
[21] Jacobsen, S.K.; Madsen, O.B.G., A comparative study of heuristics for a two-level routing-location problem, European journal of operational research, 5, 378-387, (1980) · Zbl 0441.90028
[22] Karkazis, J.; Boffey, T.B., The multi-commodity facilities location problem, Journal of the operational research society, 32, 803-814, (1981) · Zbl 0461.90025
[23] Kaufman, L.; Eede, M.V.; Hansen, P., A plant and warehouse location problem, Operational research quarterly, 28, 547-554, (1977) · Zbl 0375.90074
[24] Khumawala, B.M., An efficient branch and bound algorithm for the warehouse location problem, Management science, 18, B718-B731, (1972) · Zbl 0238.90048
[25] Khumawala, B.M.; Neebe, A.W., A note on Warszawski’s multicommodity location problem, Journal of the operational research society, 6, 171-172, (1978) · Zbl 0381.90091
[26] Khumawala, B.W.; Whybark, D.C., Solving the dynamic warehouse location problem, International journal of physical distribution, 6, 238-251, (1976)
[27] Kochman, G.A.; McCallum, C.J., Facility location models for planning a trans atlantic communications network, European journal of operational research, 6, 205-211, (1981) · Zbl 0451.90045
[28] Kuehn, A.A.; Hamburger, M.J., A heuristic program for location warehouses, Management science, 9, 643-666, (1963)
[29] Le Blanc, L.J., A heuristic approach for large scale discrete stochastic transportation-location problems, Computers and mathematics with applications, 3, 87-94, (1977) · Zbl 0364.90048
[30] Markland, R.E.; Newett, R.J., Production distribution planning in a large scale commodity processing network, Decision sciences, 7, 579-594, (1976)
[31] Mercer, A.; Candey, M.F.; Rand, G.K., Operational distribution research: innovative case studies, (1978), Taylor and Francis London · Zbl 0438.90026
[32] Nambing, J.M.; Gelders, L.F.; Wassenhove, L.N., A large scale location-allocation problem in the natural rubber industry, European journal of operational research, 6, 180-189, (1981) · Zbl 0451.90044
[33] National Council of Distribution Management, (), report prepared under contract by
[34] Nauss, R.M., An improved algorithm for the capacitated facility location problem, Journal of the operational research society, 29, 1195-1201, (1978) · Zbl 0402.90063
[35] Neebe, A.W.; Khumawala, B.M., An improved algorithm for the multi-commodity location problem, Journal of the operational research society, 32, 143-169, (1981) · Zbl 0447.90021
[36] Productivity Promotion Council of Australia, Physical distribution management, (1974), Australian Department of Productivity, a management assistance cost reduction pamphlet prepared in association with the
[37] Roodman, G.M.; Schwartz, L.B., Optimal and heuristic facility phase-out strategies, AIIE transactions, 7, 177-184, (1975)
[38] Shycon, H.H.; Maffei, R.B., Simulation—tool for better distribution, (), 243-260
[39] Spielberg, K., Algorithms for the simple plant-location problem with some side constraints, Operations research, 17, 85-111, (1969) · Zbl 0165.54104
[40] Tcha, D.; Lee, B., A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, European journal of operational research, 18, 35-43, (1984) · Zbl 0542.90034
[41] Tomlin, J.A., An improved branch and bound method for integer programming, Operations research, 19, 1070-1075, (1971) · Zbl 0219.90034
[42] Van Roy, T.J.; Gelders, L.F., Solving a distribution problem with side constraints, European journal of operational research, 6, 61-66, (1981) · Zbl 0449.90028
[43] Van Roy, T.J.; Erlenkotter, D., Dual-based procedure for dynamic facility location, Management science, 28, 1091-1105, (1982) · Zbl 0495.90033
[44] Warszawski, A., Multi-dimensional location problems, Operational research quarterly, 24, 165-179, (1973) · Zbl 0256.90054
[45] Wesolowski, G.O.; Truscott, W.G., The multi-period location-allocation problem with relocation of facilities, Management science, 22, 57-65, (1975) · Zbl 0309.90066
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.