Everything About ___
Live briefing

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

  1. Read the overview: MetaheuristicA 5-minute orientation
  2. Skim a recent paper: Coati Optimization Algorithm: A new bio-inspired metaheuristic algorithm for solving optimization problemsInfluential work since 2022
  3. Pick up a classic book: Handbook of Approximation Algorithms and MetaheuristicsThe most-reprinted book on the subject
  4. Read the landmark paper: Marine Predators Algorithm: A nature-inspired metaheuristicCited 2,331 times
  5. Go sideways: List of metaphor-based metaheuristicsA closely related topic
  6. Go sideways: Memetic algorithmA closely related topic

📖 Definitions

Noun An experimental heuristic method for solving a general class of computational problems by combining user procedures in the hope of obtaining a more efficient or robust procedure.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics