Abstract
The purpose of this paper is to implement the optimization of container stowage plan problem for a container vessel for multiple ports using heuristic algorithm. The containers in the ship visit many different ports on their way to the ultimate destination. This work presents an implementation for the Stowage Planning Problem which raises in the ship industry when the planning for container vessel needs to be done. We have used the Greedy Approach to solve the problem. The approach is able to find a good solution for placement of container stowage. The problem's aim is to increase the total number of containers transported while lowering the penalty cost of re-handling operations.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
