Ditapis dengan
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Pro…
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
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…
- Edisi
- 2014
- ISBN/ISSN
- -
- Deskripsi Fisik
- 18 p.
- Judul Seri
- Applied Soft Computing
- No. Panggil
- ATC LO RUI b
Karya Umum 
Filsafat 
Agama 
Ilmu-ilmu Sosial 
Bahasa 
Ilmu-ilmu Murni 
Ilmu-ilmu Terapan 
Kesenian, Hiburan, dan Olahraga 
Kesusastraan 
Geografi dan Sejarah