Using Randomization to Solve the Deterministic Single and Multiple Vehicle Routing Problem with Service Time Constraints.
Jairo R. Montoya-TorresEdgar H. Alfonso LizarazoEdgar Gutierrez-FrancoAna X. HalabiPublished in: WSC (2009)
Keyphrases
- vehicle routing problem
- pick up and delivery
- vehicle routing
- tabu search
- routing problem
- metaheuristic
- vehicle routing problem with simultaneous
- vehicle routing problem with time windows
- combinatorial optimization
- benchmark instances
- benchmark problems
- hybrid metaheuristic
- travel time
- test instances
- np hard
- knapsack problem
- genetic algorithm
- traveling salesman problem
- constraint satisfaction problems
- particle swarm optimization
- simulated annealing
- logistics distribution
- cost function