Skip to content
Journal article

A cooperative search for berth scheduling

Lalla-Ruiz E, Melián-Batista B, Moreno-Vega J ...see all

The Knowledge Engineering Review (2017) pp. 1-10

  • 3

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.
  • N/A

    Views

    ScienceDirect users who have downloaded this article.
Sign in to save reference

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • Eduardo Lalla-Ruiz

  • Belén Melián-Batista

  • José Marcos Moreno-Vega

Cite this document

Choose a citation style from the tabs below