Abstract This paper describes an algorithm for routing freight over a rail network whose tracks are controlled by several carriers in a manner that follows current industrial practices. In particular, the freight is routed to minimize the number of interline transfers and to maximize the revenue division for the originating carrier. The algorithm is based upon generalizing a shortest path algorithm to allow vector valued link impedances.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Rail freight traffic assignment


    Contributors:

    Published in:

    Publication date :

    1980-04-21


    Size :

    8 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Freight Traffic Assignment Methodology for Large-Scale Road–Rail Intermodal Networks

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


    Rail without frontiers : (freight traffic)

    International Union of Railways | SLUB | 1991


    New rail freight traffic for 2015

    Siegmann, Jürgen / Stuhr, Helge | IuD Bahn | 2008


    Catering for rail freight Growth: The growth in freight traffic

    Gisby, R. | British Library Online Contents | 1999


    Assignment of Freight Shipment Demand in Congested Rail Networks

    Hwang, Taesung / Ouyang, Yanfeng | Transportation Research Record | 2014