On the Vehicle Routing Problem with lower bound capacities.
Luis Eduardo Neves GouveiaJuan José Salazar GonzálezPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- vehicle routing problem
- lower bound
- np hard
- upper bound
- metaheuristic
- branch and bound algorithm
- routing problem
- optimal solution
- combinatorial optimization
- tabu search
- benchmark problems
- vehicle routing
- test instances
- vehicle routing problem with time windows
- travel time
- hybrid metaheuristic
- branch and bound
- objective function
- traveling salesman problem
- memetic algorithm
- benchmark instances
- lower and upper bounds
- knapsack problem
- worst case
- multi depot
- logistics distribution
- scheduling problem
- search strategies
- iterated local search
- lagrangian relaxation
- particle swarm optimization
- integer programming
- max sat
- neural network
- vehicle routing problem with simultaneous
- simulated annealing
- search space
- data structure
- variable neighborhood search
- special case
- optimization problems
- np complete
- greedy randomized adaptive search procedure
- constraint programming