Ant Colony Optimization and Constraint Programming



de

Éditeur :

Wiley-ISTE


Paru le : 2013-03-04



eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
164,53

Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

Description
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.
Pages
320 pages
Collection
n.c
Parution
2013-03-04
Marque
Wiley-ISTE
EAN papier
9781848211308
EAN PDF
9781118619667

Informations sur l'ebook
Nombre pages copiables
0
Nombre pages imprimables
320
Taille du fichier
3604 Ko
Prix
164,53 €
EAN EPUB
9781118618899

Informations sur l'ebook
Nombre pages copiables
0
Nombre pages imprimables
320
Taille du fichier
1802 Ko
Prix
164,53 €

Suggestions personnalisées