@inproceedings{10.1007/11785231_113,
    abstract = "Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of information on the anticipated decisions that are beyond the immediate choice horizon. The ants solutions may contain redundant components which can be eliminated by a fine tuning after the solution, then we explore Post Processing procedures too, which consist in the identification and replacement of the columns of the ACO solution in each iteration by more effective columns. Computational results are presented showing the advantages to use additional mechanisms to Ant Colony Optimization. © Springer-Verlag Berlin Heidelberg 2006.",
    year = "2006",
    title = "Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems",
    volume = "4029 LNAI",
    pages = "1082-1090",
    doi = "10.1007/11785231\_113",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    author = "Crawford, Broderick and Castro, Carlos Ivan"
}

{"_id":"nCXBifTt7MRgMbeAS","bibbaseid":"crawford-castro-integratinglookaheadandpostprocessingprocedureswithacoforsolvingsetpartitioningandcoveringproblems-2006","downloads":0,"creationDate":"2017-04-03T15:16:25.635Z","title":"Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems","author_short":["Crawford, B.","Castro, C. I."],"year":2006,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of information on the anticipated decisions that are beyond the immediate choice horizon. The ants solutions may contain redundant components which can be eliminated by a fine tuning after the solution, then we explore Post Processing procedures too, which consist in the identification and replacement of the columns of the ACO solution in each iteration by more effective columns. Computational results are presented showing the advantages to use additional mechanisms to Ant Colony Optimization. © Springer-Verlag Berlin Heidelberg 2006.","year":"2006","title":"Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems","volume":"4029 LNAI","pages":"1082-1090","doi":"10.1007/11785231_113","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"propositions":[],"lastnames":["Crawford"],"firstnames":["Broderick"],"suffixes":[]},{"propositions":[],"lastnames":["Castro"],"firstnames":["Carlos","Ivan"],"suffixes":[]}],"bibtex":"@inproceedings{10.1007/11785231_113,\n abstract = \"Set Covering Problems and Set Partitioning Problems can model several real life situations. In this paper, we solve some benchmarks of them with Ant Colony Optimization algorithms and some hybridizations of Ant Colony Optimization with Constraint Programming techniques. A lookahead mechanism allows the incorporation of information on the anticipated decisions that are beyond the immediate choice horizon. The ants solutions may contain redundant components which can be eliminated by a fine tuning after the solution, then we explore Post Processing procedures too, which consist in the identification and replacement of the columns of the ACO solution in each iteration by more effective columns. Computational results are presented showing the advantages to use additional mechanisms to Ant Colony Optimization. © Springer-Verlag Berlin Heidelberg 2006.\",\n year = \"2006\",\n title = \"Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems\",\n volume = \"4029 LNAI\",\n pages = \"1082-1090\",\n doi = \"10.1007/11785231\\_113\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n author = \"Crawford, Broderick and Castro, Carlos Ivan\"\n}\n\n","author_short":["Crawford, B.","Castro, C. I."],"key":"10.1007/11785231_113","id":"10.1007/11785231_113","bibbaseid":"crawford-castro-integratinglookaheadandpostprocessingprocedureswithacoforsolvingsetpartitioningandcoveringproblems-2006","role":"author","urls":{},"downloads":0},"search_terms":["integrating","lookahead","post","processing","procedures","aco","solving","set","partitioning","covering","problems","crawford","castro"],"keywords":[],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}