Hybrid Metaheuristic Combining the Dragonfly Algorithm and Tabu Search for the Traveling Salesman Problem
Researchers have developed a new hybrid metaheuristic approach to solve the Traveling Salesman Problem (TSP), a complex optimization challenge. This method integrates the Dragonfly Algorithm, known for its global search capabilities, with Tabu Search, which uses memory to refine solutions locally. The combined strategy aims to improve tour quality by exploring broadly and then fine-tuning promising results, showing better performance than individual algorithms on benchmark instances. AI
IMPACT Introduces a novel algorithmic approach for combinatorial optimization problems.