Bounds and Heuristics for the Shortest Capacitated Paths Problem.
Marie-Christine CostaAlain HertzMichel MittazPublished in: J. Heuristics (2002)
Keyphrases
- shortest path
- path length
- upper bound
- routing problem
- lower bound
- worst case analysis
- heuristic search
- lot sizing
- single source
- worst case
- lower and upper bounds
- heuristic solution
- path finding
- multi item
- multi source
- facility location
- multi period
- error bounds
- average case
- network design problem
- np hard
- capacity constraints
- search algorithm
- branch and bound search
- vehicle routing problem with stochastic demands
- shortest path problem
- optimal path
- vehicle routing problem
- search strategies
- road network
- branch and bound
- heuristic methods
- approximation algorithms
- special case
- multi commodity
- confidence bounds
- genetic algorithm