.png){kind=icon}
返回
Improved Evolutionary Algorithm Design for the Project Scheduling Problem Based on Runtime Analysis
.png){kind=icon}
OA
AI
DOI：10.1109/TSE.2013.52.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several variants of evolutionary algorithms (EAs) have been applied to solve the project scheduling problem (PSP), yet their performance highly depends on design choices for the EA. It is still unclear how and why different EAs perform differently. We present the first runtime analysis for the PSP, gaining insights into the performance of EAs on the PSP in general, and on specific instance classes that are easy or hard. Our theoretical analysis has practical implications-based on it, we derive an improved EA design. This includes normalizing employees' dedication for different tasks to ensure they are not working overtime; a fitness function that requires fewer pre-defined parameters and provides a clear gradient towards feasible solutions; and an improved representation and mutation operator. Both our theoretical and empirical results show that our design is very effective. Combining the use of normalization to a population gave the best results in our experiments, and normalization was a key component for the practical effectiveness of the new design. Not only does our paper offer a new and effective algorithm for the PSP, it also provides a rigorous theoretical analysis to explain the efficiency of the algorithm, especially for increasingly large projects.
Keyword:
Schedule and organizational issues
evolutionary algorithms
software project scheduling
software project management
search-based software engineering
runtime analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.6
论文数:
2.8K
被引数:
1.1W
机构
引用论文
分享收藏Developing KASP Markers on a Major Stripe Rust Resistance QTL in a Popular Wheat TAM 111 Using 90K Array and Genotyping‐by‐Sequencing SNPs.png)
Crop Science
Crop ScienceIF0
PREAI
分享收藏
查看更多内容