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

A discrete tree-seed algorithm for solving symmetric traveling salesman problem

Cinar, Ahmet Cevahir*; Korkmaz, Sedat; Kiran, Mustafa Servet
Engineering Science and Technology-An International Journal-JESTECH2020-8DOI: 10.1016/j.jestch.2019.11.005
51被引2阅读
引用收藏
分享

摘要

Tree-Seed algorithm (TSA) is a recently developed nature inspired population-based iterative search algorithm. TSA is proposed for solving continuous optimization problems by inspiring the relations between trees and their seeds. The constrained and binary versions of TSA are present in the literature but there is no discrete version of TSA which decision variables represented as integer values. In the present work, the basic TSA is redesigned by integrating the swap, shift, and symmetry transformation operators in order to solve the permutation-coded optimization problems and it is called as DTSA. In the basic TSA, the solution update rules can be used for the decision variables whose are defined in continuous solution space, this rules are replaced with the transformation operators in the proposed DTSA. In order to investigate the performance of DTSA, well-known symmetric traveling salesman problems are considered in the experiments. The obtained results are compared with well-known metaheuristic algorithms and their variants, such as Ant Colony Optimization (ACO), Genetic Algorithm (GA), Simulated Annealing (SA), State Transition Algorithm (STA), Artificial Bee Colony (ABC), Black Hole (BH), and Particle Swarm Optimization (PSO). Experimental results show that DTSA is another qualified and competitive solver on discrete optimization.

学科与关键词

关键词
Tree seed algorithmTransformation operatorTraveling salesman problemDiscrete optimizationMetaheuristic
相关
加载中…
  • 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
  • A Novel Crossover based Discrete Artificial Algae Algorithm for Solving Traveling Salesman Problem
    Nureddin, Refik*; Koc, Ismail; Uymaz, Sait AliInternational Arab Journal of Information Technology, 2024, 21(5): 938-952.
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
Engineering Science and Technology-An International Journal-JESTECH
发表日期
2020-08
卷期
第 23 卷, 第 4 期
页码
879-890
DOI
10.1016/j.jestch.2019.11.005
期刊收录
NSL.SCIE
期刊等级
3区
成果收录
SCIE

作者

  • C

    Cinar, Ahmet Cevahir (通讯) (第一作者)

  • K

    Korkmaz, Sedat

查看全部 3 位作者收起作者
  • K

    Kiran, Mustafa Servet

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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