کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10522864 | 955864 | 2005 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Berth allocation in a container port: using a continuous location space approach
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
علوم انسانی و اجتماعی
علوم تصمیم گیری
علوم مدیریت و مطالعات اجرایی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Berth allocation in a container port: using a continuous location space approach Berth allocation in a container port: using a continuous location space approach](/preview/png/10522864.png)
چکیده انگلیسی
This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part B: Methodological - Volume 39, Issue 3, March 2005, Pages 199-221
Journal: Transportation Research Part B: Methodological - Volume 39, Issue 3, March 2005, Pages 199-221
نویسندگان
Akio Imai, Xin Sun, Etsuko Nishimura, Stratos Papadimitriou,