3260 papers • 126 benchmarks • 313 datasets
In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem. For some examples, you can visit https://aliasgharheidari.com/Publications.html
(Image credit: Papersgraph)
These leaderboards are used to track progress in metaheuristic-optimization-6
No benchmarks available.
Use these libraries to find metaheuristic-optimization-6 models and implementations
No subtasks available.
A novel algorithm called Donkey and Smuggler Optimization Algorithm (DSO), inspired by the searching behavior of donkeys, which is adapted and implemented on three real-world applications namely; traveling salesman problem, packet routing, and ambulance routing.
This paper introduces Gnowee, a modular, Python-based, open-source hybrid metaheuristic optimization algorithm designed for rapid convergence to nearly globally optimum solutions for complex, constrained nuclear engineering problems with mixed-integer and combinatorial design vectors and high-cost, noisy, discontinuous, black box objective function evaluations.
Pontogammarus Maeoticus Swarm Optimization (PMSO) is a metaheuristic algorithm imitating aquatic nature and foraging behavior modeled as sea edge (coast) to which Gammarus creatures are willing to move in order to rest from sea waves and forage in sand.
A meta-algorithm, Tree-Based Optimization (TBO), which uses other heuristic optimizers as its sub-algorithms in order to improve the performance of search and improve the speed of search.
The experiment results show that not only is the population size low, but also that the convergence speed is high, and that the algorithm is efficient in solving multi-modal problems.
ILS-SUMM is developed, a novel video summarization algorithm to solve the subset selection problem under the knapsack constraint based on the well-known metaheuristic optimization framework Iterated Local Search (ILS), known for its ability to avoid weak local minima and obtain a good near-global minimum.
The proposed MPSO improves the detection performance by 24% and time performance by 4.71 times compared to the original PSO, and also outperforms other state-of-the-art metaheuristic optimization algorithms including the artificial bee colony (ABC), ant colony optimization (ACO), genetic algorithm (GA), differential evolution (DE), and tree-seed algorithm (TSA) in most search scenarios.
The results show that the proposed SPSO outperforms not only other particle swarm optimization (PSO) variants including the classic PSO, phase angle-encoded PSO and quantum-behave PSO but also other state-of-the-art metaheuristic optimization algorithms including the genetic algorithm (GA), artificial bee colony (ABC), and differential evolution (DE) in most scenarios.
Adding a benchmark result helps the community track progress.