Abstract
Container ship stowage plan is a vital subject on reducing additional cost from shifting and the vessel’s turn-around time in maritime ports. However, making proper stowage plan is not straightforward since this subject is literally known as a NP-hard problem. Several studies have been conducted to solve this problem despite it has not been dealt with completely. Hence, the principal objective of this study is to find optimal container stowage plan for container vessel calling at multiple ports. The most common way of finding the optimal solution is to consult algorithms for container vessel stowage problem. In this study, Steepest Ascent Hill Climbing, Genetic and Simulated Annealing algorithms are implemented considering the same size and two different types of containers (refrigerated and standard containers). After obtaining the numerical test results from three algorithms implementation, their performances for the problem solution are compared and evaluated.
Original language | English |
---|---|
Title of host publication | Marine Design XIII |
Subtitle of host publication | Proceedings of the 13th International Marine Design Conference (IMDC 2018), June 10-14, 2018, Helsinki, Finland |
Editors | Pentti Kujala, Liangliang Lu |
Place of Publication | Boca Raton, Florida |
Pages | 617-623 |
Number of pages | 7 |
Publication status | Published - 11 Jun 2018 |
Event | 13th INTERNATIONAL MARINE DESIGN CONFERENCE - Espoo/Helsinki, Helsinki, Finland Duration: 10 Jun 2018 → 14 Jun 2018 Conference number: 13 http://imdc2018.aalto.fi/ |
Conference
Conference | 13th INTERNATIONAL MARINE DESIGN CONFERENCE |
---|---|
Abbreviated title | IMDC2018 |
Country/Territory | Finland |
City | Helsinki |
Period | 10/06/18 → 14/06/18 |
Internet address |
Keywords
- stowage plan
- container vessel
- multiple ports