A parallel implementation of the TSSP + 1 decomposition for the capacity-constrained vehicle routing problem.
Melissa R. BowersCharles E. NoonBenjamin ThomasPublished in: Comput. Oper. Res. (1996)
Keyphrases
- parallel implementation
- vehicle routing problem
- metaheuristic
- tabu search
- routing problem
- vehicle routing
- vehicle routing problem with time windows
- traveling salesman problem
- memetic algorithm
- benchmark problems
- test instances
- combinatorial optimization
- hybrid metaheuristic
- parallel implementations
- np hard
- parallel computers
- search strategies
- distributed memory
- particle swarm optimization
- multi depot
- travel time
- simulated annealing
- logistics distribution
- scheduling problem