Evolutionary computation for dynamic optimization problems
Shengxiang Yang
- 06 Jul 2013
- pp 629-649
TL;DR: This tutorial aims to summarize the research area of EC for DOPs and attract potential young researchers into the important research area with an in-depth description of the state-of-the-art of research in the field regarding the following five aspects: benchmark problems and generators, performance measures, algorithmic approaches, theoretical studies, and applications.
read more
Abstract: Many real-world optimization problems are subject to dynamic environments, where changes may occur over time regarding optimization objectives, decision variables, and/or constraint conditions. Such dynamic optimization problems (DOPs) are challenging problems for researchers and practitioners in decision-making due to their nature of difficulty. Yet, they are important problems that decision-makers in many domains need to face and solve. Evolutionary computation (EC) is a class of stochastic optimization methods that mimic principles from natural evolution to solve optimization and search problems. EC methods are good tools to address DOPs due to their inspiration from natural and biological evolution, which has always been subject to changing environments. EC for DOPs has attracted a lot of research effort during the last twenty years with some promising results. However, this research area is still quite young and far away from well-understood. This tutorial aims to summarize the research area of EC for DOPs and attract potential young researchers into the important research area. It will provide an introduction to the research area of EC for DOPs and carry out an in-depth description of the state-of-the-art of research in the field regarding the following five aspects: benchmark problems and generators, performance measures, algorithmic approaches, theoretical studies, and applications. Some future research issues and directions regarding EC for DOPs will also be presented. The purpose is to (i) provide clear definition and classification of DOPs; (ii) review current approaches and provide detailed explanations on how they work; (iii) review the strengths and weaknesses of each approach; (iv) discuss the current assumptions and coverage of existing research on EC for DOPs; and (v) identify current gaps, challenges, and opportunities in EC for DOPs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of swarm intelligence for dynamic optimization: Algorithms and applications
TL;DR: A broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications, and some considerations about future directions in the subject are given.
563
Evolutionary Dynamic Multiobjective Optimization: Benchmarks and Algorithm Comparisons
Shouyong Jiang,Shengxiang Yang +1 more
TL;DR: A new benchmark generator is proposed that is able to tune a number of challenging characteristics, including mixed Pareto-optimal front (convexity-concavity), nonmonotonic and time-varying variable-linkages, mixed types of changes, and randomness in type change, which have rarely or not been considered or tested in the literature.
212
An adaptive approach for UAV-based pesticide spraying in dynamic environments
Bruno S. Faial,Heitor Freitas,Pedro Gomes,Leandro Yukio Mano,Gustavo Pessin,Andr C.P.L.F. de Carvalho,Bhaskar Krishnamachari,Jó Ueyama +7 more
TL;DR: Experimental results show that the proposed computer-based system approach with autonomous route change metaheuristics provides more precise changes in the UAVs flight route, with more accurate deposition of the pesticide and less environmental damage.
203
Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
TL;DR: It is of utmost importance to use a correct tool for measuring the performance of the diverse set of metaheuristic algorithms to derive an appropriate judgment on the superiority of the algorithms and also to validate the claims raised by researchers for their specific objectives.
201
Neural network based multi-objective evolutionary algorithm for dynamic workflow scheduling in cloud computing
TL;DR: The empirical study based on real-world applications from Pegasus workflow management system reveals that the NN-DNSGA-II algorithm significantly outperforms the other alternatives in most cases with respect to metrics used for DMOPs with unknown true Pareto-optimal front, including the number of non-dominated solutions, Schott’s spacing and Hypervolume indicator.
178
References
Ant system: optimization by a colony of cooperating agents
Marco Dorigo,Vittorio Maniezzo,Alberto Colorni +2 more
- 01 Feb 1996
TL;DR: It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.
Evolutionary optimization in uncertain environments-a survey
Yaochu Jin,Jürgen Branke +1 more
TL;DR: This paper attempts to provide a comprehensive overview of the related work within a unified framework on addressing different uncertainties in evolutionary computation, which has been scattered in a variety of research areas.
•Book
Evolutionary Optimization in Dynamic Environments
Jürgen Branke
- 31 Dec 2001
TL;DR: This book presents a brief introduction to Evolutionary Algorithms, a methodology for enabling Continuous Adaptation in Dynamic Environments and its applications, and some of the principles behind it, as well as some of its critics.
898
Memory enhanced evolutionary algorithms for changing optimization problems
Jürgen Branke
- 06 Jul 1999
TL;DR: A new way to explore the benefits of a memory while minimizing its negative side effects is derived from a number of approaches that extend the evolutionary algorithm with implicit or explicit memory.
Evolutionary dynamic optimization: A survey of the state of the art
TL;DR: An in-depth survey of the state-of-the-art of academic research in the field of EDO and other meta-heuristics in four areas: benchmark problems/generators, performance measures, algorithmic approaches, and theoretical studies is carried out.
676