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.
Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem
Transportation Research Part B: Methodological ; 20 , 3 ; 225-242
1985-01-31
18 pages
Article (Journal)
Electronic Resource
English
The congested multicommodity network design problem
Online Contents | 2016
|THE MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM
British Library Conference Proceedings | 2002
|Routing Model for Multicommodity Freight in an Intermodal Network Under Disruptions
Transportation Research Record | 2016
|