A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints.
Bruno-Laurent GarciaJean-Yves PotvinJean-Marc RousseauPublished in: Comput. Oper. Res. (1994)
Keyphrases
- parallel implementation
- vehicle routing problem
- vehicle routing problem with time windows
- test instances
- metaheuristic
- parallel implementations
- routing problem
- traveling salesman problem
- guided local search
- combinatorial problems
- distributed memory
- variable neighborhood search
- tabu search
- waste collection
- computational complexity
- benchmark problems
- global constraints
- combinatorial optimization
- benchmark instances
- parallel computers
- constraint satisfaction