A modified harmony search for multi-mode resource constrained project scheduling problem
A harmony search is modified to optimize typical multi-mode resource constrained project scheduling problem, which aims to minimize the project makespan. In order to inherit elitist solution and maintain populations diversity based on distance simultaneously, we add a selection operator when the harmony memory is initialized and modify the replacement operator. A new solution can be improvised by three options, i.e. usage of harmony memory, pitch adjusting and randomization. The first option is adjusted to select solutions from harmony memory based on average objective value, and the second is only to justify mode selection. Finally, the harmony search is compared with the genetic algorithm which has better performance. The numerical experiments based on benchmark test sets of 20 and 30 activities with three modes show that harmony search can obtain high-quality and robust solutions.
Resource Constrained Project Scheduling Problem Multi-Mode Harmony Search
Fang Fu Chao Zhang
School of Economics and Management China University of Petroleum Dongying, China School of Physics Science and Technology China University of Petroleum Dongying, China
国际会议
杭州
英文
181-184
2011-10-28（万方平台首次上网日期，不代表论文的发表时间）