A Lower Bound for the Split Delivery Vehicle Routing Problem.
José-Manuel BelenguerM. C. MartinezE. MotaPublished in: Oper. Res. (2000)
Keyphrases
- vehicle routing problem
- lower bound
- vehicle routing problem with simultaneous
- np hard
- upper bound
- metaheuristic
- routing problem
- branch and bound algorithm
- benchmark problems
- optimal solution
- tabu search
- vehicle routing
- test instances
- vehicle routing problem with time windows
- pick up and delivery
- branch and bound
- traveling salesman problem
- travel time
- benchmark instances
- lower and upper bounds
- objective function
- combinatorial optimization
- hybrid metaheuristic
- worst case
- multi depot
- memetic algorithm
- logistics distribution
- knapsack problem
- lagrangian relaxation
- simulated annealing
- particle swarm optimization
- integer programming
- approximation algorithms
- linear programming
- max sat
- scheduling problem
- variable neighborhood search
- search strategies
- np complete
- scatter search
- dynamic programming
- evolutionary algorithm
- single machine
- reinforcement learning