Multiobjective container barge transport problem - Archive ouverte HAL Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 2016

Multiobjective container barge transport problem

Résumé

The need for optimization using different methods of operations research in container terminal operations has become even more important in recent years. The mean of this paper is to study the Traveling Salesman Problem (TSP) combined with the Container Stowage Problem (CSP) that is we consider one barge where the containers are stowed in stacks with a predefined order according to their fragility, weight and stability, such that a number of containers must be removed in order to reach containers below them. In other words, only the upper-most container of each stack of the barge can be directly accessed, thus, shifting containers within the barge becomes necessary if the target container is located below other ones. Our aim is to seek an optimal rotation that takes account of unloading and reloading of the containers placed in the barge. We propose a mathematical model as a binary linear program, and then we adapt the ant colony metaheuristic to solve it.
Fichier non déposé

Dates et versions

hal-04556752 , version 1 (23-04-2024)

Identifiants

Citer

Amina El Yaagoubi, Ahmed El Hilali Alaoui, Jaouad Boukachour. Multiobjective container barge transport problem. 2016 3rd International Conference on Logistics Operations Management (GOL), IEEE, pp.1-6, 2016, 978-1-4673-8572-5. ⟨10.1109/GOL.2016.7731664⟩. ⟨hal-04556752⟩
2 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More