کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
384886 660855 2012 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Clustering Search for the Berth Allocation Problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Clustering Search for the Berth Allocation Problem
چکیده انگلیسی

This work presents a new approach to the Berth Allocation Problem (BAP) for ships in ports. Due to the increasing demand for ships carrying containers, the BAP can be considered as a major optimization problem in marine terminals. In this paper, the BAP is considered as dynamic and modeled in discrete case and we propose a new alternative to solve it. The proposed alternative is based on applying the Clustering Search (CS) method using the Simulated Annealing (SA) for solutions generation. The CS is an iterative method which divides the search space in clusters and it is composed of a metaheuristic for solutions generation, a grouping process and a local search heuristic. The computational results are compared against recent methods found in the literature.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 39, Issue 5, April 2012, Pages 5499–5505
نویسندگان
, , ,