返回
Modified multi-objective evolutionary programming algorithm for solving project scheduling problems
DOI:10.1016/j.eswa.2021.115338.png)
摘要
En 中文
Though the Genetic Algorithm (GA) has received considerable attention recently in solving multi-objective optimization problems, inefficiency regarding performance has been reported in applications related to project scheduling. The degradation in efficiency was magnificent in applications of highly epistatic objective functions, including scheduling problems wherein the parameters being optimized are highly correlated. Furthermore, the crossover, being the dominant operator in GA, added significantly to the observed inefficiency for causing violations in the dependency between activities. Unlike GA, the Evolutionary Programming (EP) algorithm employs only a mutation operator which makes it less vulnerable to the dependency violation issue. This study proposes a modified Multi-Objective Evolutionary Programming (MOEP) algorithm to model and solve scheduling problems of multi-mode activities, including time-cost trade-off and finance-based scheduling with resource levelling. The modification involves the implementation of a new mutation operator to accommodate the scheduling problems in hand. Furthermore, the modified MOEP algorithm is benchmarked against the two multi-objective algorithms of SPEA-II and NSGA-II which have been used extensively in the literature to solve project scheduling problems. The results indicated that the modified MOEP algorithm outperformed SPEAII and NSGA-II in terms of the diversity and quality of the Pareto optimal set.
Keyword:
Multi-objective optimization
Evolutionary programming
Project scheduling
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Geochemistry of basalts from IODP site U1365: Implications for magmatism and mantle source signatures of the mid-Cretaceous Osbourn Trough
Lithos
IF0
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法

