Premium
A cut‐flow procedure for transportation network optimization
Author(s) -
Peterson Bruce E.
Publication year - 1980
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230100104
Subject(s) - flow network , multi commodity flow problem , minimum cost flow problem , mathematical optimization , flow (mathematics) , minimum cut , set (abstract data type) , maximum flow problem , optimization problem , computer science , mathematics , algorithm , geometry , programming language
Many transportation network optimization problems use conservation of flow equations as constraints when a network must accommodate set flows between nodes. A different set of equations, called cut‐flow constraints, is developed to replace the conservation of flow equations. These constraints require that the flow over every separating cut be at least equal to total traffic requirements between nodes separated by the cut. In many network problems the cut‐flow constraints may prove more efficient than existing multicommodity formulations. The cut‐flow constraints are applied to the optimization problem of minimizing the sum of fixed and variable costs in a network.