Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem
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...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2022/8903005 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832549263475736576 |
|---|---|
| author | Pedro Palominos Carla Ortega Miguel Alfaro Guillermo Fuertes Manuel Vargas Mauricio Camargo Victor Parada Gustavo Gatica |
| author_facet | Pedro Palominos Carla Ortega Miguel Alfaro Guillermo Fuertes Manuel Vargas Mauricio Camargo Victor Parada Gustavo Gatica |
| author_sort | Pedro Palominos |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-c6a7b79ba35647cb9f252713640679f6 |
| institution | Kabale University |
| issn | 1099-0526 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-c6a7b79ba35647cb9f252713640679f62025-02-03T06:11:52ZengWileyComplexity1099-05262022-01-01202210.1155/2022/8903005Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson ProblemPedro Palominos0Carla Ortega1Miguel Alfaro2Guillermo Fuertes3Manuel Vargas4Mauricio Camargo5Victor Parada6Gustavo Gatica7Industrial Engineering DepartmentIndustrial Engineering DepartmentIndustrial Engineering DepartmentIndustrial Engineering DepartmentIndustrial Engineering DepartmentUniversité de LorraineDepartment of Informatics EngineeringFacultad de IngenieríaDue 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.http://dx.doi.org/10.1155/2022/8903005 |
| spellingShingle | Pedro Palominos Carla Ortega Miguel Alfaro Guillermo Fuertes Manuel Vargas Mauricio Camargo Victor Parada Gustavo Gatica Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem Complexity |
| title | Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem |
| title_full | Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem |
| title_fullStr | Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem |
| title_full_unstemmed | Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem |
| title_short | Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem |
| title_sort | chaotic honeybees optimization algorithms approach for traveling salesperson problem |
| url | http://dx.doi.org/10.1155/2022/8903005 |
| work_keys_str_mv | AT pedropalominos chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT carlaortega chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT miguelalfaro chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT guillermofuertes chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT manuelvargas chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT mauriciocamargo chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT victorparada chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem AT gustavogatica chaotichoneybeesoptimizationalgorithmsapproachfortravelingsalespersonproblem |