2018
DOI: 10.1007/978-3-030-04097-0_2
|View full text |Cite
|
Sign up to set email alerts
|

Metaheuristics and Data Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 141 publications
0
1
0
Order By: Relevance
“…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).…”
Section: Ua-flp Problem Definition and Literature Reviewmentioning
confidence: 99%
“…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).…”
Section: Ua-flp Problem Definition and Literature Reviewmentioning
confidence: 99%
“…Metaheuristic methods are Simple and mainly inspired by physical phenomena, animal behaviors, or evolutionary concepts. The flexibility of metaheuristics demonstrates the use of these methods in various ways without making any specific changes to the algorithm structure [7], [8]. Since problems are considered as black boxes in the metaheuristic method, they are easily applied to different problems.…”
Section: Introductionmentioning
confidence: 99%