Improved lower bounds for the Split Delivery Vehicle Routing Problem.
Lorenza MorenoMarcus Poggi de AragãoEduardo UchoaPublished in: Oper. Res. Lett. (2010)
Keyphrases
- vehicle routing problem
- lower bound
- vehicle routing problem with simultaneous
- np hard
- metaheuristic
- benchmark problems
- tabu search
- vehicle routing
- combinatorial optimization
- upper bound
- routing problem
- traveling salesman problem
- travel time
- pick up and delivery
- hybrid metaheuristic
- objective function
- branch and bound
- logistics distribution
- test instances
- branch and bound algorithm
- simulated annealing
- vehicle routing problem with time windows
- optimal solution
- memetic algorithm
- benchmark instances
- optimization problems
- variable neighborhood search
- evolutionary algorithm
- multi depot
- lower and upper bounds
- knapsack problem
- particle swarm optimization
- data structure