Buy Ant Colony Optimization and Constraint Programming by Christine Solnon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Ant Colony Optimization and Constraint Programming
Ant Colony Optimization and Constraint Programming

Ant Colony Optimization and Constraint Programming


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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.

Table of Contents:
Foreword xi Acknowledgements xiii Chapter 1. Introduction 1 1.1. Overview of the book 2 Chapter 2. Computational Complexity 7 2.1. Complexity of an algorithm 8 2.2. Complexity of a problem 10 2.3. Where the most difficult instances can be found 15 2.4. Solving NP-hard problems in practice 21 PART I. CONSTRAINT PROGRAMMING 27 Introduction to Part I 29 Chapter 3. Constraint Satisfaction Problems 31 3.1. What is a constraint? 31 3.2. What is a constraint satisfaction problem? 33 3.3. Optimization problems related to CSPs 35 3.4. The n-queens problem 37 3.5. The stable marriage problem 43 3.6. Randomly generated binary CSPs 46 3.7. The car sequencing problem 47 3.8. Discussion 50 Chapter 4. Exact Approaches 53 4.1. Construction of a search tree 53 4.2. Constraint propagation 57 4.3. Ordering heuristics 60 4.4. From satisfaction to optimization problems 63 4.5. Discussion 65 Chapter 5. Perturbative Heuristic Approaches 69 5.1. Genetic algorithms 70 5.2. Local search 73 5.3. Particle swarm optimization 78 5.4. Discussion 80 Chapter 6. Constructive Heuristic Approaches 85 6.1. Greedy randomized approaches 86 6.2. Estimation of distribution algorithms 88 6.3. Ant colony optimization 90 6.4. Discussion 91 Chapter 7. Constraint Programming Languages 93 7.1. Constraint logic programming 94 7.2. Constraint programming libraries 96 7.3. Constraint-based local search 96 7.4. Discussion 99 PART II. ANT COLONY OPTIMIZATION 101 Introduction to Part II 103 Chapter 8. From Swarm Intelligence to Ant Colony Optimization 105 8.1. Complex systems and swarm intelligence 106 8.2. Searching for shortest paths by ant colonies 108 8.3. Ant system and the traveling salesman problem 111 8.4. Generic ACO framework 116 Chapter 9. Intensification versus Diversification 125 9.1. ACO mechanisms for intensifying the search 125 9.2. ACO mechanisms for diversifying the search 127 9.3. Balancing intensification and diversification 128 9.4. Measures of diversification/intensification 135 Chapter 10. Beyond Static Combinatorial Problems 141 10.1. Multi-objective problems 141 10.2. Dynamic optimization problems 145 10.3. Optimization problems over continuous domains 147 Chapter 11. Implementation Issues 151 11.1. Data structures 151 11.2. Selection of a component with respect to probabilities 154 11.3. Implementation of a local search procedure 157 11.4. Computation of diversification/intensification measures 157 PART III. CP WITH ACO 161 Introduction to Part III 163 Chapter 12. Sequencing Cars with ACO 165 12.1. Notation 165 12.2. A first pheromone structure for identifying good car sequences 166 12.3. A second pheromone structure for identifying critical cars 171 12.4. Combining the two pheromone structures 173 12.5. Comparison of the different ACO algorithms 174 12.6. Comparison of ACO with state-of-the-art approaches 178 12.7. Discussion 182 Chapter 13. Subset Selection with ACO 185 13.1. Subset selection problems 186 13.2. Description of Ant-SSP 189 13.3. Instantiations of Ant-SSP with respect to two pheromone strategies 192 13.4. Instantiation of Ant-SSP to solve CSPs 196 13.5. Experimental results 197 13.6. Discussion 202 Chapter 14. Integration of ACO in a CP Language 205 14.1. Framework for integrating ACO within a CP library 206 14.2. Illustration of ACO-CP on the car sequencing problem 210 14.3. Discussion 214 Chapter 15. Conclusion 215 15.1. Towards constraint-based ACO search 215 15.2. Towards a reactive ACO search 216 Bibliography 219 Index 231

About the Author :
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.

Review :
"In this volume, Solnon (U. of Lyon, France) introduces ant colony optimization and its application to a range of combinatorial problems, with a focus on constraint programming." (Book News, September 2010)


Best Sellers


Product Details
  • ISBN-13: 9781118618745
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: Wiley-ISTE
  • Language: English
  • ISBN-10: 1118618742
  • Publisher Date: 04 Mar 2013
  • Binding: Digital (delivered electronically)
  • No of Pages: 320


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Ant Colony Optimization and Constraint Programming
John Wiley & Sons Inc -
Ant Colony Optimization and Constraint Programming
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Ant Colony Optimization and Constraint Programming

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!