02602nam 2200649 a 450 991081959710332120240313173744.01-118-55756-51-299-31543-71-118-61966-8(CKB)2560000000100624(EBL)1143621(OCoLC)830161655(SSID)ssj0000832662(PQKBManifestationID)11501378(PQKBTitleCode)TC0000832662(PQKBWorkID)10900229(PQKB)10228014(MiAaPQ)EBC1143621(Au-PeEL)EBL1143621(CaPaEBR)ebr10671498(CaONFJC)MIL462793(EXLCZ)99256000000010062420091218d2010 uy 0engur|n|---|||||txtccrAnt colony optimization and constraint programming[electronic resource] /Christine Solnon1st ed.London ISTE ;Hoboken, N.J. Wiley20101 online resource (248 p.)ISTEDescription based upon print version of record.1-84821-130-9 Includes bibliographical references (p. 219-230) and index.pt. 1. Constraint programming -- pt. 2. Ant colony optimization -- pt. 3. CP with ACO.Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search ISTEConstraint programming (Computer science)Mathematical optimizationSwarm intelligenceAnt algorithmsConstraint programming (Computer science)Mathematical optimization.Swarm intelligence.Ant algorithms.005.1/16Solnon Christine1687761MiAaPQMiAaPQMiAaPQBOOK9910819597103321Ant colony optimization and constraint programming4061488UNINA