Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/128273
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Neural networks in evolutionary dynamic constrained optimization: computational cost and benefits
Author: Hasani Shoreh, M.
Hermoza Aragones, R.
Neumann, F.
Citation: Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), as published in Frontiers in Artificial Intelligence and Applications, 2020 / vol.325, pp.275-282
Publisher: IOS Press BV
Publisher Place: Amsterdam, Netherlands
Issue Date: 2020
Series/Report no.: Frontiers in Artificial Intelligence and Applications; 325
ISBN: 9781643681009
ISSN: 0922-6389
1879-8314
Conference Name: European Conference on Artificial Intelligence (ECAI) (29 Aug 2020 - 08 Sep 2020 : Santiago de Compostela, Spain)
Statement of
Responsibility: 
Maryam Hasani-Shoreh and Renato Hermoza Aragonés and Frank Neumann
Abstract: Neural networks (NN) have been recently applied together with evolutionary algorithms (EAs) to solve dynamic optimization problems. The applied NN estimates the position of the next optimum based on the previous time best solutions. After detecting a change, the predicted solution can be employed to move the EA’s population to a promising region of the solution space in order to accelerate convergence and improve accuracy in tracking the optimum. While previous works show improvement of the results, they neglect the overhead created by NN. In this work, we reflect the time spent for training NN in the optimization time and compare the results with a baseline EA. We explore if by considering the generated overhead, NN is still able to improve the results, and under which conditions is able to do so. The main difficulties to train the NN are: 1) to get enough samples to generalize predictions for new data, and 2) to obtain reliable samples. As NN needs to collect data at each time step, if the time horizon is short, we will not be able to collect enough samples to train the NN. To alleviate this, we propose to consider more individuals on each time to speed up sample collection in shorter time steps. In environments with high frequency of changes, the solutions produced by EA are likely to be far from the real optimum. Using unreliable train data for the NN will, in consequence, produce unreliable predictions. Also, as the time spent for NN stays fixed regardless of the frequency, a higher frequency of change will mean a higher produced overhead by the NN in proportion to the EA. In general, after considering the generated overhead, we conclude that NN is not suitable in environments with high frequency of changes and/or short time horizons. However, it can be promising for the low frequency of changes, and especially for the environments that changes have a pattern.
Rights: © 2020 The authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0).
RMID: 1000014435
DOI: 10.3233/FAIA200103
Grant ID: http://purl.org/au-research/grants/arc/DP160102401
http://purl.org/au-research/grants/arc/DP180103232
Published version: http://ebooks.iospress.nl/doi/10.3233/FAIA325
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_128273.pdfPublished version613.34 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.