Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos

Autores:
Quemá-Taimbud, Nelson-Enrique
Mendoza-Becerra, Martha-Eliana
Tipo de recurso:
Article of journal
Fecha de publicación:
2024
Institución:
Universidad Pedagógica y Tecnológica de Colombia
Repositorio:
RiUPTC: Repositorio Institucional UPTC
Idioma:
OAI Identifier:
oai:repositorio.uptc.edu.co:001/21592
Acceso en línea:
https://repositorio.uptc.edu.co/handle/001/21592
https://doi.org/10.19053/uptc.01211129.v33.n68.2024.18079
Palabra clave:
Set Covering Problem
Combinatorial Optimisation
Metaheuristic Algorithms
Artificial Bee Colony
Problema de Cobertura de Conjuntos
Optimizacion Combinatoria
Algoritmos Metaheuristicos
Colonia de Abejas Artificiales
Rights
openAccess
License
Nelson-Enrique Quemá-Taimbud, Martha-Eliana Mendoza-Becerra - 2024
id REPOUPTC2_7ef7d61f051c7ae5bdb0addb36db7b89
oai_identifier_str oai:repositorio.uptc.edu.co:001/21592
network_acronym_str REPOUPTC2
network_name_str RiUPTC: Repositorio Institucional UPTC
repository_id_str
dc.title.es-ES.fl_str_mv Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
title Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
spellingShingle Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
Set Covering Problem
Combinatorial Optimisation
Metaheuristic Algorithms
Artificial Bee Colony
Problema de Cobertura de Conjuntos
Optimizacion Combinatoria
Algoritmos Metaheuristicos
Colonia de Abejas Artificiales
title_short Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
title_full Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
title_fullStr Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
title_full_unstemmed Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
title_sort Algoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de Conjuntos
dc.creator.fl_str_mv Quemá-Taimbud, Nelson-Enrique
Mendoza-Becerra, Martha-Eliana
dc.contributor.author.eng.fl_str_mv Quemá-Taimbud, Nelson-Enrique
Mendoza-Becerra, Martha-Eliana
dc.subject.none.fl_str_mv Set Covering Problem
Combinatorial Optimisation
Metaheuristic Algorithms
Artificial Bee Colony
Problema de Cobertura de Conjuntos
Optimizacion Combinatoria
Algoritmos Metaheuristicos
Colonia de Abejas Artificiales
topic Set Covering Problem
Combinatorial Optimisation
Metaheuristic Algorithms
Artificial Bee Colony
Problema de Cobertura de Conjuntos
Optimizacion Combinatoria
Algoritmos Metaheuristicos
Colonia de Abejas Artificiales
publishDate 2024
dc.date.accessioned.none.fl_str_mv 2024-06-02 21:19:09
2026-04-16T17:47:39Z
dc.date.available.none.fl_str_mv 2024-06-02 21:19:09
dc.date.issued.none.fl_str_mv 2024-06-02
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.coar.none.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.driver.none.fl_str_mv info:eu-repo/semantics/article
dc.type.local.eng.fl_str_mv Journal article
dc.type.version.none.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.content.none.fl_str_mv Text
dc.type.coarversion.none.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.issn.none.fl_str_mv 0121-1129
dc.identifier.uri.none.fl_str_mv https://repositorio.uptc.edu.co/handle/001/21592
dc.identifier.doi.none.fl_str_mv 10.19053/uptc.01211129.v33.n68.2024.18079
dc.identifier.eissn.none.fl_str_mv 2357-5328
dc.identifier.url.none.fl_str_mv https://doi.org/10.19053/uptc.01211129.v33.n68.2024.18079
identifier_str_mv 0121-1129
10.19053/uptc.01211129.v33.n68.2024.18079
2357-5328
url https://repositorio.uptc.edu.co/handle/001/21592
https://doi.org/10.19053/uptc.01211129.v33.n68.2024.18079
dc.language.iso.none.fl_str_mv
language_invalid_str_mv
dc.relation.references.none.fl_str_mv T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, Third edition. Cambridge, MA: MIT Press, 2009.
Y. Deng, Y. Zhang, J. Pan, “Optimization for Locating Emergency Medical Service Facilities: A Case Study for Health Planning from China,” Risk Management and Healthcare Policy, vol. 14, pp. 1791-1802, Apr. 2021. https://doi.org/10.2147/RMHP.S304475
J. Purnomo, Z. Fanani, T. Domai, A. Hariswanto, “The Model For Determining Location Of Naval Base Using AHP Method And Set Covering Problem,” Russian Journal of Agricultural and Socio-economic Sciences, vol. 101, no. 5, pp. 122-131, May 2020. https://doi.org/10.18551/rjoas.2020-05.13
Q. Yong, D. Liu, G. Li, W. Wu, W. Sun, S. Liu, “Reducing exposure to COVID-19 by improving access to fever clinics: an empirical research of the Shenzhen area of China,” BMC Health Services Research., vol. 21, no. 1, pp. 1-10, Sep. 2021. https://doi.org/10.1186/S12913-021-06831-4
L. Jorquera, P. Valenzuela, M. Valenzuela, H. Pinto, “A Binary Ant Lion Optimisation Algorithm Applied to the Set Covering Problem,” in Artificial Intelligence Methods in Intelligent Algorithms, R. Silhavy, Ed. Cham: Springer International Publishing, 2019, pp. 156-167. https://doi.org/10.1007/978-3-030-19810-7_16
B. Crawford, R. Soto, A. Peña, G. Astorga, “A Binary Grasshopper Optimisation Algorithm Applied to the Set Covering Problem,” in Cybernetics and Algorithms in Intelligent Systems, R. Silhavy, Ed. Cham: Springer International Publishing, 2019, pp. 1-12. https://doi.org/10.1007/978-3-319-91192-2_1
B. Crawford et al., “Binary Fruit Fly Swarm Algorithms for the Set Covering Problem,” Computers, Materials and Continua, vol. 71, no. 2, pp. 4295-4318, Jan. 2022. https://doi.org/10.32604/cmc.2022.023068
B. Crawford et al., “A teaching-learning-based optimization algorithm for the weighted set-covering problem,” Tehnički Vjesnik, vol. 27, no. 5, pp. 1678-1684, 2020. https://doi.org/10.17559/TV-20180501230511
B. Crawford, R. Soto, G. Cabrera, A. Salas-Fernández, F. Paredes, “Using a Social Media Inspired Optimization Algorithm to Solve the Set Covering Problem,” in Social Computing and Social Media. Design, Human Behavior and Analytics, G. Meiselwitz, Ed. Cham: Springer International Publishing, 2019, pp. 43-52. https://doi.org/10.1007/978-3-030-21902-4_4
S. Sundar, A. Singh, “A hybrid heuristic for the set covering problem,” Operations Research, vol. 12, no. 3, pp. 345-365, Nov. 2012. https://doi.org/10.1007/s12351-010-0086-y
F. Xu, J. Li, “A hybrid encoded memetic algorithm for set covering problem,” in Proceedings 10th International Conference on Advanced Computational Intelligence, ICACI 2018, IEEE, Xiamen, China, 2018, pp. 552-557. https://doi.org/10.1109/ICACI.2018.8377519
B. Crawford et al., “A binary monkey search algorithm variation for solving the set covering problem,” Nature Computational, vol. 19, no. 4, pp. 825-841, Dic. 2020. https://doi.org/10.1007/s11047-019-09752-8
J. García, B. Crawford, R. Soto, P. García, “A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem,” in Harmony Search Algorithm, J. Del Ser, Ed. Singapore: Springer Singapore, 2017, pp. 42-51. https://doi.org/10.1007/978-981-10-3728-3_6
E. Meca Castro, “Two Neighbourhood-based Approaches for the Set Covering Problem,” U.Porto Journal of Engineering., vol. 5, no. 1, pp. 1-15, Feb. 2019. https://doi.org/10.24840/2183-6493_005.001_0001
M. F. L. Schmitt, M. H. Mulati, A. A. Constantino, F. Hernandes, T. A. Hild, “Ant-set: A subset-oriented ant colony optimization algorithm for the set covering problem,” Journal of Universal Computer Science, vol. 26, no. 2, pp. 293-316, Feb. 2020. https://doi.org/10.3897/jucs.2020.016
B. Crawford, R. Soto, G. Astorga, J. Lemus-Romani, S. Misra, J.-M. Rubio, “An Adaptive Intelligent Water Drops Algorithm for Set Covering Problem,” in 19th International Conference on Computational Science and Its Applications, IEEE, St. Petersburg, Russia, 2019, pp. 39-45. https://doi.org/10.1109/ICCSA.2019.000-6
R. Soto et al., “Adaptive Black Hole Algorithm for Solving the Set Covering Problem,” Mathematical Problems in Engineering, vol. 2018, pp. 1-23, Oct. 2018. https://doi.org/10.1155/2018/2183214
G. Lin, J. Luo, X. Chen, H. Xu, M. Xu, “An Adaptive Feasible and Infeasible Search Algorithm for Solving the Set Covering Problem,” in Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, H. Meng, T. Lei, M. Li, K. Li, N. Xiong, y L. Wang, Eds. Cham: Springer International Publishing, 2021, pp. 271-278. https://doi.org/10.1007/978-3-030-70665-4_31
B. Crawford, R. Soto, E. Monfroy, G. Astorga, J. García, E. Cortes, “A Meta-Optimization Approach for Covering Problems in Facility Location,” in Communications in Computer and Information Science, J. Figueroa-García, E. López-Santana, J. Villa-Ramírez, and R. Ferro-Escobar, Eds. Cham: Springer Verlag, 2017, pp. 565-578. https://doi.org/10.1007/978-3-319-66963-2_50
K. S. Pratt, K. S. Pratt, H. Bright, “Design Patterns for Research Methods: Iterative Field Research,” in AAAI Spring Symposia, California, United States, 2009, pp. 1-7.
N.-E. Quemá-Taimbud, M.-E. Mendoza-Becerra, O.-F. Bedoya-Leyva, “Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping,” Revista Facultad de Ingeniería, vol. 32, no. 63, e15235, Feb. 2023. https://doi.org/10.19053/01211129.v32.n63.2023.15235
H. Razip, N. Zakaria, “Genetic Algorithm with Approximation Algorithm Based Initial Population for the Set Covering Problem,” in Proceedings of International Conference on Communication and Computational Technologies, Singapore: Springer, 2021, pp. 59-78. https://doi.org/10.1007/978-981-16-3246-4_6
J. E. Beasley, OR-Library: A collection of test data sets for a variety of operations research (or) problems. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/scpinfo.html
S. Balaji, N. Revathi, “A new approach for solving set covering problem using jumping particle swarm optimization method,” Natural Computacional, vol. 15, no. 3, pp. 503-517, Sep. 2016. https://doi.org/10.1007/s11047-015-9509-2
D. H. Wolpert, W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67-82, Apr. 1997. https://doi.org/10.1109/4235.585893
dc.relation.citationendpage.none.fl_str_mv e18079
dc.relation.citationissue.eng.fl_str_mv 68
dc.relation.citationstartpage.none.fl_str_mv e18079
dc.relation.citationvolume.eng.fl_str_mv 33
dc.relation.ispartofjournal.eng.fl_str_mv Revista Facultad de Ingeniería
dc.relation.bitstream.none.fl_str_mv https://revistas.uptc.edu.co/index.php/ingenieria/article/download/18079/15694
https://revistas.uptc.edu.co/index.php/ingenieria/article/download/18079/15719
dc.relation.citationedition.eng.fl_str_mv Núm. 68 , Año 2024 : April-June 2024 (Continuous Publication)
dc.rights.none.fl_str_mv Nelson-Enrique Quemá-Taimbud, Martha-Eliana Mendoza-Becerra - 2024
dc.rights.uri.none.fl_str_mv https://creativecommons.org/licenses/by/4.0
dc.rights.accessrights.none.fl_str_mv info:eu-repo/semantics/openAccess
dc.rights.creativecommons.none.fl_str_mv This work is licensed under a Creative Commons Attribution 4.0 International License.
dc.rights.coar.none.fl_str_mv http://purl.org/coar/access_right/c_abf2
rights_invalid_str_mv Nelson-Enrique Quemá-Taimbud, Martha-Eliana Mendoza-Becerra - 2024
https://creativecommons.org/licenses/by/4.0
This work is licensed under a Creative Commons Attribution 4.0 International License.
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.mimetype.none.fl_str_mv application/pdf
text/xml
dc.publisher.eng.fl_str_mv Universidad Pedagógica y Tecnológica de Colombia
dc.source.none.fl_str_mv https://revistas.uptc.edu.co/index.php/ingenieria/article/view/18079
institution Universidad Pedagógica y Tecnológica de Colombia
bitstream.url.fl_str_mv https://repositorio.uptc.edu.co/bitstreams/e5933a13-c965-4f14-9333-4a8f0cae14d4/download
bitstream.checksum.fl_str_mv 033a93fff1f33f4da39eee266fde6036
bitstream.checksumAlgorithm.fl_str_mv MD5
repository.name.fl_str_mv Repositorio Institucional UPTC
repository.mail.fl_str_mv bdigital@metabiblioteca.com
_version_ 1881673958885949440
spelling Quemá-Taimbud, Nelson-EnriqueMendoza-Becerra, Martha-Eliana2024-06-02 21:19:092026-04-16T17:47:39Z2024-06-02 21:19:092024-06-020121-1129https://repositorio.uptc.edu.co/handle/001/2159210.19053/uptc.01211129.v33.n68.2024.180792357-5328https://doi.org/10.19053/uptc.01211129.v33.n68.2024.18079application/pdftext/xmlUniversidad Pedagógica y Tecnológica de ColombiaNelson-Enrique Quemá-Taimbud, Martha-Eliana Mendoza-Becerra - 2024https://creativecommons.org/licenses/by/4.0info:eu-repo/semantics/openAccessThis work is licensed under a Creative Commons Attribution 4.0 International License.http://purl.org/coar/access_right/c_abf2https://revistas.uptc.edu.co/index.php/ingenieria/article/view/18079Set Covering ProblemCombinatorial OptimisationMetaheuristic AlgorithmsArtificial Bee ColonyProblema de Cobertura de ConjuntosOptimizacion CombinatoriaAlgoritmos MetaheuristicosColonia de Abejas ArtificialesAlgoritmo de Colonia de Abejas Artificiales modificado para el Problema de Cobertura de ConjuntosArtículo de revistahttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1info:eu-repo/semantics/articleJournal articleinfo:eu-repo/semantics/publishedVersionTexthttp://purl.org/coar/version/c_970fb48d4fbd8a85T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, Third edition. Cambridge, MA: MIT Press, 2009.Y. Deng, Y. Zhang, J. Pan, “Optimization for Locating Emergency Medical Service Facilities: A Case Study for Health Planning from China,” Risk Management and Healthcare Policy, vol. 14, pp. 1791-1802, Apr. 2021. https://doi.org/10.2147/RMHP.S304475J. Purnomo, Z. Fanani, T. Domai, A. Hariswanto, “The Model For Determining Location Of Naval Base Using AHP Method And Set Covering Problem,” Russian Journal of Agricultural and Socio-economic Sciences, vol. 101, no. 5, pp. 122-131, May 2020. https://doi.org/10.18551/rjoas.2020-05.13Q. Yong, D. Liu, G. Li, W. Wu, W. Sun, S. Liu, “Reducing exposure to COVID-19 by improving access to fever clinics: an empirical research of the Shenzhen area of China,” BMC Health Services Research., vol. 21, no. 1, pp. 1-10, Sep. 2021. https://doi.org/10.1186/S12913-021-06831-4L. Jorquera, P. Valenzuela, M. Valenzuela, H. Pinto, “A Binary Ant Lion Optimisation Algorithm Applied to the Set Covering Problem,” in Artificial Intelligence Methods in Intelligent Algorithms, R. Silhavy, Ed. Cham: Springer International Publishing, 2019, pp. 156-167. https://doi.org/10.1007/978-3-030-19810-7_16B. Crawford, R. Soto, A. Peña, G. Astorga, “A Binary Grasshopper Optimisation Algorithm Applied to the Set Covering Problem,” in Cybernetics and Algorithms in Intelligent Systems, R. Silhavy, Ed. Cham: Springer International Publishing, 2019, pp. 1-12. https://doi.org/10.1007/978-3-319-91192-2_1B. Crawford et al., “Binary Fruit Fly Swarm Algorithms for the Set Covering Problem,” Computers, Materials and Continua, vol. 71, no. 2, pp. 4295-4318, Jan. 2022. https://doi.org/10.32604/cmc.2022.023068B. Crawford et al., “A teaching-learning-based optimization algorithm for the weighted set-covering problem,” Tehnički Vjesnik, vol. 27, no. 5, pp. 1678-1684, 2020. https://doi.org/10.17559/TV-20180501230511B. Crawford, R. Soto, G. Cabrera, A. Salas-Fernández, F. Paredes, “Using a Social Media Inspired Optimization Algorithm to Solve the Set Covering Problem,” in Social Computing and Social Media. Design, Human Behavior and Analytics, G. Meiselwitz, Ed. Cham: Springer International Publishing, 2019, pp. 43-52. https://doi.org/10.1007/978-3-030-21902-4_4S. Sundar, A. Singh, “A hybrid heuristic for the set covering problem,” Operations Research, vol. 12, no. 3, pp. 345-365, Nov. 2012. https://doi.org/10.1007/s12351-010-0086-yF. Xu, J. Li, “A hybrid encoded memetic algorithm for set covering problem,” in Proceedings 10th International Conference on Advanced Computational Intelligence, ICACI 2018, IEEE, Xiamen, China, 2018, pp. 552-557. https://doi.org/10.1109/ICACI.2018.8377519B. Crawford et al., “A binary monkey search algorithm variation for solving the set covering problem,” Nature Computational, vol. 19, no. 4, pp. 825-841, Dic. 2020. https://doi.org/10.1007/s11047-019-09752-8J. García, B. Crawford, R. Soto, P. García, “A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem,” in Harmony Search Algorithm, J. Del Ser, Ed. Singapore: Springer Singapore, 2017, pp. 42-51. https://doi.org/10.1007/978-981-10-3728-3_6E. Meca Castro, “Two Neighbourhood-based Approaches for the Set Covering Problem,” U.Porto Journal of Engineering., vol. 5, no. 1, pp. 1-15, Feb. 2019. https://doi.org/10.24840/2183-6493_005.001_0001M. F. L. Schmitt, M. H. Mulati, A. A. Constantino, F. Hernandes, T. A. Hild, “Ant-set: A subset-oriented ant colony optimization algorithm for the set covering problem,” Journal of Universal Computer Science, vol. 26, no. 2, pp. 293-316, Feb. 2020. https://doi.org/10.3897/jucs.2020.016B. Crawford, R. Soto, G. Astorga, J. Lemus-Romani, S. Misra, J.-M. Rubio, “An Adaptive Intelligent Water Drops Algorithm for Set Covering Problem,” in 19th International Conference on Computational Science and Its Applications, IEEE, St. Petersburg, Russia, 2019, pp. 39-45. https://doi.org/10.1109/ICCSA.2019.000-6R. Soto et al., “Adaptive Black Hole Algorithm for Solving the Set Covering Problem,” Mathematical Problems in Engineering, vol. 2018, pp. 1-23, Oct. 2018. https://doi.org/10.1155/2018/2183214G. Lin, J. Luo, X. Chen, H. Xu, M. Xu, “An Adaptive Feasible and Infeasible Search Algorithm for Solving the Set Covering Problem,” in Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, H. Meng, T. Lei, M. Li, K. Li, N. Xiong, y L. Wang, Eds. Cham: Springer International Publishing, 2021, pp. 271-278. https://doi.org/10.1007/978-3-030-70665-4_31B. Crawford, R. Soto, E. Monfroy, G. Astorga, J. García, E. Cortes, “A Meta-Optimization Approach for Covering Problems in Facility Location,” in Communications in Computer and Information Science, J. Figueroa-García, E. López-Santana, J. Villa-Ramírez, and R. Ferro-Escobar, Eds. Cham: Springer Verlag, 2017, pp. 565-578. https://doi.org/10.1007/978-3-319-66963-2_50K. S. Pratt, K. S. Pratt, H. Bright, “Design Patterns for Research Methods: Iterative Field Research,” in AAAI Spring Symposia, California, United States, 2009, pp. 1-7.N.-E. Quemá-Taimbud, M.-E. Mendoza-Becerra, O.-F. Bedoya-Leyva, “Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping,” Revista Facultad de Ingeniería, vol. 32, no. 63, e15235, Feb. 2023. https://doi.org/10.19053/01211129.v32.n63.2023.15235H. Razip, N. Zakaria, “Genetic Algorithm with Approximation Algorithm Based Initial Population for the Set Covering Problem,” in Proceedings of International Conference on Communication and Computational Technologies, Singapore: Springer, 2021, pp. 59-78. https://doi.org/10.1007/978-981-16-3246-4_6J. E. Beasley, OR-Library: A collection of test data sets for a variety of operations research (or) problems. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/scpinfo.htmlS. Balaji, N. Revathi, “A new approach for solving set covering problem using jumping particle swarm optimization method,” Natural Computacional, vol. 15, no. 3, pp. 503-517, Sep. 2016. https://doi.org/10.1007/s11047-015-9509-2D. H. Wolpert, W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 67-82, Apr. 1997. https://doi.org/10.1109/4235.585893e1807968e1807933Revista Facultad de Ingenieríahttps://revistas.uptc.edu.co/index.php/ingenieria/article/download/18079/15694https://revistas.uptc.edu.co/index.php/ingenieria/article/download/18079/15719Núm. 68 , Año 2024 : April-June 2024 (Continuous Publication)PublicationOREORE.xmltext/xml2629https://repositorio.uptc.edu.co/bitstreams/e5933a13-c965-4f14-9333-4a8f0cae14d4/download033a93fff1f33f4da39eee266fde6036MD51falseAnonymousREAD001/21592oai:repositorio.uptc.edu.co:001/215922026-10-29 14:05:15.526https://creativecommons.org/licenses/by/4.0metadata.onlyhttps://repositorio.uptc.edu.coRepositorio Institucional UPTCbdigital@metabiblioteca.com

Publicaciones similares