[1] Ashby WR. Principles of the self-organizing system. In: Von Foerster H, Zopf GW Jr, editors. Principles of self-organization: transactions of the University of Illinois symposium. London, UK: Pergamon Press; 1962. p. 255–78.
[2] Belavkin RV. Optimal measures and Markov transition kernels. J Global Optim 2013;55(2):387–416.
[3] Belavkin RV. On evolution of an information dynamic system and its generating operator. Optim Lett 2012;6(5):827–40.
[4] Blum C, Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 2003;35(2):268–308.
[5] Dorigo M. Optimization, learning, and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy; 1992.
[6] Dorigo M, Di Caro G, Gambardella LM. Ant algorithms for discrete optimization. Artif Life 1999;5(2):137–72.
[7] Eiben AE, Smit SK. Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol Comput 2011;1(1):19–31.
[8] Fister I, Fister Jr I, Yang XS, Brest J. A comprehensive review of firefly algorithms, Swarm and evolutionary computation; 2013. http://dx.doi.org/10.1016/j.swevo.2013.06.001
[9] Fister Jr I, Yang XS, Fister I, Brest J, Fister D. A brief review of nature-inspired algorithms for optimization. <http://arxiv.org/abs/1307.4186>; 2013.
[10] Hooke R, Jeeves TA. “Direct search” solution of numerical and statistical problems. J Assoc Comput Machinery (ACM) 1961;8(2):212–29.
[11] Gandomi AH, Yang XS, Alavi AH. Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 2013;29(1):17–35.
[12] Gandomi AH, Yang XS, Talatahari S, Deb S. Coupled eagle strategy and differential evolution for unconstrained and constrained global optimization. Comput Math Appl 2012;63(1):191–200.
[13] Geem ZW, Kim JH, Loganathan GV. A new heuristic optimization algorithm: harmony search. Simulation 2001;76(1):60–8.
[14] Holland J. Adaptation in natural and artificial systems. Cambridge, MA, USA: MIT Press; 1975.
[15] Karaboga D. An idea based on honeybee swarm for numerical optimization. Technical report TR06. Turkey; Erciyes University, 2005.
[16] Keller EF. Organisms, machines, and thunderstorms: a history of self-organization, part two. Complexity, emergence, and stable attractors. Hist Stud Nat Sci 2009;39(1):1–31.
[17] Kennedy J, Eberhart RC. Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks, Piscataway, NJ, USA; 1995. p. 1942–48.
[18] Kirkpatrick S, Gellat CD, Vecchi MP. Optimization by simulated annealing. Science 1983;220(4598):671–80.
[19] Koziel S, Yang XS. Computational optimization, methods and algorithms. Germany: Springer; 2011.
[20] Nakrani S, Tovey C. On honey bees and dynamic server allocation in internet hosting centers. Adapt Behav 2004;12(3–4):223–40.
[21] Pavlyukevich I. Lévy flights, non-local search, and simulated annealing. J Comput Phys 2007;226(2):1830–44.
[22] Price K, Storn R, Lampinen J. Differential evolution: a practical approach to global optimization. Berlin, Germany: Springer-Verlag; 2005.
[23] Storn R. On the usage of differential evolution for function optimization. In: Biennial conference of the North American fuzzy information processing society (NAFIPS), Berkeley, CA, USA; 1996. p. 519–23.
[24] Storn R, Price K. Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 1997;11(4):341–59.
[25] Süli E, Mayer D. An introduction to numerical analysis. Cambridge, UK: Cambridge University Press; 2003.
[26] Walton S, Hassan O, Morgan K, Brown MR. Modified cuckoo search: a new gradient free optimization algorithm. Chaos, Solitons & Fractals 2011;44(9):710–8.
[27] Wang F, He XS, Wang Y, Yang SM. Markov model and convergence analysis based on cuckoo search algorithm. Jisuanji Gongcheng/Comput Eng 2012;38(11):181–5.
[28] Yang XS. Introduction to computational mathematics. Singapore: World Scientific Publishing Ltd; 2008.
[29] Yang XS. Nature-inspired metaheuristic algorithms. 1st ed. Bristol, UK: Luniver Press; 2008.
[30] YangXS.Engineering optimisation: an introductionwithmetaheuristic applications.Wiley; 2010.
[31] Yang XS. Harmony search as a metaheuristic algorithm. In: Geem ZW, editor. Musicinspired harmony search algorithm: theory and applications. Studies in computational intelligence, vol. 191. Berlin, Germany: Springer; 2009. p. 1–14.
[32] Yang XS. Firefly algorithms for multimodal optimization. In: Stochastic algorithms: foundations and applications, SAGA 2009. Lecture notes in computer sciences, vol. 5792; 2009. p. 169–78.
[33] Yang XS. Firefly algorithm, stochastic test functions and design optimisation. Int J BioInspired Comput 2010;2(2):78–84.
[34] Yang XS. A new metaheuristic bat-inspired algorithm. In: Cruz C, González JR, Pelta DA, Terrazas G, editors. Nature inspired cooperative strategies for optimization (NISCO 2010). Studies in computational intelligence, vol. 284. Berlin, Germany: Springer; 2010. p. 65–74.
[35] Yang XS, Deb S. Eagle strategy using Lévy walk and firefly algorithms for stochastic optimization. In: Cruz C, González JR, Pelta DA, Terrazas G, editors. Nature inspired cooperative strategies for optimization (NISCO 2010). Studies in computational intelligence, vol. 284. Berlin: Springer; 2010. p. 101–11.
[36] Yang XS. Bat algorithm for multi-objective optimisation. Int J Bio-Inspired Comput 2011;3(5):267–74.
[37] Yang XS, Deb S, Fong S. Accelerated particle swarm optimization and support vector machine for business optimization and applications. In: Networked digital technologies 2011. Communications in computer and information science, vol. 136; 2011. p. 53–66.
[38] Yang XS, Gandomi AH. Bat algorithm: a novel approach for global engineering optimization. Eng Comput 2012;29(5):1–18.
[39] Yang XS, Deb S. Cuckoo search via Lévy flights. In: Proceedings of world congress on nature & biologically inspired computing (NaBIC 2009). USA: IEEE Publications; 2009. p. 210–14.
[40] Yang XS, Deb S. Engineering optimization by cuckoo search. Int J Math Model Num Optim 2010;1(4):330–43.
[41] Yang XS, Deb S. Multiobjective cuckoo search for design optimization. Comput Oper Res 2013;40(6):1616–24.
[42] Yang XS. Flower pollination algorithm for global optimization. In: Unconventional computation and natural computation. Lecture notes in computer science, vol. 7445; 2012. p. 240–49.
[43] Yang XS, Karamanoglu M, He XS. Multi-objective flower algorithm for optimization. Procedia Comput Sci 2013;18:861–8.