基于免疫疫苗和信息素动态更新的蚁群优化算法

Wanjun Liu, Juan Zhang, Junli Liu
{"title":"基于免疫疫苗和信息素动态更新的蚁群优化算法","authors":"Wanjun Liu, Juan Zhang, Junli Liu","doi":"10.1109/ICDMW.2010.16","DOIUrl":null,"url":null,"abstract":"To solve the problem of complexity and uncertainty in logistics and distribution system, a kind of Ant Colony Optimization algorithm based on immunity vaccine and dynamic pheromone updating is put forward in this paper. In this new Algorithm, initial antibody is vaccinated first to produce better solutions, and initial parameters are then set depending on these better solutions by the Ant Colony. Mechanism of dynamic adjustment and pheromone updating is also introduced into this algorithm to slow down the increment of the pheromone concentration difference between the paths, avoiding sectional solution of the algorithm. Experiment results show that DACOIV can effectively find optimal path for logistics and distribution system.","PeriodicalId":170201,"journal":{"name":"2010 IEEE International Conference on Data Mining Workshops","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Ant Colony Optimization Algorithm Based on Immunity Vaccine and Dynamic Pheromone Updating\",\"authors\":\"Wanjun Liu, Juan Zhang, Junli Liu\",\"doi\":\"10.1109/ICDMW.2010.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve the problem of complexity and uncertainty in logistics and distribution system, a kind of Ant Colony Optimization algorithm based on immunity vaccine and dynamic pheromone updating is put forward in this paper. In this new Algorithm, initial antibody is vaccinated first to produce better solutions, and initial parameters are then set depending on these better solutions by the Ant Colony. Mechanism of dynamic adjustment and pheromone updating is also introduced into this algorithm to slow down the increment of the pheromone concentration difference between the paths, avoiding sectional solution of the algorithm. Experiment results show that DACOIV can effectively find optimal path for logistics and distribution system.\",\"PeriodicalId\":170201,\"journal\":{\"name\":\"2010 IEEE International Conference on Data Mining Workshops\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Data Mining Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDMW.2010.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Data Mining Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW.2010.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

为解决物流配送系统的复杂性和不确定性问题,提出了一种基于免疫疫苗和信息素动态更新的蚁群优化算法。在该算法中,首先接种初始抗体以产生更好的解,然后由蚁群根据这些更好的解设置初始参数。该算法还引入了动态调整和信息素更新机制,减缓了路径间信息素浓度差的增量,避免了算法的分段求解。实验结果表明,DACOIV能够有效地找到物流配送系统的最优路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ant Colony Optimization Algorithm Based on Immunity Vaccine and Dynamic Pheromone Updating
To solve the problem of complexity and uncertainty in logistics and distribution system, a kind of Ant Colony Optimization algorithm based on immunity vaccine and dynamic pheromone updating is put forward in this paper. In this new Algorithm, initial antibody is vaccinated first to produce better solutions, and initial parameters are then set depending on these better solutions by the Ant Colony. Mechanism of dynamic adjustment and pheromone updating is also introduced into this algorithm to slow down the increment of the pheromone concentration difference between the paths, avoiding sectional solution of the algorithm. Experiment results show that DACOIV can effectively find optimal path for logistics and distribution system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantum Path Integral Inspired Query Sequence Suggestion for User Search Task Simplification PTCR-Miner: Progressive Temporal Class Rule Mining for Multivariate Temporal Data Classification Bridging Folksonomies and Domain Ontologies: Getting Out Non-taxonomic Relations SIMPLE: Interactive Analytics on Patent Data Parallel EM-Clustering: Fast Convergence by Asynchronous Model Updates
×
引用
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