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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A cut-flow procedure for transportation network optimization


    Weitere Titelangaben:

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


    Beteiligte:
    Peterson, B.E. (Autor:in)

    Erschienen in:

    Networks ; 10 , 1 ; 33-43


    Erscheinungsdatum :

    1980


    Format / Umfang :

    11 Seiten, 8 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    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