کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6892517 1445449 2018 39 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
ترجمه فارسی عنوان
روش های دقیق برای مشکل زمان بندی جرثقیل اسکله زمانی که وظایف در یک سطح کانتینر مدل سازی می شوند
کلمات کلیدی
برنامه ریزی، پایانه های کانتینر، مشکل زمان بندی جرثقیل، برنامه ریزی عدد صحیح مختلط،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی
The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to solve the quay crane scheduling problem (QCSP) where a task is defined as handling a single container and subject to different technical constraints including QCs' safety margin, non-crossing, initial position, and nonzero traveling time. The first method is based on two versions of a compact mixed-integer programming formulation that can solve large problem instances using a general purpose solver. The second is a combination of some constraints of the proposed mathematical model and the binary search algorithm to reduce the CPU time, and solve more efficiently large-sized problems. Unlike existing studies, the computational study demonstrates that both methods can reach optimal solutions for large-sized instances and validates their dominance compared to an exact model proposed in the literature which finds solutions only for small problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 99, November 2018, Pages 218-233
نویسندگان
, , , , ,