“…Among the main advantages of FPA we find: easy implementation, shorter computation time, broad flexibility, robust performance, intuitive structures and guarantee of fast convergence (Yang, 2012;Abdel-Raouf et al, 2014;Dubey et al, 2015;Nigdeli et al, 2016;He et al, 2017;Abdel-Basset & Shawky, 2019). In fact, FPA has already been successfully used in complex applications such as: constrained global optimization (Abdel-Raouf et al, 2014), economic dispatch (Prathiba et al, 2014;Dubey et al, 2015), assembly sequence optimization (Mishra & Deb, 2019), analysis of micro-CT scans (Kowalski et al, 2019), simulation of photovoltaic systems (Alam et al, 2015), EEG-based person identification (Rodrigues et al, 2016), knapsack problems Abdel-Basset & Zhou, 2018), the spherical traveling salesman problem (Zhou et al, 2019), ill-conditioned sets of equations , quadratic assignment (Abdel-Baset et al, 2017b), antenna positioning (Dahi et al, 2016), wireless sensor optimization (Sharawi et al, 2014), or sizing optimization of truss structures (Bekdas ¸et al, 2015), among others. Recently, FPA has also been applied in hybrid proposals with other nature-inspired algorithms, such as tabu search, simulated annealing or particle swarm optimization (Lenin et al, 2014;Abdel-Baset & Hezam, 2015;Hezam et al, 2016;.…”