A variable neighbourhood search combining constraint programming and Lagrangean relaxation for solving routing problems.
Rosa HerreroDaniel GuimaransJuan José RamosSilvia PadrónPublished in: SummerSim (2010)
Keyphrases
- constraint programming
- lagrangean relaxation
- column generation
- routing problem
- integer program
- search heuristics
- combinatorial problems
- constraint propagation
- constraint satisfaction
- integer programming
- constraint satisfaction problems
- vehicle routing problem
- combinatorial optimization
- search strategies
- linear programming relaxation
- mixed integer programming
- cutting plane
- traveling salesman problem
- shortest path
- linear programming
- routing algorithm
- search procedures
- travel time
- lagrangian relaxation
- upper bound
- multi objective
- linear program
- genetic algorithm
- valid inequalities
- reinforcement learning