Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows.
Penny L. HolbornJonathan M. ThompsonRhyd LewisPublished in: EvoCOP (2012)
Keyphrases
- vehicle routing problem
- exact methods
- np hard
- tabu search
- metaheuristic
- optimal solution
- integer programming
- test instances
- combinatorial optimization
- exact algorithms
- branch and bound algorithm
- benchmark instances
- lower bound
- vehicle routing
- vehicle routing problem with time windows
- heuristic methods
- search methods
- multi depot
- knapsack problem
- routing problem
- scheduling problem
- combinatorial optimization problems
- hybrid metaheuristic
- benchmark problems
- iterated local search
- variable neighborhood search
- traveling salesman problem
- np complete
- special case
- travel time
- approximation algorithms
- vehicle routing problem with simultaneous
- simulated annealing
- feasible solution
- particle swarm optimization
- linear programming
- computational complexity
- branch and bound
- decision problems
- search strategies
- exact solution
- linear program
- optimization problems
- greedy randomized adaptive search procedure
- search algorithm
- search space
- genetic algorithm
- reinforcement learning
- worst case
- path relinking
- scatter search
- approximate solutions