Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem.
Daniel GuimaransRosa HerreroDaniel RieraAngel A. JuanJuan José RamosPublished in: Ann. Math. Artif. Intell. (2011)
Keyphrases
- constraint programming
- vehicle routing problem
- integer programming
- combinatorial problems
- lagrangian relaxation
- column generation
- constraint satisfaction problems
- metaheuristic
- combinatorial optimization
- np hard
- search strategies
- constraint propagation
- benchmark problems
- mixed integer linear programs
- benchmark instances
- constraint satisfaction
- learning algorithm
- branch and bound algorithm
- tabu search
- global constraints
- search heuristics
- integer program
- cutting plane
- heuristic search
- worst case
- dynamic programming
- lower bound
- computational complexity
- vehicle routing problem with time windows
- neural network
- lagrangian dual
- data structure
- search algorithm
- routing problem
- traveling salesman problem