A Parallel Monte-Carlo Tree Search-Based Metaheuristic For Optimal Fleet Composition Considering Vehicle Routing Using Branch & Bound.
T. M. J. T. BaltussenMithun GouthamMeghna MenonSarah G. GarrowMario A. SantilloStephanie StockarPublished in: IV (2023)
Keyphrases
- vehicle routing problem
- vehicle routing
- metaheuristic
- optimal solution
- monte carlo tree search
- tabu search
- logistics distribution
- travel time
- routing problem
- combinatorial optimization
- optimization problems
- simulated annealing
- ant colony optimization
- search space
- monte carlo
- benchmark problems
- optimization method
- genetic algorithm
- traveling salesman problem
- particle swarm optimization
- mathematical programming
- search methods
- np hard
- branch and bound algorithm
- evaluation function
- feasible solution
- hybrid algorithm
- knapsack problem
- special case
- lower bound
- search algorithm
- objective function