1.

Record Nr.

UNINA9910819597103321

Autore

Solnon Christine

Titolo

Ant colony optimization and constraint programming [[electronic resource] /] / Christine Solnon

Pubbl/distr/stampa

London, : ISTE

Hoboken, N.J., : Wiley, 2010

ISBN

1-118-55756-5

1-299-31543-7

1-118-61966-8

Edizione

[1st ed.]

Descrizione fisica

1 online resource (248 p.)

Collana

ISTE

Disciplina

005.1/16

Soggetti

Constraint programming (Computer science)

Mathematical optimization

Swarm intelligence

Ant algorithms

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references (p. 219-230) and index.

Nota di contenuto

pt. 1. Constraint programming -- pt. 2. Ant colony optimization -- pt. 3. CP with ACO.

Sommario/riassunto

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