Article

Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem

---

This paper considers the Dynamic Berth Allocation Problem, in which vessels are assigned to discrete positions in berths. This problem, whose goal is to minimize the total time the vessels stay at the port, constitutes one of the most important processes at any containers terminal. We propose a hybrid metaheuristic that combines Tabu Search with Path Relinking, T2SnþPR. The results reached by this hybrid algorithm are compared with the optimal values given by the best mathematical model that appears in the literature for this problem, GSPP, and with a tabu search algorithm from the literature T2S. For small instances, the algorithm T2SnþPR is able to obtain most of the optimal solutions in an amount of computational time that is lower than the time required to solve the GSPP model. For medium and large size instances, GSPP cannot be solved to optimality, whereas the proposed hybrid algorithm outperforms T2S. Moreover, the computational experiments carried out in this paper confirm the robustness of the proposed algorithm with respect to both the parameters governing the procedure and the problem size.

---

Ketersediaan

Informasi Detail

Judul Seri

Engineering Applications of Artificial Intelligence

No. Panggil

ATC LO MER a

Penerbit

United Kingdom : Elsevier., 2012

Deskripsi Fisik

10 p.

Bahasa

English

ISBN/ISSN

-

Klasifikasi

LO

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

online resource

Edisi

-

Subjek

Port Logistics
Artificial intelligence
berth allocation
Tabu search
Path relinking

Info Detail Spesifik

-

Pernyataan Tanggungjawab

J. Marcos Moreno-Vega

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar