Description

Book Synopsis

Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life.

This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties.

The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.



Table of Contents

1. Some Definitions.

2. Difficulty of the Difficulty.

3. Landscape Typology.

4. LandGener.

5. Test Cases.

6. Difficulty vs Dimension.

7. Exploitation and Exploration vs Difficulty.

8. The Explo2 Algorithm.

9. Balance and Perceived Difficulty.

Iterative Optimizers: Difficulty Measures and

    Product form

    A Hardback by Maurice Clerc

    £125.06

    Includes FREE delivery

    RRP £138.95 – you save £13.89 (9%)

    Order before 4pm today for delivery by Wed 4 Nov 2026.

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Iterative Optimizers: Difficulty Measures and by Maurice Clerc

      Book details

      Publisher ISTE Ltd and John Wiley & Sons Inc
      Published 12 April 2019
      ISBN-13 9781786304094
      978-1786304094
      ISBN-10 1786304090
      Also in:
      Algorithms and data structures

      Description

      Book Synopsis

      Almost every month, a new optimization algorithm is proposed, often accompanied by the claim that it is superior to all those that came before it. However, this claim is generally based on the algorithm's performance on a specific set of test cases, which are not necessarily representative of the types of problems the algorithm will face in real life.

      This book presents the theoretical analysis and practical methods (along with source codes) necessary to estimate the difficulty of problems in a test set, as well as to build bespoke test sets consisting of problems with varied difficulties.

      The book formally establishes a typology of optimization problems, from which a reliable test set can be deduced. At the same time, it highlights how classic test sets are skewed in favor of different classes of problems, and how, as a result, optimizers that have performed well on test problems may perform poorly in real life scenarios.



      Table of Contents

      1. Some Definitions.

      2. Difficulty of the Difficulty.

      3. Landscape Typology.

      4. LandGener.

      5. Test Cases.

      6. Difficulty vs Dimension.

      7. Exploitation and Exploration vs Difficulty.

      8. The Explo2 Algorithm.

      9. Balance and Perceived Difficulty.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account