Journal
OR SPECTRUM
Volume 30, Issue 4, Pages 721-750Publisher
SPRINGER
DOI: 10.1007/s00291-007-0112-5
Keywords
intermodal container terminal; train planning; metaheuristics
Categories
Ask authors/readers for more resources
This paper considers one important aspect of operations planning referred to hereafter as train planning. Train planning is the process of spatially assigning containers to specific wagons (also known as railcars) on an intermodal train. The spatial arrangement of containers on a train can have a significant influence over the amount of time and energy consumed in the handling of containers. Efficient train planning can also maximise utilisation of wagon carrying capacity. This study proposes a mixed-integer programming model to determine the arrangement of containers on a train to minimise a weighted sum of number of wagons required and equipment working time. Due to the large number of variables, the proposed model cannot be solved in a timely manner for practical problems. This is addressed by applying heuristic algorithms local search and simulated annealing. Discrete-event simulation of an intermodal terminal is used to evaluate the proposed methods and to illuminate various properties of the model.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available