|
考虑集卡到港时间延迟的堆场起重机动态调度研究 |
Research on dynamic scheduling for yard crane with truck arrival time delayed |
投稿时间:2022-03-22 修订日期:2022-04-29 |
DOI: |
中文关键词: 堆场起重机调度 集卡到港延迟 动态调度 迭代重优化 贪婪策略 |
英文关键词: Crane scheduling truck arrival time delayed dynamic scheduling iterative re-optimization greedy strategy |
基金项目:国家自然科学基金面上项目(71871136) |
|
摘要点击次数: 69 |
全文下载次数: 0 |
中文摘要: |
起重机调度优化是堆场作业的重要环节,集卡延迟到港增加了作业计划制订的难度。提出迭代重优化框架,将调度期划分为多个时段,为延迟到港的任务临机分配作业计划,提升调度的灵活性。以作业完成时间最短为目标,构建起重机调度混合整数规划优化模型,并提出下界推导模型。在迭代重优化框架内,设计遗传算法与贪婪插入算法,分别求解初始作业计划和延迟到港的任务。通过实例验证模型、下界推导模型和算法的有效性,并从不同调度时段长度和延迟到港的箱量两个方面对调度结果的影响进行分析。实验结果显示:缩短调度时段长度有利于快速生成起重机作业计划;延迟到港箱量占比越大,作业时间越长,且随着调度时段长度的减小,这一影响逐渐弱化。 |
英文摘要: |
Crane scheduling optimization is an important part of yard operations. Howover, The difficulty of generating the scheme increased due to truck arrival time delayed. An iterative re-optimization framework is proposed, which divides the scheduling cycle into several periods, and allocates operation plans for tasks that arrive late at the port to improve the flexibility of scheduling. A mixed integer programming model is established to sequence the handling tasks under the minimization of the makespan. Moreover, a lower bound derivation model is proposed. Genetic algorithms and greedy insertion algorithms are proposed in the framework. The perposed algorithms solve the initial scheme and re-optimize the delayed arrival tasks, respectively. The validity of the verification model, lower bound derivation model and algorithms is verified by instances. The influence of different dispatching period lengths and delayed arrivals to the port on the scheduling results is analyzed. The experimental show that shortening the length of the scheduling period is conducive to the rapid generation of the crane scheme. Furthermore, the larger the proportion of delayed arrival containers, the bigger of the makespan. And this effect becomes weakened by the reduction in the length of the scheduling period. |
View Fulltext
查看/发表评论 下载PDF阅读器 |
关闭 |
|
|
|