Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem

Schmitt, Murilo Falleiros Lemos; Mulati, Mauro Henrique; Constantino, Ademir Aparecido; Hernandes, Fábio; Hild, T.

doi:10.3897/jucs.2020.016

Cited by 1 publication

(2 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], a local search algorithm called JB local search is implemented, which consists of eliminating the columns that exceed a cost threshold from the solution.…”

Section: The Solution Perturbation Operator Based On the K-nearest Ne...mentioning

confidence: 99%

See 1 more Smart Citation

Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping

Quemá-Taimbud,

Mendoza-Becerra,

Bedoya-Leyva

2023

Rev. Fac. Ing.

View full text Add to dashboard Cite

The set covering problem (SCP) is a classical combinatorial optimization problem part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as set covering problems (SCPs), such as locating emergency services, military planning, and decision-making in a COVID-19 pandemic context. Among the approaches that this type of problem has solved are heuristic (H) and metaheuristic (MH) algorithms, which integrate iterative methods and procedures to explore and exploit the search space intelligently. In the present research, we carry out a systematic mapping of the literature focused on the initialization and local search methods used in these algorithms that have been applied to the SCP in order to identify them and that they can be applied in other algorithms. This mapping was carried out in three main stages: research planning, implementation, and documentation of results. The results indicate that the most used initialization method is random with heuristic search, and the inclusion of local search methods in MH algorithms improves the results obtained in comparison to those without local search. Moreover, initialization and local search methods can be used to modify other algorithms and evaluate the impact they generate on the results obtained.

show abstract

“…In [25], a local search algorithm called JB local search is implemented, which consists of eliminating the columns that exceed a cost threshold from the solution.…”

Section: The Solution Perturbation Operator Based On the K-nearest Ne...mentioning

confidence: 99%

“…From the results obtained in Table 5, it can be seen that 40% of the studies adapt local search methods. In addition, it was observed in studies [23] [25] that adapting these methods to the base algorithm contributes to obtaining better results compared to the execution of the algorithm without applying local search.…”

Section: A Main Observationsmentioning

confidence: 99%