Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||An adaptive approach for solving dynamic scheduling with time-varying number of tasks - Part I|
|Citation:||Proceedings of the 2011 IEEE Congress of Evolutionary Computation (CEC 2011), held in New Orleans, LA, USA, 5-8 June, 2011: pp.1703-1710|
|Series/Report no.:||IEEE Congress on Evolutionary Computation|
|Conference Name:||IEEE Congress of Evolutionary Computation (2011 : New Orleans, USA)|
|Manuel Blanco Abello, Lam Thu Bui and Zbignew Michalewicz|
|Abstract:||Changes in environment is common in daily activities and usually introduce new problems. To be adaptive to these changes, new solutions to the problems are to be found every time change occur. Our previous publication showed that centroid of nondominated solutions associated with Multi-Objective Evolutionary Algorithm (MOEA) from previous changes enhances the search quality of solutions for the current change. However, the number of tasks in the test environment employed was fixed. In this two-part paper, we address the dynamic adaptation with time-varying task number. To cope with this variability, new components of the solution, corresponding to the new tasks, are inserted appropriately to all solutions of the previous changes. Then centroid of these modified solutions is recomputed. Further, to avoid confusion in solution presentation, the insertion of new tasks obliged the use of task ID number greater than the largest of the previous IDs. The first part of this paper will show that the resulting task numbering system will alter the centroid significantly which will degrade MOEA’s search quality. To circumvent, task IDs are mapped to new values in order to minimize difference in IDs between adjacent solution components; an approach which significantly upgraded the search performance despite changes in task number as supported by the obtained results.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.