Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem
No hay miniatura disponible
Archivos
Fecha
2022
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Hindawi Limited
Nombre de Curso
Licencia CC
Attribution 4.0 International
CC BY 4.0
Deed
Licencia CC
https://creativecommons.org/licenses/by/4.0/
Resumen
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.
Notas
Indexación: Scopus.
Palabras clave
Algorithm approaches, Chaotics, Combinatorial optimization problems, Improving techniques, Initial solution, Marriage in honey-bee optimizations, Optimization algorithms, Performance, Traveling salesperson problem, Workers
Citación
Complexity, Volume 2022, 2022, Article number 8903005
DOI
10.1155/2022/8903005