Parallel algorithms for the maximum flow problem with minimum lot sizes
- 2.3k Downloads
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.
KeywordsParallel Algorithm Start Node Main Thread Network Flow Problem Serial Implementation
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 2.Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)Google Scholar
- 4.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)Google Scholar
- 5.Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press (1995)Google Scholar
- 6.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)Google Scholar
- 8.Jungnickel, D.: Graphs, Networks and Algorithms. Springer (2008)Google Scholar
- 9.Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15, 434–437 (1975)Google Scholar
- 10.Parmar, P.: Integer Programming Approaches for Equal-Split Network Flow Problems. PhD thesis, Georgia Institute of Technology (2007)Google Scholar