[1] L. Bianchi, M. Dorigo, L.M. Gambardella, and W.J. Gutjahr, “A survey on metaheuristics for stochastic combinatorial optimization,” Nat. Comput., vol. 8, no. 2, pp. 239-287, 2009, doi: 10.1007/s11047-008-9098-4.
[2] M.G.H. Omran, S. Al-Sharhan, and M. Clerc, “A modified Intellects-Masses Optimizer for solving real-world optimization problems,” Swarm Evol. Comput., vol. 41, pp. 159-166, 2018, doi: 10.1016/j.swevo.2018.02.015.
[3] M. Lindahl, M. Sorensen, and T.R. Stidsen, “A fix-and-optimize matheuristic for university timetabling,” J. Heuristics, vol. 24, no. 4, pp. 645-665, 2018, doi: 10.1007/s10732-018-9371-3.
[4] C.-C. Wu, J.-Y. Chen, W.-C. Lin, K. Lai, S.-C. Liu, and P.-W. Yu, “A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization,” Swarm Evol. Comput., vol. 41, pp. 97-110, 2018, doi: 10.1016/j.swevo.2018.01.012.
[5] R. Capua, Y. Frota, L.S. Ochi, and T. Vidal, “A study on exponential-size neighborhoods for the bin packing problem with conflicts,” J. Heuristics, vol. 24, no. 4, pp. 667-695, 2018, doi: 10.1007/s10732-018-9372-2.
[6] R. Behmanesh, “Nephron Algorithm Optimization: Inspired of the Biologic Nephron Performance,” Int. J. Appl. Metaheuristic Comput., vol. 7, no. 1, pp. 38-64, 2016, doi: 10.4018/IJAMC.2016010103.
[7] A. Maton, J. Hopkins, C.W., McLaughlin, S. Johnson, M.Q. Warner, D. LaHart, and J.D. Wright, Human Biology and Health. Prentice Hall, Englewood Cliffs, 1993.
[8] H. Darcy, Les fontaines publiques de la ville de Dijon: exposition et application, par Henry Darcy. Victor Dalmont, 1856.
[9] A. Bejan, Convection heat transfer, John Wiley & Sons, Inc., 2013, doi: 10.1002/9781118671627.
[10] D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley 1989, ISBN 0-201-15767-5.
[11] E. Atashpaz-Gargari and C. Lucas, “Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition,” in IEEE Congr. Evol. Comput., Singapore, 2007, pp. 4661-4667, doi: 10.1109/CEC.2007.4425083.
[12] Y. Shi and R. Eberhart, “A modified particle swarm optimizer,” in IEEE Int. Conf. Evol. Comput. Proc., IEEE World Congr. Comput. Intell., Anchorage, AK, USA, 1998, pp. 69-73, doi: 10.1109/ICEC.1998.699146.
[13] D. Simon, “Biogeography-Based Optimization,” IEEE Trans. Evol. Comput., vol. 12, no. 6, pp. 702-713, 2008, doi: 10.1109/TEVC.2008.919004.
[14] D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm,” J. Glob. Optim., vol. 39, no. 3, pp. 459-471, 2007, doi: 10.1007/s10898-007-9149-x.
[15] J. Salimisartaghti and S. Goli-Bidgoli, “A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms,” Soft Comput. J., vol. 8, no. 1, pp. 14-28, 2019, doi: 10.22052/8.1.14 [In Persian].
[16] M. Mohammadpour, B. Minaei, and H. Parvin, “Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems,” Soft Comput. J., vol. 8, no. 2, pp. 38-65, 2020, doi: 10.22052/8.2.38 [In Persian].
[17] M.P. Akbarpour, K. Khamforoosh, and V. Maihami, “An approach to Improve Particle Swarm Optimization Algorithm Using CUDA,” Soft Comput. J., vol. 8, no. 2, pp. 2-21, 2020, doi: 10.22052/8.2.2 [In Persian].
[18] S. Surjanovic and D. Bingham, D., (August 2017), Optimization Test Problems, Simon Fraser University, [Online], Available: https://www.sfu.ca/~ssurjano/optimization.html.