Notice of RetractionImproved ant colony algorithm for system efficiency optimization of supply facilities

Guozhuzhai Han, Ningjun Fan, Kai Lv
{"title":"Notice of RetractionImproved ant colony algorithm for system efficiency optimization of supply facilities","authors":"Guozhuzhai Han, Ningjun Fan, Kai Lv","doi":"10.1109/QR2MSE.2013.6625811","DOIUrl":null,"url":null,"abstract":"It depends on proper plan of supply routes to improve system efficiency of supply facilities, when a few battle vehicles in different locations appear different failures. The time optimization of the process is a NP-hard problem. Since the runtime of algorithm is a part of the time for the supply process, the algorithm is required to construct a good enough solution in a limited time. Ant Colony System (ACS) is used to solve this problem, and a strategy is proposed to avoid it falling into local minimum. When the best-so-far solution is re-constructed, the pheromone value associated with each edge is updated to zero. Experiment results demonstrate that, compared with standard ACS, ACS with this strategy can construct a better solution in a shorter time and less iterations. In a word, its overall performance is better in solving the optimization problem of system efficiency.","PeriodicalId":140736,"journal":{"name":"2013 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QR2MSE.2013.6625811","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It depends on proper plan of supply routes to improve system efficiency of supply facilities, when a few battle vehicles in different locations appear different failures. The time optimization of the process is a NP-hard problem. Since the runtime of algorithm is a part of the time for the supply process, the algorithm is required to construct a good enough solution in a limited time. Ant Colony System (ACS) is used to solve this problem, and a strategy is proposed to avoid it falling into local minimum. When the best-so-far solution is re-constructed, the pheromone value associated with each edge is updated to zero. Experiment results demonstrate that, compared with standard ACS, ACS with this strategy can construct a better solution in a shorter time and less iterations. In a word, its overall performance is better in solving the optimization problem of system efficiency.
基于改进蚁群算法的供给设施系统效率优化
当不同位置的几辆战车出现不同的故障时,提高补给设施的系统效率取决于合理的补给路线规划。过程的时间优化是一个np困难问题。由于算法的运行时间是供应过程时间的一部分,因此要求算法在有限的时间内构造出足够好的解。利用蚁群系统(ACS)求解该问题,并提出了一种避免陷入局部最小值的策略。当重构到目前为止最好的解时,与每条边相关的信息素值更新为零。实验结果表明,与标准ACS相比,采用该策略的ACS可以在更短的时间和更少的迭代中构建更好的解。总之,在解决系统效率优化问题上,其综合性能较好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信