Everything about Metaheuristic
Optimization technique
In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, tune, or select a heuristic that may provide a sufficiently good solution to an optimization problem or a machine learning problem, especially with incomplete or imperfect information or limited computation capacity. Metaheuristics sample a subset of solutions which is otherwise too large to be completely enumerated or otherwise explored. Metaheuristics may make relatively few assumptions about the optimization problem being solved and so may be usable for a variety of problems. Their use is always of interest when exact or other (approximate) methods are not available or are not expedient, either because the calculation time is too long or because, for example, the solution provided is too imprecise. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: MetaheuristicA 5-minute orientation
- Skim a recent paper: Learning for multiple purposes: A Q-learning enhanced hybrid metaheuristic for parallel drone scheduling traveling salesman problemInfluential work since 2022
- Pick up a classic book: Parallel MetaheuristicsThe most-reprinted book on the subject
- Read the landmark paper: A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systemsCited 269 times
- Go sideways: List of metaphor-based metaheuristicsA closely related topic
- Go sideways: Memetic algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems
GPU Computing for Parallel Local Search Metaheuristic Algorithms
Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey
An asynchronous parallel metaheuristic for the period vehicle routing problem
Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
A cooperative parallel metaheuristic for the capacitated vehicle routing problem
COSEARCH: A Parallel Cooperative Metaheuristic
A parallel metaheuristic approach for ensemble feature selection based on multi-core architectures
🆕 Influential since 2022
Learning for multiple purposes: A Q-learning enhanced hybrid metaheuristic for parallel drone scheduling traveling salesman problem
Optimal operation of battery storage systems in standalone and grid-connected DC microgrids using parallel metaheuristic optimization algorithms
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem
Interval type-2 fuzzy sliding mode control for a cable-driven parallel robot with elastic cables using metaheuristic optimization methods
Parallel Hybrid Island Metaheuristic Algorithm
📚 Books worth reading
Parallel MetaheuristicsEnrique Alba · 2005
Parallel metaheuristicsEnrique Alba · 2005
Parallel programming, models, and applications in grid and p2p systemsFatos Xhafa · 2009
Advances in multi-objective nature inspired computingCarlos A. Coello Coello · 2010- 📕Metaheuristics in Uncertain EnvironmentsEl-Ghazali Talbi
Models for parallel and distributed computationR. Correa, Inês Dutra · 2002
Information computing and applicationsChina) ICICA (Conference) (3rd 2012 Chengde · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- List of metaphor-based metaheuristics This is a chronologically ordered list of metaphor-based metaheuristics and swarm intelligence algorithms, sorted by decade of proposal. Simulated annealing…
- Memetic algorithm In computer science and operations research, a memetic algorithm (MA) is an extension of an evolutionary algorithm (EA) that aims to accelerate the evolutionary…
- Evolutionary algorithm Evolutionary algorithms (EA) reproduce essential elements of biological evolution in a computer algorithm in order to solve "difficult" problems, at least…
- Evolutionary computation Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield…
- Simulated annealing Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic to…
- Hyper-heuristic A hyper-heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting…
- Genetic algorithm A genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)…
- Greedy randomized adaptive search procedure The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems…