Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem
dc.contributor.author | Palominos, Pedro | |
dc.contributor.author | Ortega, Carla | |
dc.contributor.author | Alfaro, Miguel | |
dc.contributor.author | Fuertes, Guillermo | |
dc.contributor.author | Vargas, Manuel | |
dc.contributor.author | Camargo, Mauricio | |
dc.contributor.author | Parada, Victor | |
dc.contributor.author | Gatica, Gustavo | |
dc.date.accessioned | 2024-10-04T14:41:07Z | |
dc.date.available | 2024-10-04T14:41:07Z | |
dc.date.issued | 2022 | |
dc.description | Indexación: Scopus. | |
dc.description.abstract | Due to the difficulty in solving combinatorial optimization problems, it is necessary to improve the performance of the algorithms by improving techniques to deal with complex optimizations. This research addresses the metaheuristics of marriage in honey-bees optimization (MBO) based on the behavior of bees. The current study proposes a technique for solving combinatorial optimization problems within proper computation times. The purpose of this study focuses on the travelling salesperson problem and the application of chaotic methods in important sections of the MBO metaheuristic. Three experiments were conducted to measure the efficiency and quality of the solutions: (1) MBO with chaos to generate initial solutions (MBO2); (2) MBO with chaos in the workers (MBO3); and (3) MBO with chaos to generate initial solutions and the workers (MBO4). The application of chaotic functions in MBO was significantly better at solving the travelling salesperson problem. © 2022 Pedro Palominos et al. | |
dc.description.uri | https://onlinelibrary-wiley-com.recursosbiblioteca.unab.cl/doi/10.1155/2022/8903005 | |
dc.identifier.citation | Complexity, Volume 2022, 2022, Article number 8903005 | |
dc.identifier.doi | 10.1155/2022/8903005 | |
dc.identifier.issn | 1076-2787 | |
dc.identifier.uri | https://repositorio.unab.cl/handle/ria/61002 | |
dc.language.iso | en | |
dc.publisher | Hindawi Limited | |
dc.rights.license | Attribution 4.0 International CC BY 4.0 Deed | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | Algorithm approaches | |
dc.subject | Chaotics | |
dc.subject | Combinatorial optimization problems | |
dc.subject | Improving techniques | |
dc.subject | Initial solution | |
dc.subject | Marriage in honey-bee optimizations | |
dc.subject | Optimization algorithms | |
dc.subject | Performance | |
dc.subject | Traveling salesperson problem | |
dc.subject | Workers | |
dc.title | Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem | |
dc.type | Artículo |
Archivos
Bloque original
1 - 1 de 1
No hay miniatura disponible
- Nombre:
- Palominos_Chaotic_Honeybees_Optimization_Algorithms_Approach.pdf
- Tamaño:
- 750.96 KB
- Formato:
- Adobe Portable Document Format
- Descripción:
- TEXTO COMPLETO EN INGLÉS
Bloque de licencias
1 - 1 de 1
No hay miniatura disponible
- Nombre:
- license.txt
- Tamaño:
- 1.71 KB
- Formato:
- Item-specific license agreed upon to submission
- Descripción: