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

A comparative study of improved GA and PSO in solving multiple traveling salesmen problem

Zhou, Honglu; Song, Mingli*; Pedrycz, Witoldcommun univ china
APPLIED SOFT COMPUTING2018-3DOI: 10.1016/j.asoc.2017.12.031
107被引3阅读
引用收藏
分享

摘要

Multiple traveling salesman problem (MTSP) is a generalization of the classic traveling salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications. In this paper, in order to solve the minsum MTSP with multiple depots, closed path, and the requirement of minimum number of cities each salesman should visit, we propose two partheno genetic algorithms (PGA). One is a PGA with roulette selection and elitist selection in which four new kinds of mutation operation are proposed. The other one, named IPGA, binds the selection and mutation together. A new selection operator and a more comprehensive mutation operator are used. The new mutation operator is based on the four kinds of mutation operation in PGA, which eliminates the mutation probability. For comparative analysis, we also adopt particle swarm optimization algorithm (PSO) and one state of the art method (invasive weed optimization algorithm from literature) to solve MTSP. The algorithms are validated with publicly available TSPLIB benchmarks. The performance is discussed and evaluated through a series of comparative experiments. IPGA is demonstrated to be superior in solving MTSP.

学科与关键词

关键词
Partheno genetic algorithmMultiple traveling salesman problemParticle swarm optimization
相关
加载中…
  • An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
    Zheng, Jiongzhi; Hong, Yawei; Xu, Wenchang; Li, Wentao; Chen, Yongfu*COMPUTERS & OPERATIONS RESEARCH, 2022, 143: 105772.被引 16
  • Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
    He, Pengfei; Hao, Jin-Kao*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 307(3): 1055-1070.被引 22
  • Hybrid search with neighborhood reduction for the multiple traveling salesman problem
    He, Pengfei; Hao, Jin-Kao*COMPUTERS & OPERATIONS RESEARCH, 2022, 142: 105726.被引 17
查看全部 →

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2018-03
卷期
第 64 卷
页码
564-580
DOI
10.1016/j.asoc.2017.12.031
语言
ENGLISH
期刊等级
Q1
成果收录
SCIE
资助标注
National Natural Science Foundation of China (NSFC) [61773352]; project of Communication University of China; Fund of CSCSE

作者

  • Z

    Zhou, Honglu (第一作者)

    commun univ china

  • S

    Song, Mingli (通讯)

    commun univ china

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

    Pedrycz, Witold

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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