Targeted sampling of enlarged neighborhood via Monte Carlo tree search for TSP

1 code implementation • ICLR 2020 • Zhang-Hua Fu, Kai-Bin Qiu, Meng Qiu, Hongyuan Zha

More precisely, the search process is considered as a Markov decision process (MDP), where a 2-opt local search is used to search within a small neighborhood, while a Monte Carlo tree search (MCTS) method (which iterates through simulation, selection and back-propagation steps), is used to sample a number of targeted actions within an enlarged neighborhood.

BIG-bench Machine Learning Combinatorial Optimization