Exact algorithms for routing problems under vehicle capacity constraints.
Roberto BaldacciPaolo TothDaniele VigoPublished in: Ann. Oper. Res. (2010)
Keyphrases
- exact algorithms
- capacity constraints
- routing problem
- minimum cost
- approximation algorithms
- vehicle routing problem with time windows
- knapsack problem
- bicriteria
- vehicle routing problem
- network flow
- lagrangian relaxation
- np hard
- combinatorial optimization
- exact solution
- combinatorial optimization problems
- traveling salesman problem
- routing algorithm
- heuristic methods
- single item
- shortest path
- depth first search
- combinatorial problems
- lower bound
- max sat
- travel time
- special case
- tabu search
- worst case
- optimal solution
- multi objective
- genetic algorithm
- benchmark problems
- routing protocol
- optimization problems
- dynamic programming