efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics高效计算最短路径的网络使用粒子群优化和喧哗metaheuristics.pdfVIP

下载本文档

1
0
约8.95万字
约 26页
2017-08-28 发布于上海
举报
版权申诉

efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics高效计算最短路径的网络使用粒子群优化和喧哗metaheuristics.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics高效计算最短路径的网络使用粒子群优化和喧哗metaheuristics

Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 2007, Article ID 27383, 25 pages doi:10.1155/2007/27383 Research Article Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics Ammar W. Mohemmed and Nirod Chandra Sahoo Received 13 March 2007; Accepted 4 April 2007 This paper presents a novel hybrid algorithm based on particle swarm optimization (PSO) and noising metaheuristics for solving the single-source shortest-path problem (SPP) commonly encountered in graph theory. This hybrid search process combines PSO for iteratively ﬁnding a population of better solutions and noising method for diversifying the search scheme to solve this problem. A new encoding/decoding scheme based on heuristics has been devised for representing the SPP parameters as a particle in PSO. Noising-method-based metaheuristics (noisy local search) have been incorporated in or- der to enhance the overall search eﬃciency. In particular, an iteration of the proposed hybrid algorithm consists of a standard PSO iteration and few trials of noising scheme applied to each better/improved particle for local search, where the neighborhood of each such particle is noisily explored with an elementary transformation of the particle so as to escape possible local minima and to diversify the search. Simulation results on several networks with random topologies are used to illustrate the eﬃciency of the proposed hy- brid algorithm for shortest-path computation. The proposed algorithm can be used as a platform for solving other NP-hard SPPs. Copyright © 2007 A. W. Mohemmed and N. C. Sahoo. This is an open access article dis- tributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is prop- erly cited. 1. Introduction Shortest-path (SP) computation is one of the most fundamental problems in gr