55 citations · 61 across the 10 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024
Dancing to the State of the Art? How Candidate Lists Influence LKH for Solving the Traveling Salesperson Problem
Jonathan Heins, Lennart Schäpermeier, Pascal Kerschke +1
Solving the Traveling Salesperson Problem (TSP) remains a persistent challenge, despite its fundamental role in numerous generalized applications in modern contexts. Heuristic solv…
cs.AI2023
A Parallel Ensemble of Metaheuristic Solvers for the Traveling Salesman Problem
Swetha Varadarajan, Darrell Whitley
The travelling salesman problem (TSP) is one of the well-studied NP-hard problems in the literature. The state-of-the art inexact TSP solvers are the Lin-Kernighan-Helsgaun (LKH) h…