Hybrid genetic simulated annealing algorithm (HGSAA) to solve storage container problem in port

  • Authors:

  • Riadh Moussi;Ndèye Fatma Ndiaye;Adnan Yassine

  • Affiliations:

  • Laboratory of Applied Mathematics of Le Havre (LMAH), Le Havre University, Le Havre Cedex, France and Superior Institute of Logistics Studies (ISEL), Le Havre Cedex, France;Laboratory of Applied Mathematics of Le Havre (LMAH), Le Havre University, Le Havre Cedex, France and Superior Institute of Logistics Studies (ISEL), Le Havre Cedex, France;Laboratory of Applied Mathematics of Le Havre (LMAH), Le Havre University, Le Havre Cedex, France and Superior Institute of Logistics Studies (ISEL), Le Havre Cedex, France

  • Venue:
  • ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Container terminals play an important role in marine transportation; they constitute transfer stations to multimodal transport. In this paper, we study the storage of containers. We model the seaport system as a container location model, with an objective function designed to minimize the distance between the vessel berthing locations and the storage zone. Due to the inherent complexity of the problem, we propose a hybrid algorithm based on genetic (GA) and simulated annealing (SA) algorithm. In this paper, three different forms of integration between GA and SA are developed. In order to prove the efficiency of the HGSAAs proposed are compared to the optimal solutions for small-scale problems of an exact method which is Branch and Bound using the commercial software ILOG CPLEX. Computational results on real dimensions taken from the terminal of Normandy, Le Havre port, France, show the good quality of the solutions obtained by the HGSAAs.