A heuristic and lower bound for a multi-depot routing problem.
Robert T. SumichrastIna S. MarkhamPublished in: Comput. Oper. Res. (1995)
Keyphrases
- multi depot
- routing problem
- lower bound
- vehicle routing problem with time windows
- vehicle routing problem
- upper bound
- np hard
- branch and bound algorithm
- branch and bound
- routing algorithm
- shortest path
- optimal solution
- travel time
- lower and upper bounds
- traveling salesman problem
- worst case
- linear programming relaxation
- global optimization
- scheduling problem
- np complete
- neural network
- max sat
- objective function
- genetic algorithm