A new variant of a vehicle routing problem: Lower and upper bounds.
Holger GlaabPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- vehicle routing problem
- lower and upper bounds
- lower bound
- upper bound
- metaheuristic
- tabu search
- np hard
- vehicle routing problem with time windows
- routing problem
- vehicle routing
- benchmark problems
- hybrid metaheuristic
- combinatorial optimization
- memetic algorithm
- traveling salesman problem
- test instances
- travel time
- particle swarm optimization
- lagrangian relaxation
- search strategies
- simulated annealing
- optimal solution
- genetic algorithm
- itemsets
- evolutionary algorithm
- scheduling problem
- branch and bound algorithm
- information retrieval
- variable neighborhood search
- pick up and delivery
- knapsack problem
- feasible solution
- language model
- cost function