CP with ACO
Résumé
We describe how the Car Sequencing problem may be modeled and solved using a blend of Constraint Programming (CP) and Ant Colony Optimization (ACO): a CP language is used to model the problem in a declarative way, but the classical backtrack and propagate search is replaced by an ACO search combined with constraint propagation.
Domaines
Informatique [cs]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...