Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.
Jorik JookenPieter LeymanPatrick De CausmaeckerTony WautersPublished in: CoRR (2020)
Keyphrases
- combinatorial optimization
- monte carlo tree search
- search space
- metaheuristic
- branch and bound
- monte carlo
- game tree
- combinatorial optimization problems
- combinatorial search
- traveling salesman problem
- search algorithm
- simulated annealing
- evaluation function
- combinatorial problems
- tree search
- branch and bound algorithm
- search tree
- mathematical programming
- optimization problems
- bayesian reinforcement learning
- heuristic search
- monte carlo search
- optimal solution
- vehicle routing problem
- ant colony optimization
- tabu search
- search strategy
- tree structure
- hill climbing
- temporal difference learning
- reinforcement learning methods
- temporal difference
- markov chain
- state space
- neural network