Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm
  for the Traveling Salesman Problem   We address the Traveling Salesman Problem (TSP), a famous NP-hard
combinatorial optimization problem. And we propose a variable strategy
reinforced approach, denoted as VSR-LKH, which combines three reinforcement
learning methods (Q-learning, Sarsa and Monte Carlo) with the well-known TSP
algorithm, called Lin-Kernighan-Helsgaun (LKH). VSR-LKH replaces the inflexible
traversal operation in LKH, and lets the program learn to make choice at each
search step by reinforcement learning. Experimental results on 111 TSP
benchmarks from the TSPLIB with up to 85,900 cities demonstrate the excellent
performance of the proposed method.

20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
3
The categories of this paper are: physics
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
2
The categories of this paper are: math
13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an