Ditapis dengan
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
Artificial intelligence hybrid heuristic based on tabu search for the dynamic…
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
Karya Umum 
Filsafat 
Agama 
Ilmu-ilmu Sosial 
Bahasa 
Ilmu-ilmu Murni 
Ilmu-ilmu Terapan 
Kesenian, Hiburan, dan Olahraga 
Kesusastraan 
Geografi dan Sejarah