The container shipping network design problem with empty container repositioning
This paper addresses the design of container liner shipping service networks by explicitly taking into account empty container repositioning. Two key and interrelated issues, those of deploying ships and containers are usually treated separately by most existing studies on shipping network design. In this paper, both issues are considered simultaneously. The problem is formulated as a two-stage problem. A genetic algorithm-based heuristic is developed for the problem. Through a number of numerical experiments that were conducted it was shown that the problem with the consideration of empty container repositioning provides a more insightful solution than the one without.
Year of publication: |
2007
|
---|---|
Authors: | Shintani, Koichi ; Imai, Akio ; Nishimura, Etsuko ; Papadimitriou, Stratos |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 43.2007, 1, p. 39-59
|
Publisher: |
Elsevier |
Keywords: | Container transportation Routing Empty container Heuristic Genetic algorithm |
Saved in:
Saved in favorites
Similar items by person
-
The container shipping network design problem with empty container repositioning
Shintani, Koichi, (2007)
-
Shintani, Koichi, (2020)
-
Multi-port vs. Hub-and-Spoke port calls by containerships
Imai, Akio, (2009)
- More ...