Abstract
In many transportation systems, the shipment quantities are subject to minimum lot sizes in addition to regular capacity constraints. That is, either the quantity must be zero, or it must be between the two bounds. In this work, we consider a directed graph, where a minimum lot size and a flow capacity are defined for each arc, and study the problem of maximizing the flow from a given source to a given terminal. We prove that the problem is NP-hard. Based on a straightforward mixed integer programming formulation, we develop a Lagrangean relaxation technique, and demonstrate how this can provide strong bounds on the maximum flow. For fast computation of near-optimal solutions, we develop a heuristic that departs from the zero solution and gradually augments the set of flow-carrying (open) arcs. The set of open arcs does not necessarily constitute a feasible solution. We point out how feasibility can be checked quickly by solving regular maximum flow problems in an extended network, and how the solutions to these subproblems can be productive in augmenting the set of open arcs. Finally, we present results from preliminary computational experiments with the construction heuristic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bahl, H., Ritzman, L., Gupta, J.: Determining lot sizes and resource requirements: A review. Operations Research 35(3), 329–345 (1988)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
Goldfarb, D., Grigoriadis, M.: A computational comparison of the dinic and network simplex methods for maximum flow. Annals of Operations Research 78, 83–123 (1988)
Hirsch, W., Dantzig, G.: The fixed charge problem. Naval Research Logistics Quarterly 15, 413–424 (1968)
Jans, R., Degraeve, Z.: Modeling industrial lot sizing problems: a review. International Journal of Production Research 46(6), 1619–1643 (1968)
Jungnickel, D.: Graphs, Networks and Algorithms. Springer, Heidelberg (2008)
Karimi, B., Ghomi, S.F., Wilson, J.: The capacitated lot sizing problem: a review of models and algorithms. Omega 31, 365–378 (2003)
Nahapetyan, A., Pardalos, P.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Computational Optimization and Applications 39, 37–50 (2008)
Tardos, E.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5, 247–255 (1985)
Voß, S., Woodruff, D.: Connecting mrp, MRP II and ERP supply chain production planning via optimization models. In: Greenberg, H. (ed.) Tutorials on Emerging Methodologies and Applications in Operations Research, p. 8.1–8.30. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haugland, D., Eleyat, M., Hetland, M.L. (2011). The Maximum Flow Problem with Minimum Lot Sizes. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2011. Lecture Notes in Computer Science, vol 6971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24264-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-24264-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24263-2
Online ISBN: 978-3-642-24264-9
eBook Packages: Computer ScienceComputer Science (R0)