Integration of Ant Colony Optimization and Tabu Search for Multi-Mode Resource-Constrained Project Scheduling
碩士 === 國立高雄第一科技大學 === 電腦與通訊工程系碩士班 === 106 === In recent years, a scheduling method that can effectively utilize available resources in large-scale project scheduling is an indispensable core component. In this study, we focus on the Muti-Mode Resource-Constrained Project Scheduling Problem (MRCPSP),...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/zeykt5 |
| Summary: | 碩士 === 國立高雄第一科技大學 === 電腦與通訊工程系碩士班 === 106 === In recent years, a scheduling method that can effectively utilize available resources in large-scale project scheduling is an indispensable core component. In this study, we focus on the Muti-Mode Resource-Constrained Project Scheduling Problem (MRCPSP), which aims at finding the minimun makespans with determining priority and execution mode.This problem is extremely complex and has proven to be an NP-Hard problem. To solve this problem, we proposed a Max-Min Ant System (MMAS),which is based on the Ant Colony Optimization (ACO) and integrated with Tabu search. Trying to get a satisfactory solution within a reasonable calculation range. Performance of the proposed algorithm is demonstrated by comparison with other general-purpose heuristic algorithms in terms of overall completion time for a set of project instances obtained form the Project Scheduling Library (PSPLIB), the experimental results show that the proposed algorithm has a very significant performance in the performance of problem solving.
|
|---|