arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.0967cs.AIcs.DM
收藏

一种多启发式方法求解预编组问题

A Multi-Heuristic Approach for Solving the Pre-Marshalling Problem

Institute of Physics, University of Belgrade(贝尔格莱德大学物理研究所);Qatar Environment and Energy Research Institute(卡塔尔环境与能源研究所);Faculty of Computer Science, Megatrend University(Megatrend大学计算机科学学院);Institute of Information Systems, University of Hamburg(汉堡大学信息系统研究所)

Raka Jovanovic, Milan Tuba, Stefan Voss

摘要:

摘要在海运集装箱码头,如何最大限度地减少重新编组作业的次数,是一个重要的问题。基于现有的解决方案的方法分析,我们开发新的物流利用PMP的问题实例的特定属性。我们发现,启发式的性能是高度依赖于这些属性。我们介绍了一种新的方法,利用贪婪的启发式的四个阶段,在这些阶段中的每一个可以应用几个不同的启发式。我们没有使用随机化来提高启发式算法的性能,而是通过对每个阶段使用不同启发式算法的组合来重复生成许多解决方案。在这样做时,只有少数的解决方案,我们打算,他们没有不良的属性,相反的情况下,使用简单的随机化。我们的实验表明,这样的确定性算法显着优于原来的非确定性的方法时,发现的解决方案的质量进行观察,生成的解决方案的数量少得多。

英文摘要:

Minimizing the number of reshuffling operations at maritime container terminals incorporates the Pre-Marshalling Problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new method that exploits a greedy heuristic of four stages, where for each of these stages several different heuristics may be applied. Instead of using randomization to improve the performance of the heuristic, we repetitively generate a number of solutions by using a combination of different heuristics for each stage. In doing so, only a small number of solutions is generated for which we intend that they do not have undesirable properties, contrary to the case when simple randomization is used. Our experiments show that such a deterministic algorithm significantly outperforms the original nondeterministic method when the quality of found solutions is observed, with a much lower number of generated solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑