A modified LKH that re-ranks candidate edges with a dynamically updated backbone frequency and a bandit-chosen mix of metrics finds better tours on many large TSPLIB instances than stock LKH.
A hybrid genetic algo- rithm for the min–max multiple traveling salesman problem.Com- puters & Operations Research, 162:106455, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
A modified LKH that re-ranks candidate edges with a dynamically updated backbone frequency and a bandit-chosen mix of metrics finds better tours on many large TSPLIB instances than stock LKH.