Metaheuristic Optimization
14 papers with code • 0 benchmarks • 1 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
Benchmarks
These leaderboards are used to track progress in Metaheuristic Optimization
Most implemented papers
AutoOpt: A General Framework for Automatically Designing Metaheuristic Optimization Algorithms with Diverse Structures
However, the specific algorithm prototype and linear algorithm representation in the current automated design pipeline restrict the design within a fixed algorithm structure, which hinders discovering novelties and diversity across the metaheuristic family.
HiveNAS: Neural Architecture Search using Artificial Bee Colony Optimization
The traditional Neural Network-development process requires substantial expert knowledge and relies heavily on intuition and trial-and-error.
Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling
Dispatching vehicle fleets to serve flights is a key task in airport ground handling (AGH).
AutoOptLib: Tailoring Metaheuristic Optimizers via Automated Algorithm Design
In response, this paper proposes AutoOptLib, the first platform for accessible automated design of metaheuristic optimizers.