Login

Solnon, Christine

Ant Colony Optimization and Constraint Programming

Solnon, Christine - Ant Colony Optimization and Constraint Programming, ebook

DRM Restrictions

Printing30 pages with an additional page accrued every day, capped at 30 pages
Copy to clipboard5 excerpts

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 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.
The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.

Keywords: foreword; xi book; overview; algorithm; problem; instances; difficult; practice part; nphard problems; introduction; part; programming; constraint; satisfaction; problems; stable; binary

Author(s)
Publisher
John Wiley and Sons, Inc.
Publication year
2010
Language
en
Edition
1
Series
ISTE
Page amount
320 pages
Category
Information Technology, Telecommunications
Format
Ebook
eISBN (ePUB)
9781118618899
Printed ISBN
9781848211308

Similar titles