“…Among them, we can highlight some Deterministic Methods (Montreuil, 1991;Meller et al, 1998;Sherali et al, 2003;Castillo et al, 2005;Norman and Smith, 2006;Saraswat et al, 2015;Purnomo and Wiwoho, 2016) that have optimally solved the problem with up to 12 facilities (Chae and Regan, 2016). However, meta-heuristic proposals (Ramadas and Abraham, 2019) have been much more used to solve the UA-FLP, especially in problems with a large number of facilities, where deterministic approaches cannot be applied due to their excessive computational complexity. Examples of these meta-heuristics are Tabu Search (Scholz et al, 2009;Kulturel-Konak, 2012), Simulated Annealing (Tam, 1992), Genetic Algorithms (Tate and Smith, 1995;Azadivar and Wang, 2000;Wu and Appleton, 2002;Gomez et al, 2003;Enea et al, 2005;Aiello et al, 2006;Liu et al, 2005;Garcia-Hernandez et al, 2013b;García-Hernández et al, 2015;Palomo-Romero et al, 2017), Harmony Search (Kang and Chae, 2017), Ant Colonies (Komarudin and Wong, 2010;Wong and Komarudin, 2010;Kulturel-Konak and Konak, 2011;Liu, 2019), Coral Reefs Optimization (Garcia-Hernandez et al, 2019) and also other alternative meta-heuristics (Ulutas and Kulturel-Konak, 2012;Gonçalves and Resende, 2015;Sikaroudi and Shahanaghi, 2016;Paes et al, 2017).…”