Yard trailer routing at a maritime container terminal
This paper addresses the trailer routing problem at a maritime container terminal, where yard trailers are normally assigned to specific quay cranes until the work is finished. A more efficient trailer assignment method called "dynamic routing" is proposed. A heuristic was developed and a wide variety of computational experiments were conducted. The results of the experiments demonstrated that the dynamic routing reduces travel distance and generates substantial savings in the trailer fleet size and overall cost (15% reduction). The paper's contribution to the literature is the development of a new routing scheme achieving container handling cost savings for a terminal.
Year of publication: |
2005
|
---|---|
Authors: | Nishimura, Etsuko ; Imai, Akio ; Papadimitriou, Stratos |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 41.2005, 1, p. 53-76
|
Publisher: |
Elsevier |
Keywords: | Container transportation Vehicle routing Cargo handling Heuristic Mathematical programming |
Saved in:
Saved in favorites
Similar items by person
-
Berth allocation planning in the public berth system by genetic algorithms
Nishimura, Etsuko, (2001)
-
The economic viability of container mega-ships
Imai, Akio, (2006)
-
Yard trailer routing at a maritime container terminal
Nishimura, Etsuko, (2005)
- More ...