Application of Harmony search to container Storage Location

This paper presents an adaptation of harmony search algorithm to solve unbound container storage location. Our aim is to reduce the time of unloading all the containers when they are delivered to their customers. In fact, we minimize the wait time of customer trucks and the transfer time of yard cra...

Full description

Saved in:
Bibliographic Details
Published in2011 IEEE International Conference on Systems, Man, and Cybernetics pp. 1556 - 1561
Main Authors Ayachi, I., Kammarti, R., Ksouri, M., Borne, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2011
Subjects
Container storage allocation
container terminal
Containers
Cranes
Genetic algorithms
Harmony search
Mathematical model
Optimization
Resource management
Search problems
Online AccessGet full text

Cover

More Information
Summary:This paper presents an adaptation of harmony search algorithm to solve unbound container storage location. Our aim is to reduce the time of unloading all the containers when they are delivered to their customers. In fact, we minimize the wait time of customer trucks and the transfer time of yard crane. This problem is studied considering multiple container type (dry, tank and refrigerated). The performance of the proposed approach is verified comparing to the results generated by current practice at ports.
ISBN:9781457706523
1457706520
ISSN:1062-922X
2577-1655
DOI:10.1109/ICSMC.2011.6083892