Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/118681
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | Dynamic differential evolution with combined variants and a repair method to solve dynamic constrained optimization problems: an empirical study |
Author: | Ameca-Alducin, M. Mezura-Montes, E. Cruz-Ramírez, N. |
Citation: | Soft Computing, 2018; 22(2):541-570 |
Publisher: | Springer |
Issue Date: | 2018 |
ISSN: | 1432-7643 1433-7479 |
Statement of Responsibility: | María-Yaneli Ameca-Alducin, Efrén Mezura-Montes, Nicandro Cruz-Ramírez |
Abstract: | An empirical study of the algorithm dynamic differential evolution with combined variants with a repair method (DDECV + Repair) in the solution of dynamic constrained optimization problems is presented. Unexplored aspects of the algorithm are of particular interest in this work: (1) the role of each one of its elements, (2) its sensitivity to different change frequencies and change severities in the objective function and the constraints, (3) its ability to detect a change and recover after it, besides its diversity handling (percentage of feasible and infeasible solutions) during the search, and (4) its performance with dynamism present in different parts of the problem. Seven performance measures, eighteen recently proposed test problems and eight algorithms found in the specialized literature are considered in four experiments. The statistically validated results indicate that DDECV + Repair is robust to change frequency and severity variations, and that it is particularly fast to recover after a change in the environment, but highly depends on its repair method and its memory population to provide competitive results. DDECV + Repair shows evidence on the convenience of keeping a proportion of infeasible solutions in the population when solving dynamic constrained optimization problems. Finally, DDECV + Repair is highly competitive particularly when dynamism is present in both, objective function and constraints. |
Keywords: | Differential evolution; constraint handling; dynamic optimization; dynamic constrained optimization problem |
Rights: | © Springer-Verlag Berlin Heidelberg 2016 |
DOI: | 10.1007/s00500-016-2353-1 |
Grant ID: | 220522 250141 |
Published version: | http://dx.doi.org/10.1007/s00500-016-2353-1 |
Appears in Collections: | Aurora harvest 4 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.