Handbook of Metaheuristic Algorithms
eBook - ePub

Handbook of Metaheuristic Algorithms

From Fundamental Theories to Advanced Applications

  1. 622 pages
  2. English
  3. ePUB (mobile friendly)
  4. Only available on web
eBook - ePub

Handbook of Metaheuristic Algorithms

From Fundamental Theories to Advanced Applications

Book details
Table of contents
Citations

About This Book

Handbook of Metaheuristic Algorithms: From Fundamental Theories to Advanced Applications provides a brief introduction to metaheuristic algorithms from the ground up, including basic ideas and advanced solutions. Although readers may be able to find source code for some metaheuristic algorithms on the Internet, the coding styles and explanations are generally quite different, and thus requiring expanded knowledge between theory and implementation. This book can also help students and researchers construct an integrated perspective of metaheuristic and unsupervised algorithms for artificial intelligence research in computer science and applied engineering domains.

Metaheuristic algorithms can be considered the epitome of unsupervised learning algorithms for the optimization of engineering and artificial intelligence problems, including simulated annealing (SA), tabu search (TS), genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), differential evolution (DE), and others. Distinct from most supervised learning algorithms that need labeled data to learn and construct determination models, metaheuristic algorithms inherit characteristics of unsupervised learning algorithms used for solving complex engineering optimization problems without labeled data, just like self-learning, to find solutions to complex problems.

  • Presents a unified framework for metaheuristics and describes well-known algorithms and their variants
  • Introduces fundamentals and advanced topics for solving engineering optimization problems, e.g., scheduling problems, sensors deployment problems, and clustering problems
  • Includes source code based on the unified framework for metaheuristics used as examples to show how TS, SA, GA, ACO, PSO, DE, parallel metaheuristic algorithm, hybrid metaheuristic, local search, and other advanced technologies are realized in programming languages such as C++ and Python

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Handbook of Metaheuristic Algorithms by Chun-Wei Tsai,Ming-Chao Chiang in PDF and/or ePUB format, as well as other popular books in Computer Science & Computer Science General. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Cover image
  2. Title page
  3. Table of Contents
  4. Copyright
  5. Dedication
  6. List of figures
  7. List of tables
  8. List of algorithms
  9. List of listings
  10. About the authors
  11. Preface
  12. Part One: Fundamentals
  13. Chapter One: Introduction
  14. Chapter Two: Optimization problems
  15. Chapter Three: Traditional methods
  16. Chapter Four: Metaheuristic algorithms
  17. Chapter Five: Simulated annealing
  18. Chapter Six: Tabu search
  19. Chapter Seven: Genetic algorithm
  20. Chapter Eight: Ant colony optimization
  21. Chapter Nine: Particle swarm optimization
  22. Chapter Ten: Differential evolution
  23. Part Two: Advanced technologies
  24. Chapter Eleven: Solution encoding and initialization operator
  25. Chapter Twelve: Transition operator
  26. Chapter Thirteen: Evaluation and determination operators
  27. Chapter Fourteen: Parallel metaheuristic algorithm
  28. Chapter Fifteen: Hybrid metaheuristic and hyperheuristic algorithms
  29. Chapter Sixteen: Local search algorithm
  30. Chapter Seventeen: Pattern reduction
  31. Chapter Eighteen: Search economics
  32. Chapter Nineteen: Advanced applications
  33. Chapter Twenty: Conclusion and future research directions
  34. Appendix A: Interpretations and analyses of simulation results
  35. Appendix B: Implementation in Python
  36. References
  37. Index