Ant Colony Optimization and Constraint Programming
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Product details
- ISBN 9781848211308
- Weight: 476g
- Dimensions: 155 x 236mm
- Publication Date: 13 Apr 2010
- Publisher: ISTE Ltd and John Wiley & Sons Inc
- Publication City/Country: GB
- Product Form: Hardback
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.
Christine Solnon is Associate Professor at the University of Lyon 1 and a member of the LIRIS laboratory. She is Vice- President of the AFPC; the French association for constraint programming.
