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 ...
Read More
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.
Read Less
Add this copy of Ant Colony Optimization and Constraint Programming to cart. $204.49, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2010 by Wiley-Iste.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Paper over boards. 320 p. Contains: Figures. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Ant Colony Optimization and Constraint Programming to cart. $204.50, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2010 by Wiley-Iste.
Add this copy of Ant Colony Optimization and Constraint Programming to cart. $227.54, new condition, Sold by Kennys.ie rated 4.0 out of 5 stars, ships from Galway, IRELAND, published 2010 by Wiley-Iste.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. 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. Num Pages: 246 pages, Illustrations. BIC Classification: UM. Category: (P) Professional & Vocational. Dimension: 234 x 163 x 19. Weight in Grams: 506. 2010. 1st Edition. Hardcover.....We ship daily from our Bookshop.
Add this copy of Ant Colony Optimization and Constraint Programming to cart. $239.21, new condition, Sold by Revaluation Books rated 4.0 out of 5 stars, ships from Exeter, DEVON, UNITED KINGDOM, published 2010 by Iste/Hermes Science Pub.
