کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1135381 | 956097 | 2009 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports](/preview/png/1135381.png)
چکیده انگلیسی
This paper presents a novel, mixed-integer programming (MIP) model for the quay crane (QC) scheduling and assignment problem, namely QCSAP, in a container port (terminal). Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper, thus, proposes a genetic algorithm (GA) to solve the above-mentioned QCSAP for the real-world situations. Further, the efficiency of the proposed GA is compared against the LINGO software package in terms of computational times for small-sized problems. Our computational results suggest that the proposed GA is able to solve the QCSAP, especially for large sizes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 56, Issue 1, February 2009, Pages 241–248
Journal: Computers & Industrial Engineering - Volume 56, Issue 1, February 2009, Pages 241–248
نویسندگان
R. Tavakkoli-Moghaddam, A. Makui, S. Salahi, M. Bazzazi, F. Taheri,