Text

The Multiport Berth Allocation Problem with Speed Optimization : Exact Methods and a Cooperative Game Analysis

We consider a variant of the berth allocation problem—that is, the multiport berth allocation problem—aimed at assigning berthing times and positions to vessels in container terminals. This variant involves optimizing vessel travel speeds between multiple ports, thereby exploiting the potentials of a collaboration between carriers (shipping lines) and terminal operators. Using a graph representation of the problem, we reformulate an existing mixed-integer problem into a generalized set partitioning problem, in which each variable refers to a sequence of feasible berths in the ports that the vessel visits. By integrating column generation and cut separation in a branch-and-cut-and-price procedure, our proposed method is able to outperform commercial solvers in a set of benchmark instances and adapt better to larger instances. In addition, we apply cooperative game theory methods to efficiently distribute the savings resulting from a potential collaboration and show that both carriers and terminal operators would benefit from collaborating.

Ketersediaan

Informasi Detail

Judul Seri

TRANSPORTATION SCIENCE; Vol.56 No.4 July-August 2022

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 972-999

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

TRANSPORTATION
EXACT METHODS
COOPERATIVE GAME THEORY
SPEED OPTIMIZATION
CONTAINER TERMINAL
BERTH ALLOCATION PROBLEM

Info Detail Spesifik

https://doi.org/10.1287/trsc.2021.1112

Pernyataan Tanggungjawab

Bernardo Martin-Iradi, Dario Pacino, Stefan Ropke

Versi lain/terkait

Lampiran Berkas

Komentar