Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm
Citations
5 citations
Cites methods from "Optimizing the Minimum Vertex Guard..."
...The approximate methods [3–6] and genetic algorithms [7, 8] are applicable for restricted versions of the problem....
[...]
5 citations
Cites background or methods or result from "Optimizing the Minimum Vertex Guard..."
...It is important to note that, using hybrid metaheuristics, we improved our previous results [4]....
[...]
...Combined with the genetic algorithms strategy, which was proposed in [4], these four approximation algorithms have...
[...]
...In [4], we concluded that the combination that best fits into our problem is to use the tournament selection method and a variant of the single point crossover, where the generated children cannot be clones of the parents, with a probability of pc = 80%....
[...]
...For more details on the method used to calculate this approximation ratio, please refer to [4]....
[...]
...Concerning the genetic operators selection and crossover, in [4], we conducted an experimental study using several choices for these operators....
[...]
5 citations
4 citations
4 citations
Cites background from "Optimizing the Minimum Vertex Guard..."
...extrapolate materials tagged to the entire scene, solutions to the Art Gallery problem would optimise the number of predictions required [24], [25]....
[...]
References
4,520 citations
3,287 citations
"Optimizing the Minimum Vertex Guard..." refers methods in this paper
...A metaheuristic is a general algorithmic framework which can be adapted to different optimization problems with minor adjustments (see [7, 11] for a comprehensive survey on the subject)....
[...]
2,284 citations
1,208 citations
"Optimizing the Minimum Vertex Guard..." refers methods in this paper
...A metaheuristic is a general algorithmic framework which can be adapted to different optimization problems with minor adjustments (see [7, 11] for a comprehensive survey on the subject)....
[...]