A cooperative search for berth scheduling

Eduardo Lalla-Ruiz, Belen Melian-Batista, Jose Marcos Moreno-Vega

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
43 Downloads (Pure)

Abstract

With the growing demand of freight transport by means of container vessels as well as the important competition among terminals, managers and stakeholders seek to improve the exploitation of the container terminal resources efficiently. In this context, arises the Berth Allocation Problem, which aims to allocate and schedule incoming vessels along the quay. Its appropriate solution plays a relevant role in enhancing the terminal productivity. Thus, for addressing this problem, we propose a cooperative search, where the individuals are organized into groups and each member shares information with its group partners. This grouping strategy allows to diversify as well as intensify the search in some regions by means of information shared among the individuals of each group. The computational experiments for this problem reveal that our approach reports high-quality solutions and identifies promising regions within the search space in short computational times.
Original languageEnglish
Pages (from-to)498-507
Number of pages10
JournalKnowledge engineering review
Volume31
Issue number5
DOIs
Publication statusPublished - Nov 2016
Externally publishedYes

Keywords

  • 2023 OA procedure

Fingerprint

Dive into the research topics of 'A cooperative search for berth scheduling'. Together they form a unique fingerprint.

Cite this