New upper bounds for the multi-depot capacitated arc routing problem.
Ali KansouAdnan YassinePublished in: Int. J. Metaheuristics (2010)
Keyphrases
- multi depot
- upper bound
- lower bound
- routing problem
- lower and upper bounds
- vehicle routing problem with time windows
- scheduling problem
- vehicle routing problem
- valid inequalities
- np hard
- branch and bound
- worst case
- upper and lower bounds
- memetic algorithm
- branch and bound algorithm
- lagrangian relaxation
- column generation
- benchmark problems
- travel time
- tabu search
- metaheuristic
- objective function
- routing algorithm
- exact algorithms
- cutting plane
- optimal solution
- traveling salesman problem
- shortest path
- particle swarm optimization
- linear programming
- optimization problems