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

Solving travelling salesman problem using black hole algorithm

Hatamlou, Abdolreza*
SOFT COMPUTING2018-12DOI: 10.1007/s00500-017-2760-y
44被引1阅读
引用收藏
分享

摘要

Over the last few decades, many nature-inspired algorithms have been proposed for solving complex and difficult problems. Each algorithm has its own merits and drawbacks. One of the most recent nature-inspired algorithms, which has been applied successfully in many applications, is black hole (BH) algorithm. BH algorithm is a population-based meta-heuristic algorithm that is inspired by the black hole phenomenon. It starts with a random population of solutions to the given optimization problem. The most excellent solution at each iteration which has the best fitness is chosen to be the black hole and the other form the stars. The black hole pulls the stars towards it and causes them to search the problem space for finding optimal solution. In this paper, the application of the BH algorithm on solving travelling salesman problem (TSP) is investigated. The aim of TSP is to find a tour in a set of cities in such a way, each city is visited exactly once and return to the starting city where the length of the tour is minimized. In order to evaluate the efficiency of the BH algorithm, it has been tested on several benchmark data sets and compared to other well-known algorithms. The experimental results show that the BH algorithm can find high-quality solutions compared to genetic algorithm, ant colony optimization and particle swarms optimization algorithms. Moreover, the BH algorithm is faster than other test algorithms.

学科与关键词

关键词
Black hole algorithmTravelling salesman problemMeta-heuristic algorithms
相关
加载中…
  • Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
    Marinakis, Yannis*; Marinaki, Magdalene; Dounias, GeorgiosInformation Sciences, 2011, 181(20): 4684-4698.被引 79
  • 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
  • An Binary Black Hole Algorithm to Solve Set Covering Problem
    Álvaro Gómez, Rubio; Broderick, Crawford; Ricardo, Soto; Adrián, Jaramillo; Sebastián Mansilla, Villablanca; Juan, Salas; Eduardo, OlguínTrends in Applied Knowledge-Based Systems and Data Science, Springer International Publishing, 873-883, 2016.
查看全部 →

发表信息

论文状态
公开发表
期刊
SOFT COMPUTING
发表日期
2018-12
卷期
第 22 卷, 第 24 期
页码
8167-8175
DOI
10.1007/s00500-017-2760-y
语言
ENGLISH
期刊等级
Q2
成果收录
SCIE

作者

  • H

    Hatamlou, Abdolreza (通讯) (第一作者)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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