@inproceedings{55849139864,
    abstract = "In this paper, we focus on the resolution of Set Partitioning Problem. We try to solve it with Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques. We recognize the difficulties of pure Ant Algorithms solving strongly constrained problems. Therefore, we explore the addition of Constraint Programming mechanisms in the construction phase of the ants so they can complete their solutions. Computational results solving some test instances are presented showing the advantages to use this kind of hybridization.",
    number = "DPS/KE/-",
    year = "2008",
    title = "Constraint programming can help ants solving highly constrainted combinatorial problems",
    volume = "PL",
    pages = "380-383",
    journal = "ICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies"
}

{"_id":"vb5wHqWhCquM5m2N9","bibbaseid":"anonymous-constraintprogrammingcanhelpantssolvinghighlyconstraintedcombinatorialproblems-2008","downloads":0,"creationDate":"2017-03-31T20:15:32.854Z","title":"Constraint programming can help ants solving highly constrainted combinatorial problems","author_short":null,"year":2008,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"In this paper, we focus on the resolution of Set Partitioning Problem. We try to solve it with Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques. We recognize the difficulties of pure Ant Algorithms solving strongly constrained problems. Therefore, we explore the addition of Constraint Programming mechanisms in the construction phase of the ants so they can complete their solutions. Computational results solving some test instances are presented showing the advantages to use this kind of hybridization.","number":"DPS/KE/-","year":"2008","title":"Constraint programming can help ants solving highly constrainted combinatorial problems","volume":"PL","pages":"380-383","journal":"ICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies","bibtex":"@inproceedings{55849139864,\n abstract = \"In this paper, we focus on the resolution of Set Partitioning Problem. We try to solve it with Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques. We recognize the difficulties of pure Ant Algorithms solving strongly constrained problems. Therefore, we explore the addition of Constraint Programming mechanisms in the construction phase of the ants so they can complete their solutions. Computational results solving some test instances are presented showing the advantages to use this kind of hybridization.\",\n number = \"DPS/KE/-\",\n year = \"2008\",\n title = \"Constraint programming can help ants solving highly constrainted combinatorial problems\",\n volume = \"PL\",\n pages = \"380-383\",\n journal = \"ICSOFT 2008 - Proceedings of the 3rd International Conference on Software and Data Technologies\"\n}\n\n","key":"55849139864","id":"55849139864","bibbaseid":"anonymous-constraintprogrammingcanhelpantssolvinghighlyconstraintedcombinatorialproblems-2008","urls":{},"downloads":0,"html":""},"search_terms":["constraint","programming","help","ants","solving","highly","constrainted","combinatorial","problems"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}