Memetic algorithms: The polynomial local search complexity theory perspective

DOI10.1007/S10852-007-9070-9MaRDI QIDQ2481603zbMATH OpenOpenAlexFDO

Authors Natalio Krasnogor, J. E. Smith

Publication date 11 April 2008

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-007-9070-9

zbMATH Keywords

Evolutionary hybrid algorithmsGenetic local search hybridsGraph partitioningHyper-heuristicsMemetic algorithmsMeta-Lamarckian algorithmsMultimeme algorithmsPolynomial local searchTravelling salesman problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• A Gentle Introduction to Memetic Algorithms
• Memetic evolutionary algorithms
• scientific article; zbMATH DE number 5582828
• The impact of parametrization in memetic evolutionary algorithms
• scientific article; zbMATH DE number 2159378

Cites work

• Complexity of local search for the \(p\)-median problem
• Drift analysis and average time complexity of evolutionary algorithms
• Evolution algorithms in combinatorial optimization
• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• How easy is local search?
• scientific article; zbMATH DE number 4104743 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1082099 (Why is no real title available?)
• scientific article; zbMATH DE number 1082100 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 1082109 (Why is no real title available?)
• scientific article; zbMATH DE number 960162 (Why is no real title available?)
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• Variable neighborhood search for the p-median
• Variable neighborhood search: Principles and applications

Cited in

(8)

• The impact of parametrization in memetic evolutionary algorithms
• A study on the use of ``self-generation in memetic algorithms
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• Memetic evolutionary algorithms
• Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
• scientific article; zbMATH DE number 2079900 (Why is no real title available?)
• A memetic model based on fixed structure learning automata for solving NP-hard problems
• Harnessing memetic algorithms: a practical guide

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Memetic algorithms: The polynomial local search complexity theory perspective

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