Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem.
Daniel GuimaransRosa HerreroDaniel RieraAngel A. JuanJuan José RamosPublished in: RCRA@CPAIOR (2010)
Keyphrases
- constraint programming
- vehicle routing problem
- integer programming
- combinatorial problems
- lagrangian relaxation
- column generation
- search strategies
- metaheuristic
- traveling salesman problem
- constraint satisfaction
- computational complexity
- constraint satisfaction problems
- routing problem
- learning algorithm
- constraint propagation
- combinatorial optimization
- memetic algorithm
- benchmark problems
- tabu search
- worst case
- data structure
- mixed integer linear programs
- vehicle routing problem with time windows
- lower bound
- branch and bound algorithm
- lower and upper bounds
- optimization problems
- benchmark instances
- search heuristics
- np hard
- lagrangian dual