A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems.
Lars Magnus HvattumArne LøkketangenGilbert LaportePublished in: Networks (2007)
Keyphrases
- vehicle routing problem
- multi depot
- benchmark instances
- vehicle routing problem with time windows
- tabu search
- test instances
- guided local search
- variable neighborhood search
- tree search algorithm
- metaheuristic
- neighborhood search
- combinatorial optimization
- optimal solution
- waste collection
- scheduling problem
- traveling salesman problem
- genetic algorithm
- lower bound
- routing problem
- search algorithm
- greedy randomized adaptive search procedure
- search strategies
- search procedure
- particle swarm optimization
- simulated annealing
- worst case
- search space
- reinforcement learning