Article

Biased random key genetic algorithm for the Tactical Berth Allocation Problem

---

The Tactical Berth Allocation Problem (TBAP) aims to allocate incoming ships to berthing positions andassign quay crane profiles to them (i.e. number of quay cranes per time step). The goals of the TBAPare both the minimization of the housekeeping costs derived from the transshipment container flowsbetween ships, and the maximization of the total value of the quay crane profiles assigned to the ships. Inorder to obtain good quality solutions with considerably short computational effort, this paper proposesa Biased Random Key Genetic Algorithm for solving this problem. The computational experiments andthe comparison with other solutions approaches presented in the related literature for tackling the TBAPshow that the proposed algorithm is applicable to efficiently solve this difficult and essential containerterminal problem. The problem instances used in this paper are composed of both, those reported in theliterature and a new benchmark suite proposed in this work for taking into consideration other realisticscenarios.

---

Ketersediaan

Informasi Detail

Judul Seri

Applied Soft Computing

No. Panggil

ATC LO RUI b

Penerbit

Spain : Elsevier., 2014

Deskripsi Fisik

18 p.

Bahasa

English

ISBN/ISSN

-

Klasifikasi

LO

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

online resource

Edisi

2014

Subjek

Container Terminal
genetic algorithm
berth allocation
Biased random keys

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Eduardo Lalla-Ruiz

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar