The repository administrator has not yet configured an RDF license.
Different Approaches of Evolutionary Algorithms to Multiple Objective RCPSP
Task assignments to the project members play a vital role in the project planning process. The project's quality, development time, and cost are criteria to indicate a success or failure project. These are affected by every single arrangement generated by the optimizer. Unfortunately, the task assignment problem is a multi-objective optimization problem (MOP) and complex scheduling problem in software development projects (MOP-PSP) and other domains. There are several approaches to MOP introduced in the literature. Our study aims to evaluate different evolutionary algorithms (EAs), including the compromise programming-based and Pareto frontier-based for the MOP-PSP. To make this work, we calibrate the parameters for the genetic algorithm (GA) developed in the previous research and design a new version of the ant colony algorithm (ACO) to solve the compromised problem. They are then compared with the NGSA-2, a Multi objective EA. Experiments show that compromise programming is an effective method for the decision-making process in practice. © 2022 ACM.
ACM International Conference Proceeding Series
HTML Summary of #16732 Different Approaches of Evolutionary Algorithms to Multiple Objective RCPSP