Optimization of container load sequencing by a hybrid of ant colony optimization and tabu search

Authors:
Yong Hwan Lee;Jaeho Kang;Kwang Ryel Ryu;Kap Hwan Kim
Affiliations:
SK Teletech, Seoul, Korea;Department of Computer Engineering, Pusan National University, Busan, Korea;Department of Computer Engineering, Pusan National University, Busan, Korea;Department of Industrial Engineering, Pusan National University, Busan, Korea
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Year:
2005

Citing 4
Cited 0

Routing straddle carriers for the loading operation of containers using a beam search algorithm

Computers and Industrial Engineering
Tabu Search

Tabu Search
An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals

Transportation Science
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many algorithms that solve optimization problems are being developed and used. However, large and complex optimization problems still exist, and it is often difficult to obtain the desired results with one of these algorithms alone. This paper applies tabu search and ant colony optimization method to the container load sequencing problem. We also propose a hybrid algorithm, which can combine the merits of these two algorithms by running them alternately. Experiments have shown that the proposed hybrid algorithm is superior to both tabu search and ant colony optimization individually.