full screen
Metaheuristics for Finding Multiple Solutions

Metaheuristics for Finding Multiple Solutions


     0     
5
4
3
2
1



International Edition


About the Book

This book presents the latest trends and developments in multimodal optimization and niching techniques. Most existing optimization methods are designed for locating a single global solution. However, in real-world settings, many problems are "multimodal" by nature, i.e., multiple satisfactory solutions exist. It may be desirable to locate several such solutions before deciding which one to use. Multimodal optimization has been the subject of intense study in the field of population-based meta-heuristic algorithms, e.g., evolutionary algorithms (EAs), for the past few decades. These multimodal optimization techniques are commonly referred to as "niching" methods, because of the nature-inspired "niching" effect that is induced to the solution population targeting at multiple optima. Many niching methods have been developed in the EA community. Some classic examples include crowding, fitness sharing, clearing, derating, restricted tournament selection, speciation, etc. Nevertheless, applying these niching methods to real-world multimodal problems often encounters significant challenges.

To facilitate the advance of niching methods in facing these challenges, this edited book highlights the latest developments in niching methods. The included chapters touch on algorithmic improvements and developments, representation, and visualization issues, as well as new research directions, such as preference incorporation in decision making and new application areas. This edited book is a first of this kind specifically on the topic of niching techniques.

This book will serve as a valuable reference book both for researchers and practitioners. Although chapters are written in a mutually independent way, Chapter 1 will help novice readers get an overview of the field. It describes the development of the field and its current state and provides a comparative analysis of the IEEE CEC and ACM GECCO niching competitions of recent years, followed by a collection of open research questions and possible research directions that may be tackled in the future.


About the Author: Mike Preuss is Assistant Professor at LIACS, the computer science institute of Universiteit Leiden in the Netherlands. Previously, he was with the information systems institute of WWU Muenster, Germany (headquarter of ERCIS), and before with the Chair of Algorithm Engineering at TU Dortmund, Germany, where he received his PhD in 2013. His research interests focus on the field of evolutionary algorithms for real-valued problems, namely on multimodal and multiobjective optimization, and on computational intelligence methods for computer games, and their successful application to real-world problems as chemical retrosynthesis.

Xiaodong Li received his B.Sc. degree from Xidian University, Xi'an, China, and Ph.D. degree in information science from the University of Otago, Dunedin, New Zealand, respectively. Currently, he is a full professor in the School of Science (Computer Science and Software Engineering) of RMIT University, Melbourne, Australia. His research interests include evolutionary computation, machine learning, data analytics, multiobjective optimization, dynamic optimization, multimodal optimization, large-scale optimization, and swarm intelligence. He serves as an Associate Editor of the IEEE Transactions on Evolutionary Computation, Swarm Intelligence (Springer), and the International Journal of Swarm Intelligence Research. He is a founding member of the IEEE CIS Task Force on Swarm Intelligence, and a former Chair of the IEEE CIS Task Force on Large-Scale Global Optimization. He is currently a Vice-chair of the IEEE CIS Task Force on Multi-Modal Optimization. He is the recipient of the 2013 SIGEVO Impact Award and the 2017 IEEE CIS "IEEE Transactions on Evolutionary Computation Outstanding Paper Award".

Michael G. Epitropakis received his B.S., M.Sc., and Ph.D. degrees from the Department of Mathematics, University of Patras, Patras, Greece. Currently, he is a director of technical products in The Signal Group, Athens, Greece. Previously, he was an Assistant Professor in Data Science at Lancaster University, Lancaster, UK. His current research interests include operations research, computational intelligence, evolutionary computation, swarm intelligence, multi-modal optimization, machine learning, and search-based software engineering. He is a founding member of the IEEE CIS Task Force on Multi-Modal Optimization acting as Chair/Co-Chair from its foundation.

Jonathan E. Fieldsend is Professor of Computational Intelligence at the University of Exeter. He has a BA degree in Economics from Durham University, a Masters in Computational Intelligence from the University of Plymouth and a PhD in Computer Science from the University of Exeter. He has over 100 peer-reviewed publications in the evolutionary computation and machine learning domains, and on the interface between the two. He is a vice-chair of the IEEE Computational Intelligence Society (CIS) Task Forces on Multi-Modal Optimization, and on Data-Driven Evolutionary Optimization of Expensive Problems. He also sits on the IEEE CIS Task Force on Evolutionary Many-Objective Optimization. He is a member of the IEEE Computational Intelligence Society and the ACM SIGEVO.


Best Sellers



Product Details
  • ISBN-13: 9783030795559
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 315
  • Spine Width: 18 mm
  • Width: 156 mm
  • ISBN-10: 3030795551
  • Publisher Date: 24 Oct 2022
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Weight: 512 gr


Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Metaheuristics for Finding Multiple Solutions
Springer International Publishing -
Metaheuristics for Finding Multiple Solutions
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.

Metaheuristics for Finding Multiple Solutions

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 Booksbay (the "CRR Service").


    By submitting any content to Booksbay, 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 Booksbay (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 Booksbay 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,  Booksbay 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 Booksbay's sole discretion. Booksbay reserves the right to change, condense, withhold publication, remove or delete any content on Booksbay's website that Booksbay deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Booksbay does not guarantee that you will have any recourse through Booksbay to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Booksbay reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Booksbay, 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 Booksbay, 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

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!