Ditapis dengan

  • Tahun Penerbitan
  • Ketersediaan
  • Lampiran
  • Tipe Koleksi
    Lihat Lebih Banyak
  • Format Fisik Dokumen
    Lihat Lebih Banyak
  • Lokasi
  • Bahasa
Ditemukan 4 dari pencarian Anda melalui kata kunci: author=Belén Melián-Batista
cover
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Pro…
Komentar Bagikan
Christopher Expósito-IzquierdoBelén Melián-BatistaJ. Marcos Moreno-VegaJosé Luis González-Velarde

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 …

Edisi
2013
ISBN/ISSN
4063–4076
Deskripsi Fisik
14 p.
Judul Seri
Applied Soft Computing
No. Panggil
ATC LO IZQ h
cover
Biased random key genetic algorithm for the Tactical Berth Allocation Problem
Komentar Bagikan
Belén Melián-BatistaEduardo Lalla-RuizJosé Luis González-Velarde

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…

Edisi
2014
ISBN/ISSN
-
Deskripsi Fisik
18 p.
Judul Seri
Applied Soft Computing
No. Panggil
ATC LO RUI b
cover
A domain-specific knowledge-based heuristic for the blocks relocation problem
Komentar Bagikan
Christopher Expósito-IzquierdoBelén Melián-Batista

The Blocks Relocation Problem consists in minimizing the number of movements performed by a gantry crane in order to retrieve a subset of containers placed into a bay of a container yard according to a predefined order. A study on the mathematical formulations proposed in the related literature reveals that they are not suitable for its solution due to their high computational burden. Moreover,…

Edisi
-
ISBN/ISSN
-
Deskripsi Fisik
17 p.
Judul Seri
Advanced Engineering Informatics
No. Panggil
ATC LO MEL a
cover
Artificial intelligence hybrid heuristic based on tabu search for the dynamic…
Komentar Bagikan
Belén Melián-BatistaEduardo Lalla-RuizJ. Marcos Moreno-Vega

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 …

Edisi
-
ISBN/ISSN
-
Deskripsi Fisik
10 p.
Judul Seri
Engineering Applications of Artificial Intelligence
No. Panggil
ATC LO MER a