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

An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems

Osaba, Eneko*; Yang, Xin-She; Diaz, Fernando; Lopez-Garcia, Pedro; Carballedo, Roberto
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE2016-2DOI: 10.1016/j.engappai.2015.10.006
225被引3阅读
引用收藏
分享

摘要

Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or biosonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student's t-test, the Holm's test, and the Friedman test. We have also compared the convergence behavior shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases.

学科与关键词

关键词
Bat algorithmTraveling Salesman ProblemGenetic algorithmsCombinatorial optimizationRouting problems
相关
加载中…
  • A discrete bat algorithm based on Levy flights for Euclidean traveling salesman problem
    Saji, Yassine*; Barkatou, MohammedEXPERT SYSTEMS WITH APPLICATIONS, 2021, 172: 114639.被引 56
  • A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem
    Osaba, Eneko*; Del Ser, Javier; Sadollah, Ali; Bilbao, Miren Nekane; Camacho, DavidAPPLIED SOFT COMPUTING, 2018, 71: 277-290.被引 82
  • A discrete tree-seed algorithm for solving symmetric traveling salesman problem
    Cinar, Ahmet Cevahir*; Korkmaz, Sedat; Kiran, Mustafa ServetEngineering Science and Technology-An International Journal-JESTECH, 2020, 23(4): 879-890.被引 51
查看全部 →

发表信息

论文状态
公开发表
期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
发表日期
2016-02
卷期
第 48 卷
页码
59-71
DOI
10.1016/j.engappai.2015.10.006
语言
ENGLISH
成果收录
SCIE
资助标注
European Union [636220]; Spanish Ministry of Economy and Competitiveness [TEC2013-45585-C2-2-R]; Basque Government [PC2013-71A]; H2020 Societal Challenges Programme [636220] Funding Source: H2020 Societal Challenges Programme

作者

  • O

    Osaba, Eneko (通讯) (第一作者)

  • Y

    Yang, Xin-She

查看全部 5 位作者收起作者
  • D

    Diaz, Fernando

  • L

    Lopez-Garcia, Pedro

  • C

    Carballedo, Roberto

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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