A Genetic Algorithm to Solve the Container Storage Space Allocation Problem
In this paper, the authors presented a Genetic Algorithm (GA) to solve the container storage problem in the port. This problem is studied with different container types such as regular, open side, open top, tank, empty and refrigerated containers. The objective of this problem is to determine an optimal containers arrangement, which respects customers' delivery deadlines, reduces the re-handle operations of containers and minimizes the stop time of the container ship. In this paper, an adaptation of the genetic algorithm to the container storage problem is detailed and some experimental results are presented and discussed.