Skip to main content
SpringerLink
Log in

Benchmarking for Discrete Cuckoo Search: Three Case Studies

  • Chapter
  • First Online:
Benchmarks and Hybrid Algorithms in Optimization and Applications

Part of the book series: Springer Tracts in Nature-Inspired Computing ((STNIC))

  • 128 Accesses

Abstract

Benchmarking is a tool that researchers use to start from the last progress made by others. It is also a degree of work transparency by making it reproducible and comparable. In this work, we will resume three resolution case studies of Discrete Cuckoo Search (DCS) with the aim of providing an algorithm benchmarking. The resolution case studies are three Combinatorial Optimization Problems (COPs): Quadratic Assignment (QAP), Travelling Salesman (TSP) and Job Shop Scheduling Problem (JSSP).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149–156

    Article  MATH  Google Scholar 

  2. Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manag Sci 44(2):262–275

    Article  MATH  Google Scholar 

  3. Bartz-Beielstein T, Doerr C, van den Berg D, Bossek J, Chandrasekaran S, Eftimov T, Fischbach A, Kerschke P, Cava WL, Lopez-Ibanez M, Malan KM, Moore JH, Naujoks B, Orzechowski P, Volz V, Wagner M, Weise T (2020) Benchmarking in optimization: best practice and open issues (2020)

    Google Scholar 

  4. Bazaraa MS, Sherali HD (1980) Benders’ partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res Log Q 27(1):29–41

    Article  MathSciNet  MATH  Google Scholar 

  5. Beasley JE (1990) Or-library: distributing test problems by electronic mail. J Oper Res Soci 41(11):1069–1072

    Article  Google Scholar 

  6. Beiranvand V, Hare W, Lucet Y (2017) Best practices for comparing optimization algorithms. Optim Eng 18(4):815–848. https://doi.org/10.1007/s11081-017-9366-1

    Article  MathSciNet  MATH  Google Scholar 

  7. Burkard R, Dell’Amico M, Martello S (2012) Assignment problems: revised reprint. SIAM

    Google Scholar 

  8. Burkard RE, Karisch SE, Rendl F (1997) Qaplib-a quadratic assignment problem library. J Glob Optim 10(4):391–403

    Article  MathSciNet  MATH  Google Scholar 

  9. Davendra D (2010) Traveling salesman problem. Theory and Applications, InTech

    Google Scholar 

  10. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  MathSciNet  MATH  Google Scholar 

  11. Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, vol 12. Springer

    Google Scholar 

  12. Herrmann JW (2006) Handbook of production scheduling, vol 89. Springer Science & Business Media

    Google Scholar 

  13. Lawler EL (1963) The quadratic assignment problem. Manag Sci 9(4):586–599

    Article  MathSciNet  MATH  Google Scholar 

  14. Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley Chicheste

    Google Scholar 

  15. Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. Oper Res Q 717–733

    Google Scholar 

  16. Manne AS (1960) On the job-shop scheduling problem. Oper Res 8(2):219–223

    Article  MathSciNet  Google Scholar 

  17. Ouaarab A (2020) Discrete Cuckoo search for combinatorial optimization. Springer

    Google Scholar 

  18. Ouaarab A, Ahiod B, Yang XS (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7–8):1659–1669

    Google Scholar 

  19. Ouaarab A, Ahiod B, Yang XS, Abbad M (2014) Discrete cuckoo search algorithm for job shop scheduling problem. In: 2014 IEEE international symposium on intelligent control (ISIC), pp 1872–1876. https://doi.org/10.1109/ISIC.2014.6967636

  20. Ouaarab A, Ahiod B, Yang XS, Abbad M (2015) Discrete cuckoo search for the quadratic assignment problem. In: 11th metaheuristics international conference

    Google Scholar 

  21. Reinelt G (1991) Tsplib-a traveling salesman problem library. ORSA J Comput 3(4):376–384

    Article  MATH  Google Scholar 

  22. Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4):443–455

    Article  MathSciNet  Google Scholar 

  23. Taillard E (1993) Benchmarks for basic scheduling problems. European J Oper Res 64(2):278–285

    Google Scholar 

  24. Yang XS (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, USA

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cadi Ayyad University, Marrakesh, Morocco

    Aziz Ouaarab

Authors
  1. Aziz Ouaarab
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aziz Ouaarab .

Editor information

Editors and Affiliations

  1. Department of Design Engineering and Mathematics, Middlesex University, London, UK

    Xin-She Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ouaarab, A. (2023). Benchmarking for Discrete Cuckoo Search: Three Case Studies. In: Yang, XS. (eds) Benchmarks and Hybrid Algorithms in Optimization and Applications. Springer Tracts in Nature-Inspired Computing. Springer, Singapore. https://doi.org/10.1007/978-981-99-3970-1_5

Download citation

Publish with us

Policies and ethics

Search

Navigation