Title :

Harmony search to solve the container storage problem with different container types

Author(s) :

Ayachi, Imen [Auteur]
Laboratoire d'Automatique, Génie Informatique et Signal [LAGIS]
Ecole Nationale d'Ingénieurs de Tunis [ENIT]
Kammarti, Ryan [Auteur]
Ecole Nationale d'Ingénieurs de Tunis [ENIT]
Borne, Pierre [Auteur]
LAGIS-OSL
Ksouri, Mekki [Auteur]
Ecole Nationale d'Ingénieurs de Tunis [ENIT]

Journal title :

International Journal of Computer Applications

Pages :

26-32

Publisher :

Foundation of Computer Science

Publication date :

2012

ISSN :

0975-8887

English keyword(s) :

Harmony Search Genetic Algorithm Transport Scheduling Metaheuristic Optimization Container Storage

HAL domain(s) :

Informatique [cs]/Recherche opérationnelle [cs.RO]

English abstract : [en]

This paper presents an adaptation of the harmony search algorithm to solve the storage allocation problem for inbound and outbound containers. This problem is studied considering multiple container type (regular, open side, ...
Show more >This paper presents an adaptation of the harmony search algorithm to solve the storage allocation problem for inbound and outbound containers. This problem is studied considering multiple container type (regular, open side, open top, tank, empty and refrigerated) which lets the situation more complicated, as various storage constraints appeared. The objective is to find an optimal container arrangement which respects their departure dates, and minimize the re-handle operations of containers. The performance of the proposed approach is verified comparing to the results generated by genetic algorithm and LIFO algorithm.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL