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

A discrete bat algorithm based on Levy flights for Euclidean traveling salesman problem

Saji, Yassine*; Barkatou, Mohammed
EXPERT SYSTEMS WITH APPLICATIONS2021-6-15DOI: 10.1016/j.eswa.2021.114639
56被引1阅读
引用收藏
分享

摘要

Bat algorithm is a swarm-intelligence-based metaheuristic proposed in 2010. This algorithm was inspired by echolocation behavior of bats when searching their prey in nature. Since it first introduction, it continues to be used extensively until today, owing to its simplicity, easy handling and applicability to a wide range of problems. However, sometimes the major challenge faced by this technique is can be trapped in a local optimum when facing large complex problems. In this research work, a new discrete bat algorithm is proposed to solve the famous traveling salesman problem as NP-hard combinatorial optimization problem. To enhance the searching strategy and to avoid getting stuck in local minima, random walks based on Le & acute;vy's flights are combined with bat's movement. In addition, to improve the diversity and convergence of the swarm, a neutral crossover operator is embedded to the proposed algorithm. To evaluate the performance of our proposal, two experiments are conducted on 38 benchmark datasets and the obtained results are compared with eight different approaches. Furthermore, the student's t-test, the Friedman's test and the post hoc Wilcoxon's test are performed to check whether there are significant differences between the proposed optimizer and the alternative techniques. The experimental results under comparative studies have shown that, in most cases, the proposed discrete bat algorithm yields significantly better results compared with its competitors.

学科与关键词

关键词
Bat algorithmTraveling salesman problemNP-hard combinatorial optimization problemPopulation-based metaheuristicsLevy flights
相关
加载中…
  • An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
    Osaba, Eneko*; Yang, Xin-She; Diaz, Fernando; Lopez-Garcia, Pedro; Carballedo, RobertoENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 48: 59-71.被引 225
  • Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem
    Zhong, Yiwen*; Lin, Juan; Wang, Lijin; Zhang, HuiSwarm and Evolutionary Computation, 2018, 42: 77-88.被引 78
  • Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
    Marinakis, Yannis*; Marinaki, Magdalene; Dounias, GeorgiosInformation Sciences, 2011, 181(20): 4684-4698.被引 79
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2021-06-15
卷期
第 172 卷
页码
114639
DOI
10.1016/j.eswa.2021.114639
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE

作者

  • S

    Saji, Yassine (通讯) (第一作者)

  • B

    Barkatou, Mohammed

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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