一种求解岸桥调度问题的分解方法
A Decomposition Approach to Solve The Quay Crane Scheduling Problem
摘要：
在这项工作中，我们提出了一个分解的方法来解决码头起重机调度问题。这是集装箱码头所面临的一个重要的海上运输问题，在集装箱码头中，码头起重机用于处理货物。目标是确定每个起重机的装卸作业顺序，以最大限度地缩短完工时间。我们解决了一个混合整数规划制定的码头起重机调度问题，分解成车辆路径问题和相应的调度问题。在不考虑起重机干扰的情况下，通过最小化最长起重机完工时间来解决路由子问题。该解决方案为整个问题的最大完工时间提供了一个下界，并将其发送到调度子问题，在调度子问题中确定每个任务的完成时间和最大完工时间。该方案类似于Benders的分解，特别是组合Benders切割的方案。我们评估所提出的方法通过解决文献中的实例，并与其他可用的方法的结果进行比较。
英文摘要：
In this work we propose a decomposition approach to solve the quay crane scheduling problem. This is an important maritime transportation problem faced in container terminals where quay cranes are used to handle cargo. The objective is to determine a sequence of loading and unloading operations for each crane in order to minimize the completion time. We solve a mixed integer programming formulation for the quay crane scheduling problem, decomposing it into a vehicle routing problem and a corresponding scheduling problem. The routing sub-problem is solved by minimizing the longest crane completion time without taking crane interference into account. This solution provides a lower bound for the makespan of the whole problem and is sent to the scheduling sub-problem, where a completion time for each task and the makespan are determined. This scheme resembles Benders' decomposition and, in particular, the scheme underlying combinatorial Benders' cuts. We evaluate the proposed approach by solving instances from the literature and comparing the results with other available methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
