A Modified Ant Colony Optimization Algorithm with Pheromone Mutations for Dynamic Travelling Salesman Problem

IF 2.5 4区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IETE Technical Review Pub Date : 2023-02-20 DOI:10.1080/02564602.2023.2167742
Lavika Goel, Giriraj Vaishnav, Siddharth Chand Ramola, Tushar Purohit
{"title":"A Modified Ant Colony Optimization Algorithm with Pheromone Mutations for Dynamic Travelling Salesman Problem","authors":"Lavika Goel, Giriraj Vaishnav, Siddharth Chand Ramola, Tushar Purohit","doi":"10.1080/02564602.2023.2167742","DOIUrl":null,"url":null,"abstract":"Ant Colony Optimization (ACO) is an algorithm based on Meta-heuristics and swarm intelligence, taking inspiration from the exploring behavior of social insects like ants. Some very challenging optimization problems, like the vehicle routing problem, have been solved by Ant colony optimization. But, the Standard ACO algorithm has problems like trapping in local optimum. This paper discusses an improved version of the ACO algorithm, known as Modified ACO (M-ACO). The main motivation of the proposed algorithm is to use pheromone mutation techniques, such as swap and random, in dynamic environments, to overcome the problems of standard ACO and solve the Travelling Salesman Problem, which is a well-known NP-hard problem. Mutation allows better searching and exploring in other areas, for better results. Also, the exploitation is increased that uses local information to search local regions more intensively for finding minimum distance and increasing the rate of convergence. Evaporation-based Ant colony optimization (E-ACO) framework and population-based ant colony optimization (P-ACO) framework are the two groups into which the algorithms under study are separated. Both frameworks are evaluated on dynamic environments produced using TSPLIB base instances and updated for pheromone values using mutation technique. Experiments and Statistical tests were conducted on the TSPLIB datasets such as pr439 and lin318, in dynamic environments and on comparing ACO with M-ACO and P-ACO, better results were obtained for M-ACO and P-ACO. Metrics like offline have been considered to measure algorithm performance and behavior.","PeriodicalId":13252,"journal":{"name":"IETE Technical Review","volume":" ","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2023-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IETE Technical Review","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/02564602.2023.2167742","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 1

Abstract

Ant Colony Optimization (ACO) is an algorithm based on Meta-heuristics and swarm intelligence, taking inspiration from the exploring behavior of social insects like ants. Some very challenging optimization problems, like the vehicle routing problem, have been solved by Ant colony optimization. But, the Standard ACO algorithm has problems like trapping in local optimum. This paper discusses an improved version of the ACO algorithm, known as Modified ACO (M-ACO). The main motivation of the proposed algorithm is to use pheromone mutation techniques, such as swap and random, in dynamic environments, to overcome the problems of standard ACO and solve the Travelling Salesman Problem, which is a well-known NP-hard problem. Mutation allows better searching and exploring in other areas, for better results. Also, the exploitation is increased that uses local information to search local regions more intensively for finding minimum distance and increasing the rate of convergence. Evaporation-based Ant colony optimization (E-ACO) framework and population-based ant colony optimization (P-ACO) framework are the two groups into which the algorithms under study are separated. Both frameworks are evaluated on dynamic environments produced using TSPLIB base instances and updated for pheromone values using mutation technique. Experiments and Statistical tests were conducted on the TSPLIB datasets such as pr439 and lin318, in dynamic environments and on comparing ACO with M-ACO and P-ACO, better results were obtained for M-ACO and P-ACO. Metrics like offline have been considered to measure algorithm performance and behavior.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解动态旅行商问题的信息素变异蚁群优化算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IETE Technical Review
IETE Technical Review 工程技术-电信学
CiteScore
5.70
自引率
4.20%
发文量
48
审稿时长
9 months
期刊介绍: IETE Technical Review is a world leading journal which publishes state-of-the-art review papers and in-depth tutorial papers on current and futuristic technologies in the area of electronics and telecommunications engineering. We also publish original research papers which demonstrate significant advances.
期刊最新文献
Radiation Effects in VLSI Circuits – Part I: Historical Perspective Mental Wellness and Academic Achievement: Navigating Entrance Tests with Confidence Deep Learning Approach for Gait Detection for Precise Stimulation of FES to Correct Foot Drop A New Distance Measurement Method for Perceptual Image Hashing Forging Connections: Integrating Indian Knowledge Systems in Higher Education
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1