Ant colony optimization and constraint programming /

Ant colony optimization is a metaheuristic - or very generally a form of "black-box" problem-solving algorithm - which has been successfully applied to a wide range of combinatorial optimization problems. This book describes the ant colony metaheuristic and examines its efficacy for solvin...

Full description

Bibliographic Details
Main Author: Solnon, Christine
Format: eBook
Language:English
Language Notes:English.
Published: London : Hoboken, NJ : ISTE ; Wiley, 2010.
Series:ISTE.
Subjects:
Online Access:Connect to the full text of this electronic book
Description
Summary:Ant colony optimization is a metaheuristic - or very generally a form of "black-box" problem-solving algorithm - which has been successfully applied to a wide range of combinatorial optimization problems. This book describes the ant colony metaheuristic and examines its efficacy for solving some difficult combinatorial problems, with a specific focus on constraint programming. The book 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. The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. Finally, the third part shows how the ant colony metaheuristic may be integrated within a constraint programming language, thereby combining the expressive power of constraint programming languages to describe problems in a declarative way, and the solving power of ant colony optimization, as a means of efficiently solving these problems.
Physical Description:1 online resource (xiii, 232 pages) : illustrations
Bibliography:Includes bibliographical references and index.
ISBN:9781118557563
1118557565
9781118619667
1118619668
1299315437
9781299315433