paper-with-me

홈 › Papers

Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits

2020-01-22 · Maryam Hasani-Shoreh, Renato Hermoza Aragonés, Frank Neumann

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 on 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 condition 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 change to speed up sample collection in shorter time steps. In environments with a 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 a 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.

📄 PDF Abstract BibTeX arXiv:2001.11588

Code (1)

renato145/DENN 공식 구현 pytorch

Tasks

Evolutionary Algorithms

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

NeuroWeaver: An Autonomous Evolutionary Agent for Exploring the Programmatic Space of EEG Analysis Pipelines

2026-02-13 · Guoan Wang, Shihao Yang, Jun-En Ding, Feng Liu arxiv

Although foundation models have demonstrated remarkable success in general domains, the application of these models to electroencephalography (EEG) analysis is constrained by substantial data requirements and high parame…

A Data-Driven Evolutionary Transfer Optimization for Expensive Problems in Dynamic Environments

2022-11-05 · Ke Li, Renzhi Chen, Xin Yao

Many real-world problems are usually computationally costly and the objective functions evolve over time. Data-driven, a.k.a. surrogate-assisted, evolutionary optimization has been recognized as an effective approach for…

Transfer Learning

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem

2024-04-09 · Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann

Real-world optimization problems often involve stochastic and dynamic components. Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt to uncertain and changing environments but…

Evolutionary Algorithms

Particle Swarm Optimization: Development of a General-Purpose Optimizer

2021-01-25 · Mauro S. Innocente, Johann Sienz

Traditional methods present a very restrictive range of applications, mainly limited by the features of the function to be optimized and of the constraint functions. In contrast, evolutionary algorithms present almost no…

Evolutionary AlgorithmsOpen-Ended Question Answering

Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives

2020-02-17 · Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann 외

Real-world combinatorial optimization problems are often stochastic and dynamic. Therefore, it is essential to make optimal and reliable decisions with a holistic approach. In this paper, we consider the dynamic chance-c…

Combinatorial OptimizationEvolutionary Algorithms