Skip to main content
SpringerLink
Log in
Book cover

Discrete Cuckoo Search for Combinatorial Optimization pp 1–7Cite as

Introduction

  • Chapter
  • First Online:

  • 292 Accesses

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

Abstract

The need to optimize, plan, or make decisions in real time is everywhere, even in our daily lives. At all moments and situations, we are obliged to make a decision among many options. The problem is that sometimes our decision depends on a multitude of parameters and constraints, which makes the verification of all possible choices more difficult. Replacing the decision-making context of our daily lives by that of large companies and mega-industries makes gains and losses increase proportionally. Dealing with these optimization problems is done by using a variety of methods that perform different tools.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.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

Learn about institutional subscriptions

References

  • Arora S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press

    Google Scholar 

  • Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv (CSUR) 35(3):268–308

    Article  Google Scholar 

  • Chen H, Li S, Tang Z (2011) Hybrid gravitational search algorithm with random-key encoding scheme combined with simulated annealing. Int J Comput Sci Netw Secur 11:208–217

    Google Scholar 

  • Debels D, De Reyck B, Leus R, Vanhoucke M (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169(2):638–653

    Article  MathSciNet  Google Scholar 

  • Gandomi AH, Talatahari S, Yang X-S, Deb S (2012) Design optimization of truss structures using cuckoo search algorithm. In: The structural design of tall and special buildings

    Google Scholar 

  • Gandomi AH, Yang X-S, Alavi AH (2011) Mixed variable structural optimization using firefly algorithm. Comput Struct 89(23–24):2325–2336

    Article  Google Scholar 

  • Gherboudj A, Layeb A, Chikhi S (2012) Solving 0–1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int J Bio-Inspired Comput 4(4):229–236

    Article  Google Scholar 

  • Glover F, Kochenberger GA (2003) Handbook of metaheuristics. Springer

    Google Scholar 

  • Gomez A, Gonzalez R, Parreo J, Pino R (2006) A particle swarm-based metaheuristic to solve the travelling salesman problem. In: International conference on artificial intelligence, pp 698–702

    Google Scholar 

  • Huilian F (2010) Discrete particle swarm optimization for TSP based on neighborhood. J Comput Inf Syst 6(10):3407–3414

    Google Scholar 

  • Jati GK et al (2011) Evolutionary discrete firefly algorithm for travelling salesman problem. Springer

    Google Scholar 

  • Lin T-L, Horng S-J, Kao T-W, Chen Y-H, Run R-S, Chen R-J, Lai J-L, Kuo I-H (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37(3):2629–2636

    Article  Google Scholar 

  • Luo Q, Zhou Y, Xie J, Ma M, Li L (2014) Discrete bat algorithm for optimal problem of permutation flow shop scheduling. Sci World J

    Google Scholar 

  • Marichelvam MK, Prabaharan T, Yang XS (2013) A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans Evol Comput 18(2):301–305

    Article  Google Scholar 

  • Osaba E, Yang X-S, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59–71

    Article  Google Scholar 

  • Osaba E, Yang X-S, Diaz F, Onieva E, Masegosa AD, Perallos A (2017) A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Comput 21(18):5295–5308

    Article  Google Scholar 

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

    Google Scholar 

  • Ouaarab A, Ahiod B, Yang X-S (2014b) Improved and discrete cuckoo search for solving the travelling salesman problem. In: Yang X-S (ed) Cuckoo search and firefly algorithm. Studies in computational intelligence, vol 516. Springer International Publishing, pp 63–84

    Google Scholar 

  • Ouaarab A, Ahiod B, Yang X-S, Abbad M (2014c) Discrete cuckoo search algorithm for job shop scheduling problem. In: 2014 IEEE international symposium on intelligent control (ISIC), pp 1872–1876

    Google Scholar 

  • Ouaarab A, Ahiod B, Yang X-S (2015a) Discrete cuckoo search applied to job shop scheduling problem. In: Yang X-S (ed) Recent advances in swarm intelligence and evolutionary computation. Studies in computational intelligence, vol 585. Springer International Publishing, pp 121–137

    Google Scholar 

  • Ouaarab A, Ahiod B, Yang X-S (2015b) Random-key cuckoo search for the travelling salesman problem. Soft Comput 19(4):1099–1106

    Google Scholar 

  • Ouaarab A, Ahiod B, Yang X-S, Abbad M (2015c) Discrete cuckoo search for the quadratic assignment problem. In: 11th metaheuristics international conference

    Google Scholar 

  • Ouaarab A, Ahiod B, Yang X-S, Abbad M (2015d) Random-key cuckoo search for the quadratic assignment problem (submitted). Nat Comput

    Google Scholar 

  • Ouyang X, Zhou Y, Luo Q, Chen H (2013) A novel discrete cuckoo search algorithm for spherical traveling salesman problem. Appl Math Inf Sci 7(2)

    Google Scholar 

  • Rao RV, Savsani VJ, Vakharia D (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315

    Article  Google Scholar 

  • Sayadi MK, Hafezalkotob A, Naini SGJ (2013) Firefly-inspired algorithm for discrete optimization problems: an application to manufacturing cell formation. J Manuf Syst 32(1):78–84

    Article  Google Scholar 

  • Stützle T, Hoos HH (2000) Max-min ant system. Futur Gener Comput Syst 16(8):889–914

    Article  Google Scholar 

  • Van Laarhoven PJ, Aarts EH (1987) Simulated annealing. Springer

    Google Scholar 

  • Wang L, Pan J, Jiao L (2000) The immune algorithm. Acta Electron Sin 28(7):74–78

    Google Scholar 

  • Yang X-S (2009) Firefly algorithm, lvy flights and global optimization, pp 209–218

    Google Scholar 

  • Yang X-S, Cui Z, Xiao R, Gandomi AH, Karamanoglu M (2013) Swarm intelligence and bio-inspired computation: theory and applications. Newnes

    Google Scholar 

  • Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature and biologically inspired computing, 2009. NaBIC 2009. IEEE, pp 210–214

    Google Scholar 

  • Yang X-S, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464–483

    Article  Google Scholar 

  • Zhong W, Zhang J, Chen W (2007) A novel discrete particle swarm optimization to solve traveling salesman problem. In: IEEE congress on evolutionary computation, 2007. CEC 2007. IEEE, pp 3283–3287

    Google Scholar 

  • Zhou X, Zhao X, Liu Y (2018) A multiobjective discrete bat algorithm for community detection in dynamic networks. Appl Intell 48(9):3081–3093

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Supérieure de Technologie d’Essaouira, Essaouira, 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 .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ouaarab, A. (2020). Introduction. In: Discrete Cuckoo Search for Combinatorial Optimization. Springer Tracts in Nature-Inspired Computing. Springer, Singapore. https://doi.org/10.1007/978-981-15-3836-0_1

Download citation

Publish with us

Policies and ethics

Search

Navigation