A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP).
Eric BourreauThierry GaraixMatthieu GondranPhilippe LacommeNikolay TchernevPublished in: Int. J. Prod. Res. (2022)
Keyphrases
- constraint programming
- decomposition method
- routing problem
- constraint satisfaction problems
- combinatorial problems
- vehicle routing problem
- constraint propagation
- search strategies
- scheduling problem
- constraint satisfaction
- global constraints
- integer programming
- shortest path
- routing algorithm
- hard and soft constraints
- arc consistency
- column generation
- search heuristics
- multicommodity flow
- traveling salesman problem
- finite domain
- travel time
- symmetry breaking
- heuristic search
- wireless sensor networks
- np hard
- moving objects