Abstract
Combinatorial optimization problems, specially those that are NP-hard, are increasingly being dealt with by stochastic, metaheuristic approaches. Most recently developed metaheuristics are nature-inspired and they are often inspired by some special characteristics in evolution, ecological or biological systems. This chapter discusses how to go from a biological phenomenon such as the aggressive reproduction strategy of cuckoos to solve tough problems in the combinatorial search space. Key features and steps are highlighted, together with the discussions of further research topics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
Bak, P.: How Nature Works: The Science of Self-organized Criticality. Springer Science & Business Media (2013)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35(3), 268–308 (2003)
Briers, R.: Ecology: from individuals to ecosystems. Freshwater Biol. 51(9), 1787–1788 (2006)
Brown, C.T., Liebovitch, L.S., Glendon, R.: Lévy flights in dobe ju/hoansi foraging patterns. Human Ecol. 35(1), 129–138 (2007)
Burnwal, S., Deb, S.: Scheduling optimization of flexible manufacturing system using cuckoo search-based approach. Int. J. Adv. Manuf. Technol. 64(5–8), 951–959 (2013)
Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)
Davies, N., Brooke, M.D.L.: An experimental study of co-evolution between the cuckoo, cuculus canorus, and its hosts. ii. host egg markings, chick discrimination and general discussion. J. Anim. Ecol. 225–236 (1989)
Dejam, S., Sadeghzadeh, M., Mirabedini, S.J.: Combining cuckoo and tabu algorithms for solving quadratic assignment problems. J. Acad. Appl. Stud. 2(12), 1–8 (2012)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to np-completeness (1979)
Garnier, S., Gautrais, J., Theraulaz, G.: The biological principles of swarm intelligence. Swarm Intell. 1(1), 3–31 (2007)
Gherboudj, A., Layeb, A., Chikhi, S.: Solving 0–1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int. J. Bio-Inspir. Comput. 4(4), 229–236 (2012)
Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer Science & Business Media (2003)
Glover, F., Laguna, M: Tabu Search. Springer (2013)
Hall, B. et al.: Strickberger’s Evolution. Jones & Bartlett Learning (2008)
Jones,C.G., Lawton, J.H., Shachak, M.: Organisms as ecosystem engineers. In Ecosystem Management, pp. 130–147. Springer (1996)
Kanagaraj, G., Ponnambalam, S., Jawahar, N.: A hybrid cuckoo search and genetic algorithm for reliability-redundancy allocation problems. Comput. Ind. Eng. 66(4), 1115–1124 (2013)
Kennedy, J., Kennedy, J.F., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann (2001)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., et al.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9(4), 586–599 (1963)
Lawler, E.L.: The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-interscience series in discrete mathematics (1985)
Lin, T.-L., Horng, S.-J., Kao, T.-W., Chen, Y.-H., Run, R.-S., Chen, R.-J., Lai, J.-L., Kuo, I.-H.: An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst. Appl. 37(3), 2629–2636 (2010)
Lozano, M., GarcÃa-MartÃnez, C.: Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report. Comput. Oper. Res. 37(3), 481–497 (2010)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley (1990)
Martin, O., Otto, S.W., Felten, E.W.: Large-step markov chains for the traveling salesman problem. Complex Syst. 5(3), 299–326 (1991)
Neumann, F., Witt, C: Minimum Spanning Trees. Springer (2010)
Ouaarab, A., Ahiod, B., Yang, X.-S.: Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput. Appl. 24(7–8), 1659–1669 (2014)
Ouaarab, A., Ahiod, B., Yang, X.-S.: Improved and discrete cuckoo search for solving the travelling salesman problem. In: Cuckoo Search and Firefly Algorithm, pp. 63–84. Springer (2014)
Ouaarab, A., Ahiod, B., Yang, X.-S.: Discrete cuckoo search applied to job shop scheduling proble. In: Recent Advances in Swarm Intelligence and Evolutionary Computation, pp. 121–137. Springer (2015)
Ouaarab, A., Ahiod, B., Yang, X.-S., Abbad, M.: Discrete cuckoo search algorithm for job shop scheduling problem. In: IEEE International Symposium on Intelligent Control (ISIC), 2014, pp. 1872–1876. IEEE (2014)
Ouaarab, A., Ahiod, B., Yang, X.-S., Abbad, M.: Discrete cuckoo search for the quadratic assignment problem. In: The XI Metaheuristics International Conference (2015)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation (1998)
Parker, R.G., Rardin, R.L.: Discrete Optimization. Elsevier (2014)
Payne, R.B.: The ecology of brood parasitism in birds. Ann. Rev. Ecol. Syst. 1–28 (1977)
Payne, R.B., Sorensen, M.D.: The Cuckoos, vol. 15. Oxford University Press (2005)
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer Science & Business Media (2012)
Rochat, Y., Taillard, É.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1), 147–167 (1995)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer Science & Business Media (2003)
Shi, X., Liang, Y., Lee, H., Lu, C., Wang, Q.: Particle swarm optimization-based algorithms for tsp and generalized tsp. Inform. Process. Lett. 103(5), 169–176 (2007)
Shlesinger, M.F., Zaslavsky, G.M., Frisch, U.: Lévy flights and related topics in physics. In: Levy Flights and Related Topics in Physics, vol. 450 (1995)
Talbi, E.-G.: Metaheuristics: From Design to Implementation, vol. 74. Wiley (2009)
Toth, P., Vigo, D.: The vehicle routing problem. Soc. Ind. Appl. Math. (2001)
Winfree, R.: Cuckoos, cowbirds and the persistence of brood parasitism. Trends Ecol. Evol. 14(9), 338–343 (1999)
Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley (2014)
Yang, X.-S.: Firefly algorithm, levy flights and global optimization. In: Research and Development in Intelligent Systems XXVI, pp. 209–218. Springer (2010)
Yang, X.-S.: Swarm-Based Metaheuristic Algorithms and No-free-Lunch Theorems. INTECH Open Access Publisher (2012)
Yang, X.-S.: Nature-Inspired Optimization Algorithms. Elsevier (2014)
Yang, X.-S., Deb, S.: Cuckoo search via lévy flights. In: World Congress on Nature & Biologically Inspired Computing, 2009. NaBIC 2009. pp. 210–214. IEEE (2009)
Yang, X.-S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2010)
Zheng, H., Zhou, Y., Luo, Q.: A hybrid cuckoo search algorithm-grasp for vehicle routing problem. J. Convergence Inform. Technol. 8(3) (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Ouaarab, A., Yang, XS. (2016). Cuckoo Search: From Cuckoo Reproduction Strategy to Combinatorial Optimization. In: Yang, XS. (eds) Nature-Inspired Computation in Engineering. Studies in Computational Intelligence, vol 637. Springer, Cham. https://doi.org/10.1007/978-3-319-30235-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-30235-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30233-1
Online ISBN: 978-3-319-30235-5
eBook Packages: EngineeringEngineering (R0)