Ant Colony Optimization and Constraint Programming

Beschreibung

Ant colony optimization is a metaheuristic which has beensuccessfully applied to a wide range of combinatorial optimizationproblems. The author describes this metaheuristic and studies itsefficiency for solving some hard combinatorial problems, with aspecific focus on constraint programming. The text is organizedinto three parts. The first part introduces constraint programming, which provideshigh level features to declaratively model problems by means ofconstraints. It describes the main existing approaches for solvingconstraint satisfaction problems, including complete tree searchapproaches and metaheuristics, and shows how they can be integratedwithin constraint programming languages. The second part describes the ant colony optimizationmetaheuristic and illustrates its capabilities on differentconstraint satisfaction problems. The third part shows how the ant colony may be integrated within aconstraint programming language, thus combining the expressivepower of constraint programming languages, to describe problems ina declarative way, and the solving power of ant colony optimizationto efficiently solve these problems.

Autor*in

Christine Solnon

Themen in »Ant Colony Optimization and Constraint Programming«

Computer Science Informatik Programmierung (EDV) Programmierung u. Software-Entwicklung Programming & Software Development

Stimmen zu »Ant Colony Optimization and Constraint Programming«

"In this volume, Solnon (U. of Lyon, France) introduces ant colonyoptimization and its application to a range of combinatorialproblems, with a focus on constraint programming." (BookNews, September 2010)
()

Details

Link teilen