Ant Colony Optimization and Constraint ProgrammingAuthor(s): Christine Solnon\nFormat: Hardback\nPublisher: ISTE Ltd and John Wiley & Sons Inc, United Kingdom\nImprint: ISTE Ltd and John Wiley & Sons Inc\nISBN-13: 9781848211308, 978-1848211308\nSynopsis\nAnt 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 approaches and metaheuristics, and shows how they can be integrated within constraint programming languages.\n\n The second part describ.