Article

Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem

---

The competitiveness of a container terminal is highly conditioned by the time that container vessels spend on it. The proper scheduling of the quay cranes can reduce this time and allows a container terminal to be more attractive to shipping companies. The goal of the Quay Crane Scheduling Problem (QCSP) is to minimize the handling time of the available quay cranes when performing the tasks of loading and unloading containers onto/from a container vessel. This paper proposes a hybrid Estimation of Distribution Algorithm with local search to solve the QCSP. This approach includes a priori knowledge about the problem in the initialization step to reach promising regions of the search space as well as a novel restarting strategy with the aim of avoiding the premature convergence of the search. Furthermore, an approximate evaluation scheme is applied in order to reduce the computational burden. Moreover, its performance is statistically compared with the best optimization method from the literature. Numerical testing results demonstrate the high robustness and efficiency of the developed technique. Additionally, some relevant components of the scheme are individually analyzed to check their effectiveness.

---

Ketersediaan

Informasi Detail

Judul Seri

Applied Soft Computing

No. Panggil

ATC LO IZQ h

Penerbit

Spain : Elsevier., 2013

Deskripsi Fisik

14 p.

Bahasa

English

ISBN/ISSN

4063–4076

Klasifikasi

LO

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

online resource

Edisi

2013

Subjek

Container Terminal
Heuristics
Quay Crane Scheduling Problem
Estimation of Distribution Algorithm
Local search

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Christopher Expósito-Izquierdo

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar