zbMATH — the first resource for mathematics

Dynamic supply chain design with inventory. (English) Zbl 1141.90021
Summary: We deal with a facility location problem where we build new facilities or close down already existing facilities at two different distribution levels over a given time horizon. In addition, we allow to carry over stock in warehouses between consecutive periods. Our model intends to minimize the total costs, including transportation and inventory holding costs for products as well as fixed and operating costs for facilities.
After formulating the problem, we propose a Lagrangian approach which relaxes the constraints connecting the distribution levels. A procedure is developed to solve the resulting, independent subproblems and, based on this solution, to construct a feasible solution for the original problem.

90B50 Management decision making, including multiple objectives
90B05 Inventory, storage, reservoirs
90C10 Integer programming
90C46 Optimality conditions and duality in mathematical programming
Full Text: DOI
[1] Kalcsics J, Melo T, Nickel S, Schmid-Lutz V. Facility location decisions in supply chain management. Operations Research Proceedings 1999; 467-472. · Zbl 1052.90581
[2] Bender, T.; Hennes, H.; Kalcsics, J.; Melo, T.; Nickel, S., Location software and interface with GIS and supply chain management, (), 233-274 · Zbl 1027.90052
[3] Bramel J, Simchi-Levi D. The logic of logistics. Theory, algorithms, and applications for logistics management. Springer series in operations research. New York: Springer; 1997. · Zbl 0931.90002
[4] Aikens, C.H., Facility location models for distribution planning, European journal of operational research, 22, 263-279, (1985) · Zbl 0583.90022
[5] Crainic, T.G.; Delorme, L., Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements, Transportation science, 27, 2, 90-101, (1993) · Zbl 0788.90043
[6] Crainic, T.G.; Delorme, L.; Dejax, P., A branch and bound method for multicommodity location with balancing requirements, European journal of operational research, 65, 368-382, (1993) · Zbl 0779.90053
[7] Chardaire, P.; Sutter, A.; Costa, M.C., Solving the dynamic facility location problem, Networks, 28, 117-124, (1996) · Zbl 0864.90073
[8] Marín A. Análisis y resolución de problemas de localización discreta en dos etapas mediante técnicas basadas en la descomposición lagrangiana, PhD thesis, Departamento de Matemática Aplicada y Estadística, Universidad de Murcia, 1996.
[9] Pirkul, H.; Jayaraman, V., Production transportation and distribution planning in a multi-commodity tri-echelon system, Transportation science, 30, 4, 291-302, (1996) · Zbl 0879.90129
[10] Drezner Z, editor, Facility location. Berlin: Springer; 1995. · Zbl 0914.90181
[11] Hu, T.C., Integer programming and network flows, (1970), Addison-Wesley Reading, MA · Zbl 0197.45701
[12] 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
[13] Holmberg, K.; Jornsten, K., Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction, Location science, 4, 83-100, (1996) · Zbl 0927.90068
[14] Melo, M.T.; Nickel, S.; Saldanha da Gama, F., Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning, Computers and operations research, 33, 181-208, (2006) · Zbl 1077.90006
[15] Hinojosa, Y.; Puerto, J.; Fernández, F.R., A multi-period two-echelon multi-commodity capacitated plant location problem, European journal of operational research, 123, 271-291, (2000) · Zbl 0967.90069
[16] Barceló, J.; Fernández, E.; Jornsten, K., Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem, European journal of operational research, 53, 38-45, (1991) · Zbl 0734.90044
[17] Beasley, J.E., Lagrangian heuristics for location problems, Ejor, 65, 383-399, (1993) · Zbl 0768.90045
[18] Daskin M. Network and discrete location. Models, algorithms and applications, Wiley-Interscience series in discrete mathematics and optimization. New York, NY: Wiley, 1995.
[19] Erlenkotter, D., A dual-based procedure for uncapacitated facility location, Operational research, 26, 6, 992-1009, (1978) · Zbl 0422.90053
[20] Fisher, M.L., The Lagrangian relaxation method for solving integer programming problems, Management science, 27, 1, 1-18, (1981) · Zbl 0466.90054
[21] Guignard, M.; Opaswongkarn, K., Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems, Ejor, 46, 73-83, (1990) · Zbl 0719.90051
[22] Held, M.; Wolfe, P.; Crowder, H., Validation of subgradient optimization, Mathematical programming, 6, 62-88, (1974) · Zbl 0284.90057
[23] Benders, J.F., Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, 4, 238-252, (1962) · Zbl 0109.38302
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.