Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming.
Gerardo BerbegliaGilles PesantLouis-Martin RousseauPublished in: Transp. Sci. (2011)
Keyphrases
- constraint programming
- backtrack search
- propositional satisfiability
- combinatorial problems
- constraint propagation
- constraint satisfaction
- constraint satisfaction problems
- integer programming
- column generation
- global constraints
- finite domain
- constraint logic programming
- arc consistency
- search strategies
- symmetry breaking
- search heuristics
- itemset mining
- constraint problems
- randomly generated
- constraint solvers
- genetic algorithm
- hard and soft constraints
- graph coloring
- search procedures
- simulated annealing
- evolutionary algorithm