A Comprehensive Modeling of the Discrete and Dynamic Problem of Berth Allocation in Maritime Terminals

In this study, the discrete and dynamic problem of berth allocation in maritime terminals, is investigated. The suggested resolution method relies on a paradigm of optimization with two techniques: heuristic and multi-agent. Indeed, a set of techniques such as the protocol of negotiation named contr...

Full description

Saved in:
Bibliographic Details
Published inElectronics (Basel) Vol. 10; no. 21; p. 2684
Main Authors Mnasri, Sami, Alrashidi, Malek
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.11.2021
Subjects
Cranes & hoists
Decision making
Genetic algorithms
Heuristic
Integer programming
Linear programming
Marine terminals
Multiagent systems
Optimization
Ships
Tabu search
Online AccessGet full text

Cover

More Information
Summary:In this study, the discrete and dynamic problem of berth allocation in maritime terminals, is investigated. The suggested resolution method relies on a paradigm of optimization with two techniques: heuristic and multi-agent. Indeed, a set of techniques such as the protocol of negotiation named contract net, the multi-agent interactions, and Worst-Fit arrangement technique, are involved. The main objective of the study is to propose a solution for attributing m parallel machines to a set of activities. The contribution of the study is to provide a detailed modeling of the discrete and dynamic berth allocation problem by establishing the corresponding models using a multi-agent methodology. A set of numerical experiments are detailed to prove the performance of the introduced multi-agent strategy compared with genetic algorithm and tabu search.
ISSN:2079-9292
2079-9292
DOI:10.3390/electronics10212684