References
- Abdel-Basset, M., & Shawky, L. A. (2019). Flower pollination algorithm: A comprehensive review. Artificial Intelligence Review, 52(4), 2533–2557. https://doi.org/10.1007/s10462-018-9624-4
- Al-Roomi, A. R. (2015). Unconstrained single-objective benchmark function repository.
- Auger, A., & Teytaud, O. (2010). Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica, 57(1), 121–146. https://doi.org/10.1007/s00453-008-9244-5
- Beer, D. (2016). The social power of algorithms. Information, Communication & Society, 20(1), 1–13. https://doi.org/10.1080/1369118X.2016.1216147
- Bekasş, G., Nigdeli, M., & Yang, X.-S. (2018). A novel bat algorithm based optimum tuning of mass dampers for improving the seismic safety of structures. Engineering Structures, 159(1), 89–98.
- Bertsekas, D. P., Nedic, A., & Ozdaglar, A. (2003). Convex analysis and optimization (2nd ed.). Athena Scientific.
- Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
- Cagnina, L. C., Esquivel, S. C., & Coello Coello, A. C. (2008). Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica, 32(2), 319–326.
- Chabert, J. L. (1999). A history of algorithms: From the pebble to the microchips. Springer-Verlag.
- Chen, S., Peng, G.-H., He, X.-S., & Yang, X.-S. (2018). Global convergence analysis of the bat algorithm using a Markovian framework and dynamic system theory. Expert Systems with Applications, 114(1), 173–182. https://doi.org/10.1016/j.eswa.2018.07.036
- Civicioglu, P. (2013). Artificial cooperative search algorithm for numerical optimization problems. Information Sciences, 229(1), 58–76. https://doi.org/10.1016/j.ins.2012.11.013
- Clerc, M., & Kennedy, J. (2002). The particle swarm: Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58–73. https://doi.org/10.1109/4235.985692
- Coello, C. A. (2000). Use of self-adaptive penalty approach for engineering optimization problems. Computers in Industry, 41(2), 113–127. https://doi.org/10.1016/S0166-3615(99)00046-9
- Corne, D., & Knowles, J. (2003). Some multiobjective optimizers are better than others. Evolutionary Computation, 4(2), 2506–2512.
- Eiben, A. E., & Smit, S. K. (2011). Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm and Evolutionary Computation, 1(1), 19–31. https://doi.org/10.1016/j.swevo.2011.02.001
- Erol, O., & Eksin, I. (2006). A new optimization method: Big bang-big crunch. Advances in Engineering Software, 37(2), 106–111. https://doi.org/10.1016/j.advengsoft.2005.04.005
- Eskandar, H., Sadollah, A., Bahreininejad, A., & Hamdi, M. (2012). Water cycle algorithm – A novel metaheuristic optimization method for solving constrained engineering optimization problems. Computers & Structures, 110–111(1), 151–166. https://doi.org/10.1016/j.compstruc.2012.07.010
- Gavvala, S. K., Jatoth, C., Gangadharan, G. R., & Buyya, R. (2019). QoS-aware cloud service composition using eagle strategy. Future Generation Computer Systems, 90, 273–290. https://doi.org/10.1016/j.future.2018.07.062
- Geem, Z. W., Kim, J. H., and Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2):60–68. https://doi.org/10.1177/003754970107600201
- Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13(5), 533–549. https://doi.org/10.1016/0305-0548(86)90048-1
- Glover, F., & Laguna, M. (1997). Tabu search. Kluwer Academic Publishers.
- Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Addison-Wesley.
- Greenhalgh, D., & Marshal, S. (2000). Convergence criteria for genetic algorithm. SIAM Journal Comput, 30(1), 269–282.
- Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019). Henry gas solubility optimization: A novel physics-based algorithm. Future Generation Computer Systems, 101, 646–667. https://doi.org/10.1016/j.future.2019.07.015
- Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019). Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems, 97, 849–872. https://doi.org/10.1016/j.future.2019.02.028
- Holland, J. (1975). Adaptation in nature and artificial systems. University of Michigan Press.
- James, J., & Li, V. (2015). A social spider algorithm for global optimization. Applied Soft Computing, 30, 614–627. https://doi.org/10.1016/j.asoc.2015.02.014
- Jamil, M., & Yang, X.-S. (2013). A literature survey of benchmark functions for global optimization problems. International Journal of Mathematical Modelling and Numerical Optimisation, 4(2), 150–194.
- Joy, G., Huyck, C., & Yang, X.-S. (2023). Review of Parameter tuning methods for nature-inspired algorithms (pp. 33–47). Springer Nature Singapore.
- Karaboga, D., & Basturk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing, 8(1), 687–697. https://doi.org/10.1016/j.asoc.2007.05.007
- Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4(4), 373–395. https://doi.org/10.1007/BF02579150
- Kaveh, A., & Talatahari, S. (2010). A novel heuristic optimization method: Charged system search. Acta Mechanica, 213(3–4), 267–289. https://doi.org/10.1007/s00707-009-0270-4
- Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks (pp. 1942–1948). IEEE.
- Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm intelligence. Academic Press.
- Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science (New York, N.Y.), 220(4598), 671–680. https://doi.org/10.1126/science.220.4598.671
- Kuo, R., & Zulvia, F. (2015). The gradient evolution algorithm: A new metaheuristic. Information Sciences, 316(2), 246–265. https://doi.org/10.1016/j.ins.2015.04.031
- Mirjalili, S. (2015). The ant lion optimizer. Advances in Engineering Software, 83(1), 80–98.
- Mirjalili, S., & Lewis, A. (2016). The whale optimization algorithm. Advances in Engineering Software, 95(1), 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008
- Mirjalili, S., Mirjalili, S., & Hatamlou, A. (2016). Multi-verse optimizer: A nature-inspired algorithm for global optimization. Neural Computing and Applications, 27(2), 495–513. https://doi.org/10.1007/s00521-015-1870-7
- Mohamed, A., Hadi, A., & Mohamed, A. (2020). Gaining-sharing knowledge based algorithm for solving optimization problems: A novel nature-inspired algorithm. International Journal of Machine Learning and Cybernatics, 11(7), 1501–1529.
- Osaba, E., Yang, X.-S., Diaz, F., Lopez-Garcia, P., & Carballedo, R. (2016). An improved discrete bat algorithm for symmetric and assymmetric travelling salesman problems. Engineering Applications of Artificial Intelligence, 48(1), 59–71. https://doi.org/10.1016/j.engappai.2015.10.006
- Osaba, E., Yang, X.-S., Diaz, F., Onieva, E., Masegosa, A., & Perallos, A. (2017). A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Computing, 21(18), 5295–5308. https://doi.org/10.1007/s00500-016-2114-1
- Ouaarab, A., Ahiod, B., & Yang, X.-S. (2014). Discrete cuckoo search algorithm for the travelling salesman problem. Neural Computing and Applications, 24(7–8), 1659–1669. https://doi.org/10.1007/s00521-013-1402-2
- Palmieri, N., Yang, X.-S., Rango, F. D., & Santamaria, A. F. (2018). Self-adaptive decision-making mechanisms to balance the execution of multiple tasks for a multi-robots team. Neurocomputing, 306(1), 17–36. https://doi.org/10.1016/j.neucom.2018.03.038
- Pham, D. T., & Castellani, M. (2009). The bees algorithm: Modelling foraging behaviour to solve continuous optimization problems. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 223(12), 2919–2938. https://doi.org/10.1243/09544062JMES1494
- Pham, D. T., & Castellani, M. (2014). Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms. Soft Computing, 18(5), 871–903. https://doi.org/10.1007/s00500-013-1104-9
- Pham, D. T., & Castellani, M. (2015). A comparative study of the bees algorithm as a tool for function optimisation. Cogent Engineering, 2(1), 1091540. https://doi.org/10.1080/23311916.2015.1091540
- Pham, D., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., & Zaidi, M. (2005). The bees algorithm, technical note. Technical report. Cardiff University.
- Price, K., Storn, R., & Lampinen, J. (2005). Differential evolution: A practical approach to global optimization. Springer.
- Rajwar, K., Deep, K., & Das, S. (2023). An exhaustive review of the metaheuristic algorithms for search and optimization: Taxonomy, applications, and open challenges. Artificial Intelligence Review, 56(11), 1–71. https://doi.org/10.1007/s10462-023-10470-y
- Rango, F. D., Palmieri, N., Yang, X.-S., & Marano, S. (2018). Swarm robotics in wireless distributed protocol design for coordinating robots involved in cooperative tasks. Soft Computing, 22(13), 4251–4266. https://doi.org/10.1007/s00500-017-2819-9
- Rashedi, E., Nezamabadi-Pour, H. H., & Saryazdi, S. (2009). GSA: A gravitational search algorithm. Information Sciences, 179(13), 2232–2248. https://doi.org/10.1016/j.ins.2009.03.004
- Rosenbrock, H. H. (1960). An automatic method for finding the greatest or least value of a function. Computer Journal, 3(3), 175–184. https://doi.org/10.1093/comjnl/3.3.175
- Schrijver, A. (2005). On the history of combinatorial optimization (till 1960). In Aardal, K., Nemhauser, G. L., & Weismantel, R. (Eds.), Handbook of discrete optimization (pp. 1–68). Elsevier.
- Schwefel, H. (1995). Evolution and optimum seeking. John Wiley Sons.
- Ser, J. D., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello, C. A. C., & Herrera, F. (2019). Bio-inspired computation: Where we stand and what’s next. Swarm and Evolutionary Computation, 48, 220–250.
- Storn, R., & Price, K. (1997). Differential evolution: A simple and efficient heuristic for global optimization. Journal of Global Optimization, 11(4), 341–359. https://doi.org/10.1023/A:1008202821328
- Suganthan, P., Hansen, N., Liang, J., Deb, K., Chen, Y., Auger, A., & Tiwar, S. (2005). Problem definitions and evaluation criteria for CEC 2005, special session on real-parameter optimization. Technical Report. Nanyang Technological University (NTU), Singapore.
- Wang, G. (2018). Moth search algorithm: A bio-inspired metaheuristic algorithm for global optimization problems. Memetic Computing, 10(2), 151–164. https://doi.org/10.1007/s12293-016-0212-3
- Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67–82.
- Wolpert, D. H., & Macready, W. G. (2005). Coevolutionary free lunches. IEEE Transactions on Evolutionary Computation, 9(6), 721–735. https://doi.org/10.1109/TEVC.2005.856205
- Yang, X.-S. (2009). Firefly algorithms for multimodal optimization. In Watanabe, O., & Zeugmann, T. (Eds.), Proceedings of Fifth symposium on stochastic algorithms, foundations and applications (Vol. 5792, pp. 169–178). Lecture Notes in Computer Science Springer.
- Yang, X.-S. (2013). Cuckoo search and firefly algorithm: Theory and applications, volume 516 of studies in computational intelligence. Springer.
- Yang, X.-S. (2020a). Nature-inspired optimization algorithms (2nd ed.). Academic Press.
- Yang, X.-S. (2020b). Nature-inspired optimization algorithms: Challenges and open problems. Journal of Computational Science, 46, 101104. https://doi.org/10.1016/j.jocs.2020.101104
- Yang, X.-S. (2023). Ten new benchmarks for optimization. In Yang, X.-S. (Ed.), Benchmarks and hybrid algorithms in optimization and applications (pp. 19–32). Springer.
- Yang, X.-S., & Deb, S. (2010). Engineering optimisation by cuckoo search. International Journal of Mathematical Modelling and Numerical Optimisation, 1(4), 330–343. https://doi.org/10.1504/IJMMNO.2010.035430
- Yang, X.-S., Deb, S., Loomes, M., & Karamanoglu, M. (2013). A framework for self-tuning optimization algorithm. Neural Computing and Applications, 23(7–8), 2051–2057. https://doi.org/10.1007/s00521-013-1498-4
- Yang, X.-S., Deb, S., Zhao, Y.-X., Fong, S., & He, X. (2018). Swarm intelligence: Past, present and future. Soft Computing, 22(18), 5923–5933. https://doi.org/10.1007/s00500-017-2810-5
- Yang, X.-S., & He, X.-S. (2019). Mathematical foundations of nature-inspired algorithms. Springer Briefs in Optimization. Springer.
- Yazdani, M., & Jolai, F. (2016). Lion optimization algorithm (LOA): A nature-inspired metaheuristic algorithm. Journal of Computational Design and Engineering, 3(1), 24–36. https://doi.org/10.1016/j.jcde.2015.06.003
- Zaharie, D. (2009). Influence of crossover on the behavior of the differential evolution algorithm. Applied Soft Computing, 9(3), 1126–1138. https://doi.org/10.1016/j.asoc.2009.02.012
- Zdenek, D. (2009). Optimal quadratic programming algorithms: With applications to variational inequalities. Springer.
- Zelinka, I. (2015). A survey on evolutionary algorithm dynamics and its complexy-mutual relations, past, present and future. Swarm and Evolutionary Computation, 25(1), 2–14. https://doi.org/10.1016/j.swevo.2015.06.002
- Zervoudakis, K., & Tsafarakis, S. (2020). A mayfly optimization algorithm. Computers & Industrial Engineering, 145, 106559. https://doi.org/10.1016/j.cie.2020.106559
- Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & Fonseca, V. G. D. (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transaction on Evolutionary Computation, 7(2), 117–132.