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

Honey bees mating optimization algorithm for the Euclidean traveling salesman problem

Marinakis, Yannis*; Marinaki, Magdalene; Dounias, Georgios
Information Sciences2011-10-15DOI: 10.1016/j.ins.2010.06.032
79被引1阅读
引用收藏
分享

摘要

This paper introduces a new hybrid algorithmic nature inspired approach based on Honey Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman Problem. The proposed algorithm for the solution of the Traveling Salesman Problem, the Honey Bees Mating Optimization (HBMOTSP), combines a Honey Bees Mating Optimization (HBMO) algorithm, the Multiple Phase Neighborhood Search-Greedy Randomized Adaptive Search Procedure (MPNS-GRASP) algorithm and the Expanding Neighborhood Search Strategy. Besides these two procedures, the proposed algorithm has, also, two additional main innovative features compared to other Honey Bees Mating Optimization algorithms concerning the crossover operator and the workers. The main contribution of this paper is that it shows that the HBMO can be used in hybrid synthesis with other metaheuristics for the solution of the TSP with remarkable results both to quality and computational efficiency. The proposed algorithm was tested on a set of 74 benchmark instances from the TSPLIB and in all but eleven instances the best known solution has been found. For the rest instances the quality of the produced solution deviates less than 0.1% from the optimum.

学科与关键词

关键词
MetaheuristicsHoney bees mating optimizationTraveling salesman problem
相关
加载中…
  • Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem
    Palominos, Pedro; Ortega, Carla; Alfaro, Miguel; Fuertes, Guillermo*; Vargas, Manuel; Camargo, Mauricio; Parada, Victor; Gatica, GustavoCOMPLEXITY, 2022, 2022: 8903005.被引 1
  • A Multi-Phase Method for Euclidean Traveling Salesman Problems
    Hugo Pacheco-Valencia, Victor; Vakhania, Nodari*; Angel Hernandez-Mira, Frank; Alberto Hernandez-Aguilar, JoseAXIOMS, 2022, 11(9): 439.被引 1
  • Solving travelling salesman problem using black hole algorithm
    Hatamlou, Abdolreza*SOFT COMPUTING, 2018, 22(24): 8167-8175.被引 44
查看全部 →

发表信息

论文状态
公开发表
期刊
Information Sciences
发表日期
2011-10-15
卷期
第 181 卷, 第 20 期
页码
4684-4698
DOI
10.1016/j.ins.2010.06.032
语言
MULTI-LANGUAGE
成果收录
SCIE

作者

  • M

    Marinakis, Yannis (通讯) (第一作者)

  • M

    Marinaki, Magdalene

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

    Dounias, Georgios

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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