|
|
 |
|
Viewing report
|
|
|
|
Ant Colony Optimization and Constraint Programming
John Wiley and Sons Ltd, April 2010, Pages: 320
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.
Customers who bought this item also bought
Evolutionary Computing in Advanced Manufacturing
Scheduling Practices for Turnarounds and Shutdowns Best Practices and Potentials
Applied Mechanics and Manufacturing Technology
SAMPLE PREP 2011 - Sample Preparation for Virus, Toxin & Pathogen Detection & Identification Conference Proceedings
Knowing the Customer Pays
European Market for Integrated Motors and Drives
Winding: Machines, Mechanics and Measurements
Trends in Green Manufacturing for Electronics
Power Generation Industry
Vietnam Logistics 2009
|
|
|
|
