Metaheuristic Optimization

Overview

Metaheuristic optimization studies how to search large, complex solution spaces efficiently, especially when exact solvers are impractical. Common approaches include genetic algorithms and other evolutionary methods, particle swarms, ant colony optimization, simulated annealing, and large-neighborhood search, often combined with local improvement or exact subroutines. Researchers also use machine learning, reinforcement learning, and language models to select operators, tune parameters, or design heuristics for tasks such as routing, scheduling, and engineering design. A central challenge is that no method works best everywhere: results depend on the problem, instance, and computational budget, while fair comparisons, generalization, and reliable performance guarantees remain open concerns.

Latest papers

CardsList

123 papers10 papers in the last four weeks, down 9% on the four weeks before. 0.1% of all new papers.

  1. VRPAgent: LLM-Driven Discovery of Heuristic Operators for Vehicle Routing Problems

    Oct 8, 2025André Hottung, Federico Berto, Chuanbo Hua +9Vehicle RoutingAutomated Heuristic Design

  2. Explainable Information Processing in Particle Swarm Optimization through Landscape and Search Behavior Analysis

    Sep 8, 2025Nitin Gupta, Bapi Dutta, Anupam YadavMetaheuristic OptimizationExplainability Evaluation

  3. Knowledge-Guided Memetic Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs

    Jul 29, 2025Qingya Li, Shengcai Liu, Wenjie Chen +3Combinatorial OptimizationVehicle Routing