In this report a multi-modal freight transport improvement problem is formulated, and a heuristic solution procedure is developed for large scale problems. Arcs on a multi-modal network are modified to minimize the sum of investment and shipper disutility. The model includes a mode abstract multinomial logit model and convex arc transport characteristic improvement functions. The procedure is based on the general Continuous Optimal Adjustment heuristic suggested by Steenbrink; a major component is a concave transportation assignment problem, for which two methods are developed: a Dantzig-Wolfe decomposition to solve an arc-path form of the general multi-commodity fixed charge network flow problem, and a heuristic based on the local optimum seeking procedure of Yaged. The latter was programmed and thirty test runs were made on a problem derived from the Multi-State Transportation Corridor research program. Conclusions reached are: the solution procedure is viable; although times are long, this is not unusual for problems of this size or design construction projects of this scale; solution times may be shortened considerably by proper selection of parameters. As a final step, the procedure is extended to include multiple transport commodity classes.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Single-Commodity and Multi-Commodity Network Improvement Procedures


    Contributors:
    M. A. Mullens (author) / G. P. Sharp (author)

    Publication date :

    1979


    Size :

    294 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Multi-commodity network flows

    Hu, Te Chiang | TIBKAT | 1963




    Multicommodity vs. Single-Commodity Routing

    Archetti, Claudia / Campbell, Ann Melissa / Speranza, M. Grazia | British Library Online Contents | 2016


    COMMODITY MANAGEMENT SYSTEM AND COMMODITY MANAGEMENT APPARATUS

    MATSUI YOSHIYUKI | European Patent Office | 2022

    Free access