Memetic algorithms outperform evolutionary algorithms in multimodal optimisation

DOI10.1016/J.ARTINT.2020.103345MaRDI QIDQ2211864zbMATH OpenOpenAlexFDO

Authors Phan Trung Hai Nguyen, Dirk Sudholt

Publication date 16 November 2020

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://eprints.whiterose.ac.uk/162048/1/revised_paper.pdf

zbMATH Keywords

black-box optimisationevolutionary algorithmshybridisationmemetic algorithmssearch heuristicstime complexity

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Memetic evolutionary algorithms
• The impact of parametrization in memetic evolutionary algorithms
• Memetic algorithms: The polynomial local search complexity theory perspective
• Comparison of Various Evolutionary and Memetic Algorithms
• A Gentle Introduction to Memetic Algorithms

Cites work

• Analysis of an iterated local search algorithm for vertex coloring
• Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
• Crossover can provably be useful in evolutionary computation
• Exponential slowdown for larger populations. The (+1)-EA on monotone functions
• From black-box complexity to designing new genetic algorithms
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Hypomixability Elimination In Evolutionary Systems
• Introduction to algorithms.
• Introduction to evolutionary computing
• Landscapes, operators and heuristic search
• Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
• Mean, Median and Mode in Binomial Distributions
• Memetic evolutionary algorithms
• More effective crossover operators for the all-pairs shortest path problem
• Real royal road functions -- where crossover provably is essential
• Real royal road functions for constant population size
• Run-time analysis of population-based evolutionary algorithm in noisy environments
• Running time analysis of ant colony optimization for shortest path problems
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• The impact of parametrization in memetic evolutionary algorithms
• The one-dimensional Ising model: mutation versus recombination
• Towards a runtime comparison of natural and artificial evolution
• When a genetic algorithm outperforms hill-climbing

Cited in

(13)

• The impact of parametrization in memetic evolutionary algorithms
• Does comma selection help to cope with local optima?
• Comparative Investigation of Various Evolutionary and Memetic Algorithms
• Memetic evolutionary algorithms
• Comparison of Various Evolutionary and Memetic Algorithms
• The cost of randomness in evolutionary algorithms: crossover can save random bits
• An extended jump functions benchmark for the analysis of randomized search heuristics
• Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
• Analysing equilibrium states for population diversity
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• A flexible evolutionary algorithm with dynamic mutation rate archive
• Achieving tight \(O(4^k)\) runtime bounds on \(\textsc{Jump}_k\) by proving that genetic algorithms evolve near-maximal population diversity
• A memetic algorithm for evolutionary prototype selection: A scaling up approach

This page was built for publication: Memetic algorithms outperform evolutionary algorithms in multimodal optimisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211864)