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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A cut-flow procedure for transportation network optimization


    Additional title:

    Ein Schnitt-Fluss-Verfahren zur Optimierung von Transport-Netzwerken


    Contributors:

    Published in:

    Networks ; 10 , 1 ; 33-43


    Publication date :

    1980


    Size :

    11 Seiten, 8 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Integrated Transportation Network Design Optimization

    Taylor, Christine / de Weck, Olivier | AIAA | 2006


    Coupled Vehicle Design and Network Flow Optimization for Air Transportation Systems

    Taylor, C. / de Weck, O. | British Library Conference Proceedings | 2007