ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem

Palominos, Pedro; Ortega, Carla; Alfaro, Miguel; Fuertes, Guillermo*; Vargas, Manuel; Camargo, Mauricio; Parada, Victor; Gatica, Gustavo
COMPLEXITY2022-10-11DOI: 10.1155/2022/8903005
1被引1阅读
引用收藏
分享

摘要

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.

学科与关键词

关键词
PARTICLE SWARM OPTIMIZATIONNEURAL-NETWORKSGENETIC ALGORITHMSALESMANMARRIAGESEARCHSTATEBEES
相关
加载中…
  • Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
    Marinakis, Yannis*; Marinaki, Magdalene; Dounias, GeorgiosInformation Sciences, 2011, 181(20): 4684-4698.被引 79
  • Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances
    Rahman, Md Ashikur*; Sokkalingam, Rajalingam; Othman, Mahmod; Biswas, Kallol; Abdullah, Lazim; Abdul Kadir, EvizalMathematics, 2021, 9(20): 2633.被引 29
  • Hybrid Metaheuristics in Combinatorial Optimization: A Tutorial
    Christian, BlumTheory and Practice of Natural Computing, Springer Berlin Heidelberg, 1-10, 2012.
查看全部 →

发表信息

论文状态
公开发表
期刊
COMPLEXITY
发表日期
2022-10-11
卷期
第 2022 卷
页码
8903005
DOI
10.1155/2022/8903005
语言
ENGLISH
期刊等级
4区
成果收录
SCIE
资助标注
DICYT (Scientific and Technological Research Bureau) of the University of Santiago of Chile (USACH); Department of Industrial Engineering; Fondecyt (Chile) [11200993]

作者

  • P

    Palominos, Pedro (第一作者)

  • O

    Ortega, Carla

查看全部 8 位作者收起作者
  • A

    Alfaro, Miguel

  • F

    Fuertes, Guillermo (通讯)

  • V

    Vargas, Manuel

  • C

    Camargo, Mauricio

  • P

    Parada, Victor

  • G

    Gatica, Gustavo

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417