Optimal rail container shipment planning problem in multimodal transportation

The optimal rail container shipment planning problem in multimodal transportation is studied in this article. The characteristics of the multi-period planning problem is presented and the problem is formulated as a large-scale 0-1 integer programming model, which maximizes the total profit generated...

Full description

Saved in:
Bibliographic Details
Published inEngineering optimization Vol. 44; no. 9; pp. 1057 - 1071
Main Authors Cao, Chengxuan, Gao, Ziyou, Li, Keping
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 01.09.2012
Taylor & Francis Ltd
Subjects
0-1 integer program
Approximation
Containers
Heuristic
heuristic algorithm
Heuristic methods
Integer programming
Intermodal transportation
Mathematical models
multimodal transportation
Optimization
Optimization algorithms
rail container shipment plan
Rails
Shipments
Transportation
Transportation problem (Operations research)
Online AccessGet full text
ISSN0305-215X
1029-0273
DOI10.1080/0305215X.2011.632006

Cover

More Information
Summary:The optimal rail container shipment planning problem in multimodal transportation is studied in this article. The characteristics of the multi-period planning problem is presented and the problem is formulated as a large-scale 0-1 integer programming model, which maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited capacities. Two heuristic algorithms are proposed to obtain an approximate optimal solution of the problem. Finally, numerical experiments are conducted to demonstrate the proposed formulation and heuristic algorithms.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2011.632006