Engineering Optimization: An Introduction with Metaheuristic Applications

Engineering Optimization: An Introduction with Metaheuristic Applications

Volumn , Issue , 2010, Pages

  Yang, Xin She ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78650650121     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470640425     Document Type: Book

References (172)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover Publication, 1965.
2. D. H. Ackley, A Connectionist Machine for Genetic Hillclimbing, Kluwer Academic Publishers, 1987.
3. A. Adamatzky, C. Teuscher, From Utopian to Genuine Unconventional Computers, Luniver Press, 2006.
4. A. Afshar, O. B. Haddad, M. A. Marino, B. J. Adams, "Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation", J. Franklin Institute, 344, 452-462 (2007).
5. M. Agrawal, N. Kayal, and N. Saxena, "Primes is in P", Ann. Mathematics, 160 (2), 781-793 (2002).
6. G. Arfken, Mathematical Methods for Physicists, Academic Press, 1985.
7. J. Arora, Introduction to Optimum Design, McGraw-Hill, 1989.
8. S. N. Atluri, Methods of Computer Modeling in Engineering and the Sciences, Vol. I, Tech Science Press, 2005.
9. M. Bartholomew-Biggs, B. P. Butler, A. B. Forbes, "Optimization algorithms for generalized regression on metrology", in: Advanced Mathematica and Computational Tools in Metrology IV (Eds. P. Ciarlini, A. B. Forbes, F. Pavese, D. Richter), World Scientific, pp. 21-31 (2000).
10. M. Bartholomew-Biggs, Nonlinear Optimization with Engineering Applications, Springer, 2008.
11. B. Bastürk and D. Karabogo, "An artificial bee colony (ABC) algorithm for numerical function optimizaton", in: IEEE Swarm Intelligence Symposium 2006, May 12-14, Indianapolis, IN, USA, 2006.
12. M. S. Bazaraa, H. D. Serali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, John Wiley & Sons, 1993.
13. A. Belegundu, A Study of Mathematical Programming Methods for Structural Optimization, PhD thesis, University of Iowa, Iowa, 1982.
14. W. J. Bell, Searching Behaviour: The Behavioural Ecology of Finding Resources, Chapman & Hall, London, 1991.
15. M. P. Bendsøe, Optimization of Structural Topology, Shape and Material, Springer, Berlin, 1995.
16. M. P. Bendsøe, O. Sigmund, "Material interpolations in topology optimization", Arch. Appl. Mech., 69, 635-654 (1999).
17. A. Björck, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
18. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: Overview and conceptural comparison", ACM Comput. Surv., 35, 268-308 (2003).
19. E. Bonabeau, M. Dorigo, G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, 1999.
20. E. Bonabeau and G. Theraulaz, "Swarm smarts", Scientific Americans. March, 73-79 (2000).
21. S. P. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, (2004). Also http://www.stanford.edu/boyd
22. D. S. Bridges, Computatability, Springer, New York, 1994.
23. C. G. Broyden, "The convergence of a class of double-rank minimization algorithms", IMA J. Applied Math., 6, 76-90 (1970).
24. L. C. Cagnina, S. C. Esquivel, C. A. Coello, "Solving engineering optimization problems with the simple constrained particle swarm optimizer", Informatica, 32, 319-326 (2008).
25. L. A. Cauchy, "Methode generale pour la resolution des systeemes d'equations simulatanees", Comptes Rendus de l'Academie de Sciences de Paris, 25, 3=536-538 (1847).
26. A. Chatterjee and P. Siarry, "Nonlinear inertia variation for dynamic adapation in particle swarm optimization", Comp. Oper. Research, 33, 859-871 (2006).
27. Celis M. Celis, J. E. Dennis, and R. A. Tapia. "A trust region strategy for nonlinear equality constrained optimization", in Numerical Optimization 1994" (Eds. P. Boggs, R. Byrd and R. Schnabel), Philadelphia: SIAM, pp. 71-82 (1985).
28. C. Chong, M. Y. Low, A. I. Sivakumar, K. L. Gay, "A bee colony optimization algorithm to job shop scheduling", Proc. of 2006 Winter Simulation Conference, Eds Perrone L. F. et al, (2006).
29. C. A. Coello Coello, "Use of a self-adaptive penalty approach for engineering optimization problems", Computers in Industry, 41, 113-127 (2000).
30. A. R. Conn, N. I. M. Gould, P. L. Toint, Trust-region methods, SIAM & MPS, (2000).
31. B. J. Copeland, The Essential Turing, Oxford University Press, 2004.
32. B. J. Copeland, Alan Turing's Automatic Computing Engine, Oxford University Press, 2005.
33. R. Courant and D. Hubert, Methods of Mathematical Physics, 2 volumes, Wiley-Interscience, New York, 1962.
34. M. G. Cox, A. B. Forbes, P. M. Harris, I. M. Smith, "The classification and solution of regression problems for calibration", NPL SSfM Technical Report, 2004.
35. B. D. Craven, Control and Optimization, Chapman & Hall, 1995.
36. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, 1963.
37. M. Davis, Computability and Unsolvability, Dover, (1982).
38. K. De Jong, Analysis of the Behaviour of a Class of Genetic Adaptive Systems, PhD thesis, University of Michigan, Ann Arbor, 1975.
39. K. Deb, "An efficient constraint handling method for genetic algorithms", Comput. Methods Appl. Mech. Engrg., 186, 311-338 (2000).
40. K. Deb., Optimisation for Engineering Design: Algorithms and Examples, Prentice-Hall, New Delhi, 1995.
41. J. E. Dennis, "A brief introduction to quasi-Newton methods", in: Numerical Analysis: Proceedings of Symposia in Applied Mathematics (Eds G. H. Golub and J. Öliger, pp. 19-52 (1978).
42. R Dorfman, "The discovery of linear programming", Ann. Hist. Comput., 6 (3), 283-295 (1984).
43. M. Dorigo, Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italy, 1992.
44. M. Dorigo and T. Stiitzle, Ant Colony Optimization, MIT Press, Cambridge, 2004.
45. S. Dreyfus, "Richard Bellman on the birth of dynamic programming", Operations Research, 50 (1), 48-51 (2002).
46. M. A. El-Beltagy, Keane A. J., "A comparison of various optimization algorithms on a multilevel problem", Engin. Appl. Art. Intell., 12, 639-654 (1999).
47. A. P. Engelbrecht, Fundamentals of Computational Swarm Intelligence, John Wiley & Sons, 2005.
48. L. C. Evans, An Introduction to Stochastic Differential Equations, Lecture notes, http://math.berkeley.edu/evans/SDE.course.pdf
49. M. Fathian, B. Amiri, A. Maroosi, "Application of honey-bee mating optimization algorithm on clustering", Applied Mathematics and Computation, 190, 1502-1513 (2007).
50. T. S. Ferguson, "Who solved the secretary problem?", Statist. Sei., 4 (3), 282-296 (1989).
51. R. P. Feynman, R. B. Leighton, and M. Sands, The Feynman Lectures on Physics, vol. 2, Addison-Wesley, Reading, Mass., 1963.
52. A. V. Fiacco and G. P. McCormick, Nonlinear Porgramming: Sequential Unconstrained Minimization Techniques, John Wiley & Sons, 1969.
53. S. R. Finch, Mathematical Constants, Cambridge University Press, 2003.
54. G. W. Flake, The Computational Beauty of Nature: Computer Explorations of Fractals, Chaos, Complex Systems, and Adaptation, Cambridge, Mass.: MIT Press, 1998.
55. R. Fletcher, "A new approach to variable metric algorithms", Computer Journal, 13 317-322 (1970).
56. W. Fleming and R. Rishel, Deterministic and Stochastic Optimal Control, Springer, 1975.
57. C. A. Floudas, P. M., Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gumus, S. T. Harding, J. L. Klepeis, C. A., Meyer, C. A. Scheiger, Handbook of Test Problems in Local and Global Optimization, Springer, (1999).
58. L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial Intelligence Through Simulated Evolution, John Wiley & Sons, 1966.
59. A. R. Forsyth, Calculus of Variations, Dover, 1960.
60. A. C. Fowler, Mathematical Models in the Applied Sciences, Cambridge University Press, 1997.
61. D. Gamerman, Markov Chain Monte Carlo, Chapman & Hall/CRC, 1997.
62. C. W. Gardiner, Handbook of Stochastic Methods, Springer, (2004).
63. Z. W. Geem, J. H. Kim, and G. V. Loganathan, "A new heuristic optimization algorithm: Harmony search", Simulation, 76, 60-68 (2001).
64. L. Gerencser, S. D. Hill, Z. Vago, and Z. Vincze, "Discrete optimization, SPSA, and Markov chain Monte Carlo methods", Proc. 2004 Am. Contr. Conf., 3814-3819 (2004).
65. N. Gershenfeld, The Nature of Mathematical Modeling, Cambridge University Press, 1998.
66. C. J. Geyer, "Practical Markov Chain Monte Carlo", Statistical Science, 7, 473-511 (1992).
67. A. Ghate and R. Smith, "Adaptive search with stochastic acceptance probabilities for global optimization", Operations Research Lett., 36, 285-290 (2008).
68. P. E. Gill, W. Murray, and M. H. Wright, Practical optimization, Academic Press Inc, 1981.
69. W. R. Gilks, S. Richardson, and D. J. Spiegelhalter, Markov Chain Monte Carlo in Practice, Chapman & Hall/CRC, (1996).
70. F. Glover, "Heuristics for Integer Programming Using Surrogate Constraints", Decision Sciences, 8, 156-166 (1977).
71. F. Glover, "Tabu Search-Wellsprings and Challenges", Euro. J. Operational Research, 106, 221-225 (1998).
72. F. Glover, "Future paths for integer programming and links to artificial intelligence", Comput. Operational Res., 13 (5), 533-549 (1986).
73. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, 1997.
74. Goldberg D. E., Genetic Algorithms in Search, Optimisation and Machine Learning, Reading, Mass.: Addison Wesley, 1989.
75. S. M. Goldeldt, R. E. Quandt, and H. F. Trotter, "Maximization by quadratic hill-climbing", Econometrica, 34, 541-551, (1996).
76. D. Goldfarb, "A family of variable metric update derived by variational means", Mathematics of Computation, 24, 23-26 (1970).
77. A. A. Goldstein, "Cauchy's method of minimization", Numerische Mathematik, 4(1), 146-150 (1962).
78. R. Goodman, Teach Yourself Statistics, London, 1957.
79. C. M. Grindstead and J. L. Snell, Introduction to Probability, American Mathematical Society, 1997.
80. M. Gutowski, "Levy flights as an underlying mechanism for global optimization algorithms", ArXiv Mathematical Physics e-Prints, June, (2001).
81. O. B. Haddad, A. Afshar, M. A. Marino, "Honey bees mating optimization algorithm (HBMO); a new heuristic approach for engineering optimization", in: Proc. of the First Int. Conf. on Modelling, Simulation and Applied Optimization, Sharjah, UAE, (2005).
82. W. K. Hastings, "Monte Carlo sampling methods using Markov chains and their applications", Biometrika, 57, 97-109 (1970).
83. A. Hedar, Test function web pages, http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO_files/Page364.htm
84. History of optimization, http://hse-econ.fi/kitti/opthist.html
85. L. Hocking, Optimal Control: An Introduction to the Theory with Applications, Oxford University Press, 1991.
86. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Anbor, 1975.
87. H. H. Holstine, A History of the Calculus of Variations from the 17th through the 19th Century, Springer-Verlag, Heidelberg, 1980.
88. D. Jaeggi, G. T. Parks, T. Kipouros, P. J. Clarkson, "A multi-objective Tabu search algorithm for constrained optimization problem", 3rd Int. Conf. Evolutionary Multi-Criterion Optimisation, Mexico, 3410, 490-504 (2005).
89. A. Jeffrey, Advanced Engineering Mathematics, Academic Press, 2002.
90. J. L. W. V. Jensen, "Sur les functions convexes et les inegalites entre les valeurs moyenners", Ada Mathematica, 30, 175-193 (1906).
91. P. Judea, Heuristics, Addison-Wesley, 1984.
92. C. L. Kar, I. Yakushin, K. Nicolosi, "Solving inverse initial-value, boundaryvalue problems via genetic algorithms", Engineering Applications of Artificial Intelligence, 13, 625-633 (2000).
93. D. Karaboga, "An idea based on honey bee swarm for numerical optimization", Technical Report, Erciyes University, 2005.
94. D. Karaboga and B. Bastürk, "On the performance of artificial bee colony (ABC) algorithm", Applied Soft Computing, 8, 687-697 (2008).
95. W. Karush, Minima of Functions of Several Variables with Inequalities as Side Constraints, MSc Dissertation, Department of Mathematics, University of Chicago, Illinois, 1939.
96. N. Karmarkar, "A new polynomial-time algorithm for linear programming", Combinatorica, 4 (4), 373-395 (1984).
97. Keane A. J., "Genetic algorithm optimization of multi-peak problems: studies in convergence and robustness", Artificial Intelligence in Engineering, 9, 75-83 (1995).
98. J. Kennedy and R. C. Eberhart, "Particle swarm optimization", in: Proc. of IEEE International Conference on Neural Networks, Piscataway, NJ. pp. 1942-1948 (1995).
99. J. Kennedy, R. C. Eberhart, Y. Shi, Swarm intelligence, Academic Press, 2001.
100. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing", Science, 220, No. 4598, 671-680 (1983).
101. G. A. Korn and T. M. Korn, Mathematical Handbook for Scientists and Engineers, Dover Publication, 1961.
102. J. R. Koza, Genetic Programming: One the Programming of Computers by Means of Natural Selection, MIT Press, 1992.
103. E. Kreyszig, Advanced Engineering Mathematics, 6th Edition, Wiley & Sons, New York, 1988.
104. H. W. Kuhn and A. W. Tucker, "Nonlinear programming", Proc. 2nd Berkeley Symposium, University of California Press, pp. 481-492 (1951).
105. K. Levenberg, "A method for the solution of certain problems in least squares", Quart. J. Applied Math., 2, 164-168, (1944).
106. K. S. Lee, Z. W. Geem, "A new meta-heuristic algorithm for continous engineering optimization: harmony search theory and practice", Comput. Methods Appl. Mech. Engrg., 194, 3902-3933 (2005).
107. J. Macki and A. Strauss, Introduction to Optimal Control Theory, Springer, 1982.
108. N. Marco, S. Lanteri, J. A. Desideri, J. Periaux, "A parallel genetic algorithm for multi-objective optimization in CFD", in: Evolutionary Algorithms in Engineering and Computer Science (eds Miettinen K. et al), John Wiley & Sons, 1999.
109. D. Marquardt, "An algorithm for least-squares estimation of nonlinear parameters", SIAM J. Applied Math., 11, 431-441 (1963).
110. E. Marinari and G. Parisi, "Simulated tempering: a new Monte Carlo scheme", Europhysics Lett, 19, 451-458 (1992).
111. Matlab info, http://www.mathworks.com
112. W. H. McCrea and F. J. Whipple, "Random paths in two and three dimensions", Proc. Roy. Soc. Edinburgh, 60, 281-298 (1940).
113. K. Menger, "Dass botenproblem", in: Ergebnisse eines Mathematischen Kolloquiums 2, Ed. K. Menger), Teubner, Leipzig, p. 11-12 (1932).
114. N. Metropolis, and S. Ulam, "The Monte Carlo method", J. Amer. Stat. Assoc, 44, 335-341 (1949).
115. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, "Equation of state calculations by fast computing machines", J. Chem. Phys., 21, 1087-1092 (1953).
116. S. P. Meyn, and R. L. Tweedie, Markov Chains and Stochastic Stability, Springer-Verlag, London, 1993.
117. Z. Michaelewicz, Genetic Algorithm + Data Structure = Evolution Progamming, New York, Springer, 1996.
118. M. Mitchell, An Introduction to Genetic Algorithms, Cambridge, Mass: MIT Press, 1996.
119. M. Molga, C. Smutnicki, "Test functions for optimization needs", http://www.zsd.ict.pwr.wroc.pl/files/docs/functions.pdf
120. L. T. Moore, Isaac Newton: A Biography, Dover, New York, 1934.
121. R. F. Moritz and E. E. Southwick, Bees as superorganisms, Springer, 1992.
122. H. Murase, "Finite element analysis using a photosynthetic algorithm", Computers and Electronics in Agriculture, 29, 115-123 (2000).
123. D. J. Murdoch and P. J. Green, "Exact sampling from a continuous state space", Scand. J. Statist, 25, 483-502 (1998).
124. S. Nakrani and C. Tovey, "On honey bees and dynamic server allocation in Internet hosting centers", Adaptive Behaviour, 12, 223-240 (2004).
125. J. A. Neider and R. Mead, "A simplex method for function optimization", Computer Journal, 7, 308-313 (1965).
126. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Methods in Convex Programming, Society for Industrial and Applied Mathematics, 1994.
127. Octave, http://www.gnu.org/software/octaive, also J. W. Eaton, Gnu Octave Manual, Network Theory Ltd, 2002.
128. I. Pavlyukevich, "Levy flights, non-local search and simulated annealing", J. Computational Physics, 226, 1830-1844 (2007).
129. I. Pavlyukevich, "Cooling down Levy flights", J. Phys. A:Math. Theor., 40, 12299-12313 (2007).
130. C. E. Pearson, Handbook of Applied Mathematics, 2nd Ed, Van Nostrand Reinhold, New York, 1983.
131. D. T. Pham, A. Ghanbarzadeh, E. Koc, S. Otri, S. Rahim and M. Zaidi, "The bees algorithm", Technical Note, Manufacturing Engineering Center, Cardiff University, 2005.
132. L. S. Pontryagin, V. G. Boltyanski, R. S. Gamkrelidze and E. F. Mishchenko, The Mathematical Theory of Optimal Processes, Interscience, 1962.
133. M. J. D. Powell, "A new algorithm for unconstrained optimization", in: Nonlinear Programming (Eds J. B. Rosen, O. L. Mangasarian, and K. Ritter), pp. 31-65 (1970).
134. W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery, Numerical Recipes in C++: The Art of Scientific Computing, Cambridge University Press, 2002.
135. N. Quijano, A. E. Gil, and K. M. Passino, "Experimental for dynamic resource allocation, scheduling and control", IEEE Contrl Systems Magazine, 25, 63-79 (2005).
136. S. S. Rao, Engineering Optimization: Theory and Practice, 3rd Edition, John Wiley & Sons, 1996.
137. K. F. Riley, M. P. Hobso, and S.J. Bence, Mathematical Methods for Physics and Engineering, 3rd Edition, Cambridge University Press, 2006.
138. A. M. Reynolds and M. A. Frye, "Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search", PLoS One, 2, e354 (2007).
139. G. Ramos-Fernandez, J. L. Mateos, O. Miramontes, G. Cocho, H. Larralde, B. Ayala-Orozco, "Levy walk patterns in the foraging movements of spider monkeys (Ateles geoffroyi)",Behav. Ecol. Sociobiol., 55, 223-230 (2004).
140. E. Sandgren, "Nonlinear integer and discrete programming in mechanical design optimization", J. Mech. Des.-T. ASME, 112 (2), 223-229 (1990).
141. Y. Sawaragi, H. Nakayama, T. Tanino, Theory of Multiobjective Optimisation, Academic Press, 1985.
142. A. Schrijver, "On the history of combinatorial optimization (till I960)", in: Handbook of Discrete Optimization (Eds K. Aardal, G. L. Nemhauser, R. Weismantel), Elsevier, Amsterdam, pp. 1-68 (2005).
143. D. F. Shanno, "Conditioning of quasi-Newton methods for function minimization", Mathematics of Computation, 25, 647-656 (1970).
144. O. Sheynin, "On the history of the principle of least squares", Archive for History of Exact Sciences, 46 (1), 39-54 (1993).
145. P. Sirisalee, M. F. Ashby, G. T. Parks, and P. J. Clarkson, "Multi-criteria material selection in engineering design", Adv. Eng. Mater., 6, 84-92 (2004).
146. T. D. Seeley, The Wisdom of the Hive, Harvard University Press, 1995.
147. T. D. Seeley, S. Camazine, J. Sneyd, "Collective decision-making in honey bees: how colonies choose among nectar sources", Behavioural Ecoloy and Sociobiology, 28, 277-290 (1991).
148. O. Sigmund, "A 99 line topology optimization code written in Matlab", Struct. Multidisc. Optim., 21, 120-127 (2001).
149. D. R. Smith, Variation Methods in Optimization, New York, Dover, 1998.
150. J. C. Spall, Introduction to Stochastic Search and optimization: Estimation, Simulation, and Control, Wiley, Hoboken, NJ, 2003.
151. Swarm intelligence, http://www.swarmintelligence.org
152. E.-G. Talbi, Parallel Combinatorial Optimization, John Wiley & Sons, 2006.
153. E.-G. Talbi, Metaheuristics: From Design to Implementation, John Wiley & Sons, 2009.
154. V. M. Tikhomirov, Stories about Mixima and Minima, American Mathematical Society, 1990.
155. A. M. Turing, Intelligent Machinery, National Physical Laboratory, 1948.
156. W. T. Tutte, Graph Theory as I Have Known It, Oxford Science Publications, 1998.
157. G. M. Viswanathan, S. V. Buldyrev, S. Havlin, M. G. E. da Luz, E. P. Raposo, and H. E. Stanley, "Levy flight search patterns of wandering albatrosses", Nature, 381, 413-415 (1996).
158. E. W. Weisstein, http://mathworld.wolfram.com
159. D. Wells, The Penguin Book of Curious and Interesting Geometry, Penguin, 1991.
160. Wikipedia, http://en.wikipedia.com
161. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization", IEEE Transaction on Evolutionary Computation, 1, 67-82 (1997).
162. S. J. Wright, Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics, 1997.
163. X. S. Yang, "Engineering optimization via nature-inspired virtual bee algorithms", IWINAC 2005, Lecture Notes in Computer Science, 3562, 317-323 (2005).
164. X. S. Yang, "Biology-derived algorithms in engineering optimizaton (Chapter 32)", in Handbook of Bioinspired Algorithms, edited by Olarius S. and Zomaya A., Chapman & Hall/CRC, 2005.
165. X. S. Yang, "New enzyme algorithm, Tikhonov regularization and inverse parabolic analysis", in: Advances in Computational Methods in Science and Engineering, Lecture Series on Computer and Computer Sciences, ICCMSE 2005, Eds T. Simos and G. Maroulis, 4, 1880-1883 (2005).
166. X. S. Yang, J. M. Lees, C. Morley, "Application of virtual ant algorithms in the otpimization of CFRP shear strengthened precracked structures", Lecture Notes in Computer Sciences, 3991, 834-837 (2006).
167. X. S. Yang, "Firefly algorithms for multimodal optimization", Proc. 5th Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2009, Eds. O. Watanabe and T. Zeugmann, Lecture Notes in Computer Science, 5792, 169-178 (2009).
168. X. S. Yang, "Harmony search as a metaheuristic algorithm", in: Music-Inspired Harmony Search Algorithm: Theory and Applications eds. Z. W. Geem, Springer, p. 1-14 (2009).
169. X. S. Yang, Nature-Inspired Metaheuristic Algorithms, Luniver Press, 2008.
170. X. S. Yang, Introduction to Computational Mathematics, World Scientific, 2008.
171. X. S. Yang and S. Deb, "Cuckoo search via Levy flights", Proceedings of World Congress on Nature & Biologically Inspired Computing (NaBic 2009, India), IEEE Pulications, USA, 210-214 (2009).
172. X. S. Yang, "Firefly algorithm, Levy flights and global optimization", in: Research and Developement in Intelligent Systems XXVI: Incorporating Applications and Innovations in Intelligent Systems XVII (Eds. M. Barmer, R. Ellis, M. Petridis), Springer-Verlag, London, pp. 209-218 (2010).