Abstract We examine the freight transportation problem which occurs when the same authority controls and plans both the supply of transportation services (modes, routes, frequencies for the services and classification, consolidation, transfer policies for terminals) and the routing of freight. We present a general modeling framework, based on a network optimization model, which may be used to assist and enhance the tactical and strategic planning process for such a system. The problem is solved by means of an algorithm, described in some detail, based on decomposition and column generation principles. We also present detailed results on the behaviour and performance of the algorithm, as observed during experimentation with a specific rail application.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem


    Contributors:

    Published in:

    Publication date :

    1985-01-31


    Size :

    18 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    The congested multicommodity network design problem

    Dimitris C Paraskevopoulos | Online Contents | 2016


    The multicommodity maximal covering network design problem

    Viswanath, K. / Peeta, S. | IEEE | 2002


    THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM

    Viswanath, K. / Peeta, S. / IEEE | British Library Conference Proceedings | 2002



    Routing Model for Multicommodity Freight in an Intermodal Network Under Disruptions

    Uddin, M. Majbah / Huynh, Nathan | Transportation Research Record | 2016