Container vessel stowage plan using genetic, hill-climbing and simulated annealing algorithms

Abstract

Container vessel stowage is vital for reducing extra cost and the vessel’s turn-around time in ports. Several studies have been conducted to be able to solve this problem. However, this problem has not been dealt with completely due to container stowage problem is complex problem which is literally considered as a NP-hard problem. Hence, the principal objective of this study is to find optimal container stowage plan for container vessel calling at multiple ports. Algorithms are the most widely-used methods for finding optimal solution in container vessel stowage problem. In this study, Genetic, Hill-Climbing and Simulated Annealing algorithm are implemented considering same size and two different types of containers (refrigerated and standard containers). After finding the numerical test results from these three algorithms, the effectiveness of the algorithms for the problem are evaluated

    Similar works