arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.5613cs.DS
收藏

一种求解车间调度问题的禁忌搜索/路径重链接算法

A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem

Bo Peng, Zhipeng Lu, T. C. E. Cheng

摘要:

我们提出了一个算法,将禁忌搜索过程的路径重连的框架,以解决车间作业调度问题(JSP)。这种禁忌搜索/路径重连(TS/PR)算法包括几个显着的特点,如一个特定的重连过程和参考解决方案的确定方法。为了测试TS/PR的性能,我们应用它来处理文献中几乎所有的基准JSP实例。测试结果表明,TS/PR获得竞争力的结果相比,国家的最先进的JSP算法在文献中,证明其有效性的解决方案的质量和计算效率。特别是,TS/PR能够提高205个测试实例中49个的上限,并解决了一个20多年来一直未解决的具有挑战性的实例。

英文摘要:

We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure and a reference solution determination method. To test the performance of TS/PR, we apply it to tackle almost all of the benchmark JSP instances available in the literature. The test results show that TS/PR obtains competitive results compared with state-of-the-art algorithms for JSP in the literature, demonstrating its efficacy in terms of both solution quality and computational efficiency. In particular, TS/PR is able to improve the upper bounds for 49 out of the 205 tested instances and it solves a challenging instance that has remained unsolved for over 20 years.

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

↑