Monte-Carlo Search for Prize-Collecting Robot Motion Planning with Time Windows, Capacities, Pickups, and Deliveries.
Stefan EdelkampErion PlakuYassin WarsamePublished in: KI (2019)
Keyphrases
- vehicle routing problem
- prize collecting
- monte carlo search
- travel time
- evaluation function
- vehicle routing
- metaheuristic
- tabu search
- traveling salesman problem
- monte carlo tree search
- benchmark problems
- motion planning
- particle swarm optimization
- combinatorial optimization
- np hard
- search strategies
- ant colony optimization
- neural network
- knapsack problem
- simulated annealing
- genetic algorithm
- path planning
- computational complexity