کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1023844 | 941649 | 2010 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
علوم انسانی و اجتماعی
مدیریت، کسب و کار و حسابداری
کسب و کار و مدیریت بین المللی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution](/preview/png/1023844.png)
چکیده انگلیسی
In this research, continuous and dynamic Berth Allocation Problem (BAP) is studied to minimize the total weighted flow time. Different from previous studies on continuous BAP, an efficient method is proposed to address the problem to identify the possible locations for next vessel in the Time-space diagram. Then two versions of Greedy Randomized Adaptive Search Procedure (GRASP) are developed to search for near optimal solutions. Both small and large scale numerical experiments are tested to examine the effectiveness of the proposed GRASPs by comparison with CPLEX and stochastic beam search, respectively.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 46, Issue 6, November 2010, Pages 1017–1029
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 46, Issue 6, November 2010, Pages 1017–1029
نویسندگان
Der-Horng Lee, Jiang Hang Chen, Jin Xin Cao,