Highlights Propose a berth assignment and allocation problem (BAAP) considering cooperative liner carriers. A two-stage optimization method is proposed to address the BAAP. A genetic algorithm framework embedded with a mixed-integer linear programming solver is designed to solve the BAAP with given liner clusters.
Abstract This paper investigates a novel extension of the berth allocation problem (BAP), which mainly determines berths and times for arriving vessels. Most previous studies on the BAP do not consider a cooperative environment among liner carriers. This paper proposes a berth assignment and allocation problem considering cooperative liner carriers (BAAP), which integrates the BAP with the berth assignment problem and the liner clustering problem (LCP). The LCP addresses how to group a number of liner carriers into various liner clusters, and the berth assignment problem aims to assign proper number of berths for serving vessels of various liner clusters. For solving our proposed problem, we develop a two-stage optimization method. In stage I, a mixed-integer nonlinear programming (MINLP) model is constructed to formulate our BAAP with given liner clusters, integrating the BAP with the berth assignment problem. According to the results obtained in stage I, a decision model based on cooperative game theory is presented to solve the LCP in stage II. A genetic algorithm framework embedded with a mixed-integer linear programming solver (CPLEX) is designed to solve the MINLP model constructed in stage I. The LCP in stage II can be solved by using the enumeration method. Experimental results are provided to validate the efficiency and effectiveness of our models and algorithm.
The berth assignment and allocation problem considering cooperative liner carriers
2022-06-05
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
British Library Online Contents | 2018
|The stochastic discrete berth allocation problem
Online Contents | 2019
|Berth allocation considering fuel consumption and vessel emissions
Online Contents | 2011
|