Evolutionary dynamic multi-objective optimisation: A survey

S Jiang, J Zou, S Yang, X Yao - ACM Computing Surveys, 2022 - dl.acm.org
Evolutionary dynamic multi-objective optimisation (EDMO) is a relatively young but rapidly
growing area of investigation. EDMO employs evolutionary approaches to handle multi …

Evolutionary dynamic optimization: A survey of the state of the art

TT Nguyen, S Yang, J Branke - Swarm and Evolutionary Computation, 2012 - Elsevier
Optimization in dynamic environments is a challenging but important task since many real-
world optimization problems are changing over time. Evolutionary computation and swarm …

Bio-inspired computation: Where we stand and what's next

J Del Ser, E Osaba, D Molina, XS Yang… - Swarm and Evolutionary …, 2019 - Elsevier
In recent years, the research community has witnessed an explosion of literature dealing
with the mimicking of behavioral patterns and social phenomena observed in nature towards …

A survey of swarm intelligence for dynamic optimization: Algorithms and applications

M Mavrovouniotis, C Li, S Yang - Swarm and Evolutionary Computation, 2017 - Elsevier
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm
optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish …

Transfer learning-based dynamic multiobjective optimization algorithms

M Jiang, Z Huang, L Qiu, W Huang… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
One of the major distinguishing features of the dynamic multiobjective optimization problems
(DMOPs) is that optimization objectives will change over time, thus tracking the varying …

Hyper-heuristics: A survey of the state of the art

EK Burke, M Gendreau, M Hyde, G Kendall… - Journal of the …, 2013 - Taylor & Francis
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the
goal of automating the design of heuristic methods to solve hard computational search …

Ant colony optimization with clustering for solving the dynamic location routing problem

S Gao, Y Wang, J Cheng, Y Inazumi, Z Tang - Applied Mathematics and …, 2016 - Elsevier
Ant colony algorithm can resolve dynamic optimization problems due to its robustness and
adaptation. The aim of such algorithms in dynamic environments is no longer to find an …

A self-adaptive multi-population based Jaya algorithm for engineering optimization

RV Rao, A Saroj - Swarm and Evolutionary computation, 2017 - Elsevier
Multi-population algorithms have been widely used for solving the real-world problems.
However, it is not easy to get the number of sub-populations to be used for a given problem …

Ant colony optimization with local search for dynamic traveling salesman problems

M Mavrovouniotis, FM Müller… - IEEE transactions on …, 2016 - ieeexplore.ieee.org
For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between
two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms …

A reinforcement learning approach for dynamic multi-objective optimization

F Zou, GG Yen, L Tang, C Wang - Information Sciences, 2021 - Elsevier
Abstract Dynamic Multi-objective Optimization Problem (DMOP) is emerging in recent years
as a major real-world optimization problem receiving considerable attention. Tracking the …