2013/03/05 by I. Ayachi, R. Kammarti, Ayachi, I. +14
Computer Science · Engineering · #FOS: Computer and information sciences #Maritime Ports and Logistics #Neural and Evolutionary Computing (cs.NE) #Optimization and Packing Problems #Vehicle Routing Optimization Methods #cs.NE
paper · pdf · doi:10.48550/arxiv.1303.1051
2010 International conference on Computational Intelligence and Vehicular System (CIVS)
arxiv created 2013/03/05 · openalex publication_date 2013/03/05 · arxiv updated 2013/03/06 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
This paper 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 rehandle 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. The proposed approach was compared to a Last In First Out (LIFO) algorithm applied to the same problem and has recorded good results