A Genetic algorithm to solve the container storage space allocation problem
Abstract
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
Keywords
Cite
@article{arxiv.1303.1051,
title = {A Genetic algorithm to solve the container storage space allocation problem},
author = {I. Ayachi and R. Kammarti and M. Ksouri and P. Borne and : and LAGIS and Ecole Centrale de Lille and : and LACS and Ecole Nationale des Ingenieurs de Tunis},
journal= {arXiv preprint arXiv:1303.1051},
year = {2013}
}
Comments
2010 International conference on Computational Intelligence and Vehicular System (CIVS)