Harnessing memetic algorithms: a practical guide

DOI10.1007/S11750-024-00694-8MaRDI QIDQ6939507zbMATH OpenFDO

Authors Carlos Cotta

Publication date 21 August 2025

Published in Top (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11750-024-00694-8

zbMATH Keywords

aircraft landing schedulingevolutionary computationGRASPlocal searchmemetic algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A ``no free lunch tutorial: sharpened and focused no free lunch
• A hybrid genetic algorithm for the open shop scheduling problem
• A memetic algorithm with bucket elimination for the still life problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A reactive GRASP and path relinking for a combined production-distribution problem
• An efficient hybrid meta-heuristic for aircraft landing problem
• An indirect genetic algorithm for set covering problems
• Biased random-key genetic algorithms with applications in telecommunications
• Cellular genetic algorithms
• Genetic search methods in air traffic control
• Handbook of Approximation Algorithms and Metaheuristics
• Handbook of heuristics
• Handbook of metaheuristics
• Handbook of Natural Computing
• Heuristics, metaheuristics and approximate methods in planning and scheduling
• scientific article; zbMATH DE number 3624650 (Why is no real title available?)
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 2046115 (Why is no real title available?)
• Hybrid metaheuristics. An emerging approach to optimization.
• Hybridizations of metaheuristics with branch \& bound derivates
• Introduction to evolutionary computing
• Memetic algorithms: The polynomial local search complexity theory perspective
• Memetic particle swarm optimization
• Metaheuristics -- the metaphor exposed
• Multi-operator based evolutionary algorithms for solving constrained optimization problems
• Paramils: an automatic algorithm configuration framework
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Scheduling aircraft landings -- the static case
• Simultaneously applying multiple mutation operators in genetic algorithms
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
• Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
• Spatially structured evolutionary algorithms. Artificial evolution in space and time
• Tabu search tutorial. A graph drawing application
• The \(k\)-feature set problem is \(W[2]\)-complete
• The aircraft runway scheduling problem: a survey
• The algebra of genetic algorithms
• The impact of parametrization in memetic evolutionary algorithms
• Using Weighted Rankings in the Analysis of Complete Blocks with Additive Block Effects
• Variable neighborhood search: Principles and applications
• What Is Important About the No Free Lunch Theorems?

Cited in

(1)

• Guest editorial to the special issue on metaheuristics in TOP

This page was built for publication: Harnessing memetic algorithms: a practical guide

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