A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty
A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty
复制标题
DOI：
10.1016/j.ejor.2006.03.056
复制
发表时间：
2007-08
期刊：
影响因子：
--
通讯作者：
S. Shadrokh;F. Kianfar
中科院分区：
文献类型：
--
作者：
S. Shadrokh;F. Kianfar
本文提出了一种求解一类项目调度问题--资源投资问题的遗传算法。允许项目延误，但规定了罚款。对算法中的染色体结构、不适应度函数、交叉、变异、移民和局部搜索等操作进行了说明。该遗传算法的性能进行了比较与其他已发表的算法的性能资源投资问题。并对690个问题进行了求解，其最优解用于遗传算法的性能测试。试验结果令人满意。
In this paper a genetic algorithm for solving a class of project scheduling problems, called Resource Investment Problem, is presented. Tardiness of project is permitted with defined penalty. Elements of algorithm such as chromosome structure, unfitness function, crossover, mutation, immigration and local search operations are explained. The performance of this genetic algorithm is compared with the performance of other published algorithms for Resource Investment Problem. Also 690 problems are solved and their optimal solutions are used for the performance tests of the genetic algorithm. The tests results are quite satisfactory.