A hybrid ant colony and simulated annealing algorithm to solve the container stacking problem at seaport terminal

A hybrid ant colony and simulated annealing algorithm to solve the container stacking problem at seaport terminal

0.00 Avg rating0 Votes
Article ID: iaor201529213
Volume: 24
Issue: 4
Start Page Number: 399
End Page Number: 422
Publication Date: Oct 2015
Journal: International Journal of Operational Research
Authors: , , ,
Keywords: heuristics: ant systems, optimization: simulated annealing
Abstract:

In this paper, we study the container stacking problem (CSP) which is one of the most important problems in marine terminal. An optimisation model is developed in order to determine the optimal storage strategy for various container‐handling schedules. The objective of the model is to minimise the distance between vessel berthing location and the storage positions of containers. The CSP is solved by an efficient hybrid ant colony and simulated annealing (HAC/SA). The performance of the algorithm proposed is verified by a comparison with ILOG CPLEX for small‐sized instances. In addition, numerical results for real‐sized instances proved the efficiency of the algorithm.

Reviews

Required fields are marked *. Your email address will not be published.