A parallel algorithm for the vehicle routing problem with time window constraints.
Jürgen SchulzeTorsten FahlePublished in: Ann. Oper. Res. (1999)
Keyphrases
- parallel algorithm
- vehicle routing problem
- metaheuristic
- tabu search
- routing problem
- parallel computation
- benchmark problems
- vehicle routing problem with time windows
- hybrid metaheuristic
- vehicle routing
- traveling salesman problem
- shared memory
- travel time
- benchmark instances
- memetic algorithm
- particle swarm optimization
- multi depot
- combinatorial optimization
- cluster of workstations
- constraint satisfaction
- variable neighborhood search
- np hard
- pick up and delivery
- medial axis transform
- neural network
- greedy randomized adaptive search procedure
- parallel version
- depth first search
- memory efficient
- knapsack problem
- cost function
- search algorithm
- information retrieval