کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
525204 | 868899 | 2010 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A lamda-optimal based heuristic for the berth scheduling problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Berth scheduling aims to optimally schedule vessels to berthing areas along a quay and is a complex optimization problem. In this paper we propose a lamda-optimal based heuristic as a resolution approach for the discrete space berth scheduling problem. The proposed heuristic can also be applied to validate optimality, in the case where other (meta)heuristics are applied as resolution approaches. A second internal Genetic Algorithms based heuristic is also proposed to reduce the computational time required for medium to large scale instances. Numerical experiments performed show that the proposed heuristic is adequate to produce near-optimal results within acceptable computational times.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part C: Emerging Technologies - Volume 18, Issue 5, October 2010, Pages 794–806
Journal: Transportation Research Part C: Emerging Technologies - Volume 18, Issue 5, October 2010, Pages 794–806
نویسندگان
Mihalis M. Golias, Maria Boile, Sotirios Theofanis,