Abstract
In many transportation systems, the shipment quantities are subject to minimum lot sizes in addition to regular capacity constraints. This means that either the quantity must be zero, or it must be between the two bounds. In this work, we prove that the maximum flow problem with minimum lot-size constraints on the arcs is strongly NP-hard, and we enhance the performance of a previously suggested heuristic. Profiling the serial implementation shows that most of the execution time is spent on solving a series of regular max flow problems. Therefore, we develop a parallel augmenting path algorithm that accelerates the heuristic by an average factor of 1.25.
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
Anderson, R.J., Setubal, J.C.: On the parallel implementation of Goldberg’s maximum flow algorithm. In: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, SPAA’92, pp. 168-177, ACM (1992)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM. 35, 921–940 (1988)
Goldfarb, D., Grigoriadis, M.D.: A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow. Annals of Operations Research. 78, 83–123 (1988)
Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press (1995)
Haugland, D., Eleyat, M., Hetland, M.L.: The maximum flow problem with minimum lot sizes. In: Proceedings of the Second international conference on Computational logistics, ICCL’11, pp. 170-182. Springer-Verlag (2011)
Hong, B., He, Z.: An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic. IEEE Trans. Parallel Distrib. Syst. 22, 1025–1033 (2011)
Jungnickel, D.: Graphs, Networks and Algorithms. Springer (2008)
Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15, 434–437 (1975)
Parmar, P.: Integer Programming Approaches for Equal-Split Network Flow Problems. PhD thesis, Georgia Institute of Technology (2007)
Shiloach, Y., Vishkin, U.: An O(n2 logn) parallel max-flow algorithm. Journal of Algorithms. 3, 128–146 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eleyat, M., Haugland, D., Hetland, M.L., Natvig, L. (2012). Parallel algorithms for the maximum flow problem with minimum lot sizes. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)