An asynchronous parallel metaheuristic for the period vehicle routing problem.
Lúcia M. A. DrummondLuiz Satoru OchiDalessandro Soares ViannaPublished in: Future Gener. Comput. Syst. (2001)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- simulated annealing
- optimization problems
- routing problem
- hybrid metaheuristic
- ant colony optimization
- iterated local search
- vehicle routing problem with time windows
- combinatorial optimization
- scatter search
- vehicle routing
- genetic algorithm
- search space
- benchmark instances
- combinatorial optimization problems
- greedy randomized adaptive search procedure
- test instances
- optimal solution
- memetic algorithm
- travel time
- particle swarm optimization
- path relinking
- search methods
- solution space
- benchmark problems
- traveling salesman problem
- multi start
- nature inspired
- variable neighborhood search
- feasible solution
- upper bound
- np hard
- evolutionary algorithm
- constraint satisfaction problems
- swarm intelligence
- job shop scheduling problem
- knapsack problem