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.
Rail freight traffic assignment
Transportation Research Part A: General ; 15 , 2 ; 183-190
1980-04-21
8 pages
Article (Journal)
Electronic Resource
English
Freight Traffic Assignment Methodology for Large-Scale Road–Rail Intermodal Networks
Transportation Research Record | 2015
|Rail without frontiers : (freight traffic)
SLUB | 1991
|New rail freight traffic for 2015
IuD Bahn | 2008
|Catering for rail freight Growth: The growth in freight traffic
British Library Online Contents | 1999
|Assignment of Freight Shipment Demand in Congested Rail Networks
Transportation Research Record | 2014
|