货物装配规划问题的模型探讨
Exploration of models for a cargo assembly planning problem
摘要:
我们考虑一个现实世界中的煤炭供应链中出现的货物装配规划问题。这些货物是由火车运送的煤炭在港口码头的堆场上建造的。然后货物被装上船只。只有有限数量的抵达船只是事先知道的。目标是在较长的规划期内最大限度地减少船舶的平均延误时间。我们模型的问题在MiniZinc约束编程语言,并设计了一个大的邻域搜索方案。各种可选的约束的影响进行了研究。一些可选的约束将模型的范围扩展到系统视图(泊位容量,港口通道)。一个贪婪的启发式从文献中提出的自适应计划,并比较约束规划方法。
英文摘要:
We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in the MiniZinc constraint programming language and design a large neighbourhood search scheme. The effects of various optional constraints are investigated. Some of the optional constraints expand the model's scope toward a system view (berth capacity, port channel). An adaptive scheme for a greedy heuristic from the literature is proposed and compared to the constraint programming approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。