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

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, David
APPLIED SOFT COMPUTING2018-10DOI: 10.1016/j.asoc.2018.06.047
82被引4阅读
引用收藏
分享

摘要

The water cycle algorithm (WCA) is a nature-inspired meta-heuristic recently contributed to the community in 2012, which finds its motivation in the natural surface runoff phase in water cycle process and on how streams and rivers flow into the sea. This method has been so far successfully applied to many engineering applications, spread over a wide variety of application fields. In this paper an enhanced discrete version of the WCA (coined as DWCA) is proposed for solving the Symmetric and Asymmetric Traveling Salesman Problem. Aimed at proving that the developed approach is a promising approximation method for solving this family of optimization problems, the designed solver has been tested over 33 problem datasets, comparing the obtained outcomes with the ones got by six different algorithmic counterparts from the related literature: genetic algorithm, island-based genetic algorithm, evolutionary simulated annealing, bat algorithm, firefly algorithm and imperialist competitive algorithm. Furthermore, the statistical significance of the performance gaps found in this benchmark is validated based on the results from non-parametric tests, not only in terms of optimality but also in regards to convergence speed. We conclude that the proposed DWCA approach outperforms-with statistical significance- any other optimization technique in the benchmark in terms of both computation metrics.

学科与关键词

关键词
Routing problemsWater cycle algorithmTraveling salesman problemCombinatorial optimization
相关
加载中…
  • A comprehensive review on water cycle algorithm and its applications
    Nasir, Mohammad; Sadollah, Ali; Choi, Young Hwan; Kim, Joong Hoon*NEURAL COMPUTING & APPLICATIONS, 2020, 32(23): 17433-17488.被引 49
  • 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 Sine-Cosine Algorithm (DSCA) with Local Search for Solving Traveling Salesman Problem
    Tawhid, Mohamed A.; Savsani, Poonam*ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2019, 44(4): 3669-3679.被引 30
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2018-10
卷期
第 71 卷
页码
277-290
DOI
10.1016/j.asoc.2018.06.047
语言
ENGLISH
期刊等级
Q1
成果收录
SCIE
资助标注
Basque Government through the ELKARTEK program [KK-2015/0000080]; Basque Government through the ELKARTEK program (BID3ABI project); H2020 programme of the European Commission [691735]; H2020 Societal Challenges Programme [691735] Funding Source: H2020 Societal Challenges Programme

作者

  • O

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

  • D

    Del Ser, Javier

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

    Sadollah, Ali

  • B

    Bilbao, Miren Nekane

  • C

    Camacho, David

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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