A Parallel Algorithm for the Vehicle Routing Problem.
Chris GroërBruce L. GoldenEdward A. WasilPublished in: INFORMS J. Comput. (2011)
Keyphrases
- parallel algorithm
- vehicle routing problem
- metaheuristic
- tabu search
- benchmark problems
- routing problem
- vehicle routing problem with time windows
- vehicle routing
- parallel computation
- hybrid metaheuristic
- particle swarm optimization
- multi depot
- memetic algorithm
- shared memory
- travel time
- np hard
- benchmark instances
- traveling salesman problem
- combinatorial optimization
- optimization problems
- pick up and delivery
- variable neighborhood search
- binary search trees
- parallel version
- search strategies
- cluster of workstations
- greedy randomized adaptive search procedure
- medial axis transform
- knapsack problem
- search space
- upper bound
- lower bound
- objective function