A Comparison of Meta-heuristics Algorithms for Resource-Constrained Project Scheduling

• Main Authors: Fu-Teng Shi, 施富騰
• Other Authors: Muh-Cherng Wu
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/99638941796910735221

碩士 === 國立交通大學 === 工業工程與管理系所 === 95 === Resource-constrained project scheduling is a NP-hard problem. In the last few decades, several meta-heuristics algorithms have been proposed to solve the problem. The algorithm proposed by Debels et al. (2006) is by far the most leading one. To develop a better algorithm, we applied the notions of consensus and Taguchi genetic operators and proposed various meta-heuristics algorithms. Extensive numerical tests have been carried out. These tests include 1560 problem instances, which are categorized into 9 scenarios. Compared with the algorithm proposed by Debels et al. (2006), our algorithm excel in 22% scenarios, has a tie in 22% scenarios, and lose in 56% scenarios.