Network Flow Optimization with Minimum Quantities

  • Seedig H
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Economies of scale often appear as decreasing marginal costs, but may also occur as a constraint that at least a minimum quantity should be produced or nothing at all. Taking the latter into account can support decisions about keeping a production site, setting up a new one, establishing new routes in logistics network, and many more. In our work, we define the corresponding problem Minimum Cost Network Flow with Minimum Quantities and prove its computational hardness. Following that, we devise a tailored Branch-&-Bound algorithm with an efficient update step that usually affects only small parts of the network. Experiments are conducted on real problems and artificial networks. In our results, the update step made the inevitable but well-studied subproblem of the initial computation of a minimum cost network flow problem taking most of the actual total running time. As our method does also compare favorably with a heuristic algorithm that has been implemented before, we recommend it for practical use.

Cite

CITATION STYLE

APA

Seedig, H. G. (2011). Network Flow Optimization with Minimum Quantities (pp. 295–300). https://doi.org/10.1007/978-3-642-20009-0_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free