Recomputing Solutions to Perturbed Multi-Commodity Pickup and Delivery Vehicle Routing Problems using Monte Carlo Tree Search.
Mithun GouthamStephanie StockarPublished in: CoRR (2023)
Keyphrases
- monte carlo tree search
- tree search algorithm
- vehicle routing problem
- multi commodity
- benchmark problems
- monte carlo
- facility location
- max min
- heuristic solution
- evaluation function
- routing problem
- metaheuristic
- combinatorial optimization
- tabu search
- simulated annealing
- network flow problem
- optimal solution
- network design
- solution space
- genetic algorithm
- branch and bound
- traveling salesman problem
- solution quality
- particle swarm optimization
- np hard
- multi objective
- lower bound