Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Using neural networks and diversifying differential evolution for dynamic optimisation|
|Author:||Hasani Shoreh, M.|
Hermoza Aragones, R.
|Citation:||Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence (IEEE SSCI), 2020 / pp.289-296|
|Conference Name:||IEEE Symposium Series on Computational Intelligence (SSCI) (01 Dec 2020 - 04 Dec 2020 : Virtual Online)|
|Maryam Hasani Shoreh, Renato Hermoza Aragonés, Frank Neumann|
|Abstract:||Dynamic optimisation occurs in a variety of realworld problems. To tackle these problems, evolutionary algorithms have been extensively used due to their effectiveness and minimum design effort. However, for dynamic problems, extra mechanisms are required on top of standard evolutionary algorithms. Among them, diversity mechanisms have proven to be competitive in handling dynamism, and recently, the use of neural networks have become popular for this purpose. Considering the complexity of using neural networks in the process compared to simple diversity mechanisms, we investigate whether they are competitive and the possibility of integrating them to improve the results. However, for a fair comparison, we need to consider the same time budget for each algorithm. Thus instead of the usual number of fitness evaluations as the measure for the available time between changes, we use wall clock timing. The results show the significance of the improvement when integrating the neural network and diversity mechanisms depends to the type and the frequency of changes. Moreover, we observe that for differential evolution, having a proper diversity in population when using neural network plays a key role in the neural network’s ability to improve the results.|
|Keywords:||Dynamic constrained optimisation; differential evolution; neural network|
|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.