共查询到20条相似文献，搜索用时 203 毫秒
1.
基于WS小世界网络拓扑特性的自组织PSO算法 总被引：1，自引：0，他引：1
提出了一种自组织粒子群优化算法SOPSO。算法融合了WS小世界网络模型的拓扑特性和信息传递特征,将粒子种群优化过程划分为种群拓扑结构自组织构造和粒子间合作优化两个相互促进的部分,其中前者采用WS小世界模型对种群拓扑结构进行自组织构造,后者基于所产生的拓扑结构进行合作优化。描述了算法的总体流程和各个关键环节。采用高维复杂函数对SOPSO和传统粒子群优化算法进行了对比实验。实验结果证明SOPSO的学习策略赋予了粒子种群更广泛的多样性和更强的逃离局部最优能力,从而在优化成功率以及优化质量上均优于传统粒子群优化算法。 相似文献
2.
为进一步了解结构拓扑优化及变量连接算法、软件设计,基于结构拓扑优化下的变量连接算法分析,详细分析变量之间约束关系设计方式,以此进一步实现拓扑优化设计,以能够满足实际工作需求。在结构拓扑优化设计过程中,需要有效避免结构固有特性拓扑优化特点,实现常见优化准则法的一致性,具体优化设计过程中采用相应的二维结构动态拓扑优化数值结构分析,从而设计具体的变量连接算法及其软件平台。在以上基础上分析变量连接算法软件集成平台,构建结构拓扑优化的变量连接算法框架,以能够显著提升变量连接算法及其软件设计,为其应用提供重要参考意见。 相似文献
3.
针对项目管理中工期固定--资源均衡问题,设计了基于冯诺依受拓扑结构的粒子群算法局部模型,应用子资源均衡评价函数.通过对文献[5]中算例的计算分析,该模型比全局模型的粒子群算法在寻优率上提高了135%,对文献[6]中的资源均衡问题进行优化计算,比较了冯诺依曼结构与标准全局结构的性能,验证了该模型应用在资源均衡中的更好的性能. 相似文献
4.
5.
粒子群优化(PSO)粒子滤波算法比较而言,容易陷入局部最优,因此算法的准确度就会降低。本文在解决该问题时引入了一种基于鱼群的PSO粒子滤波算法。此算法是通过鱼群优化在采样过程中找到全局最优的相对位置,使其能够向全局最优的位置逐渐接近,同时提高估计有效的粒子数目,从而能够更有效的减少粒子退化与枯竭问题。实验表明,此算法与PSO粒子滤波算法相比,在估计准确度方面有了较大的提升。 相似文献
6.
粒子群算法是一种进化计算技术,但容易陷入局部极小点。提出了一种利用Alopex算法改进的粒子群优化算法,改进的粒子群优化算法改善了粒子群优化算法摆脱局部极小点的能力,对典型函数的测试表明:改进算法的全局搜索能力有了显著提高,特别是对多峰函数能够有效地避免早熟收敛问题。 相似文献
7.
针对粒子群算法在云计算任务调度中存在效率低等问题,提出在将鸡群算法引入到粒子群算法中,将粒子的分布按照鸡群算法中的公鸡,母鸡和小鸡来进行区分,同时对粒子的学习因子进行了改进,有效的避免算法陷入局部,收敛速度快的缺点,在云计算仿真平台中,将本文算法与粒子群算法,鸡群算法在虚拟机负载均衡,消耗成本和完成时间上进行对比都取得了一定的优势,说明本文算法能够有效的提高云计算任务调度效率。 相似文献
8.
对标准PSO算法进行分析的基础上,针对PSO算法中的早熟收敛问题,提出了一种基于混沌序列的PSO算法（CPSO）。CPSO算法能够保证粒子种群的多样性,使粒子能够有效进行全局搜索;并以典型的基准优化问题进行了仿真实验,验证了CPSO的有效性。 相似文献
9.
如何能够更好的进行多目标的优化一直以来都是研究的重点,本文在粒子群算法的基础上,提出了首先引入精英策略初始化粒子群,其次对粒子的速度和位置计算方法进行更新,最后采用多尺度的变异算子提高粒子的变异能力,增强种群多样性,测试函数的实验说明了本文算法能够有效提高算法的效率,在多目标Pareto最优解测试中取得了比较好的效果,说明本文算法能够运用在多目标的优化中。 相似文献
10.
粒子群算法是一种进化计算技术,但容易陷入局部极小点.提出了一种利用Alopex算法改进的粒子群优化算法,改进的粒子群优化算法改善了粒子群优化算法摆脱局部极小点的能力,对典型函数的测试表明:改进算法的全局搜索能力有了显著提高,特别是对多峰函数能够有效地避免早熟收敛问题. 相似文献
11.
《Journal of The Franklin Institute》2022,359(4):1655-1676
This paper presents a privacy-preserving average consensus algorithm for a discrete-time network with heterogeneous dynamic nodes in the presence of Gaussian privacy noises. Rényi divergence is used to measure the privacy, and a distributed algorithm is proposed for each node in the network to protect the initial output state and ensure consensus almost surely. The convergence rate of the proposed algorithm relates to the communication topology, dynamics of systems, and decaying rates of privacy noises. Moreover, by increasing neighbors of nodes in the network, the proposed algorithm can strengthen preservation. To demonstrate the theoretical results, a numerical example is carried out on a network of one hundred nodes. 相似文献
12.
《Journal of The Franklin Institute》2019,356(12):6591-6609
This paper investigates the bipartite leader-following consensus of second-order multi-agent systems with signed digraph topology. To significantly reduce the communication burden, an event-triggered control algorithm is proposed to solve the bipartite leader-following consensus problem, where a novel event-triggered function is designed. Under some mild assumptions on the network topology and node dynamics, a sufficient condition is derived using Lyapunov stability method and matrix theory to guarantee the bipartite consensus. In particular, it is shown that the continuous communication can be avoided and the Zeno-behavior can be excluded for the designed event-triggered algorithm. Numerical simulations are presented to illustrate the correctness of the theoretical analysis. 相似文献
13.
Discovering author impact: A PageRank perspective 总被引：1，自引：0，他引：1
This article provides an alternative perspective for measuring author impact by applying PageRank algorithm to a coauthorship network. A weighted PageRank algorithm considering citation and coauthorship network topology is proposed. We test this algorithm under different damping factors by evaluating author impact in the informetrics research community. In addition, we also compare this weighted PageRank with the h-index, citation, and program committee (PC) membership of the International Society for Scientometrics and Informetrics (ISSI) conferences. Findings show that this weighted PageRank algorithm provides reliable results in measuring author impact. 相似文献
14.
Aijuan Wang Wanping Liu Tiehu Li Tingwen Huang 《Journal of The Franklin Institute》2021,358(6):3033-3050
This paper proposes a privacy-preserving consensus algorithm which enables all the agents in the directed network to eventually reach the weighted average of initial states, and while preserving the privacy of the initial state of each agent. A novel privacy-preserving scheme is proposed in our consensus algorithm where initial states are hidden in random values. We also develop detailed analysis based on our algorithm, including its convergence property and the topology condition of privacy leakages for each agent. It can be observed that final consensus point is independent of their initial values that can be arbitrary random values. Besides, when an eavesdropper exists and can intercept the data transmitted on the edges, we introduce an index to measure the privacy leakage degree of agents, and then analyze the degree of privacy leakage for each agent. Similarly, the degree for network privacy leakage is derived. Subsequently, we establish an optimization problem to find the optimal attacking strategy, and present a heuristic optimization algorithm based on the Sequential Least Squares Programming (SLSQP) to solve the proposed optimization problem. Finally, numerical experiments are designed to demonstrate the effectiveness of our algorithm. 相似文献
15.
《Journal of The Franklin Institute》2006,343(4-5):389-403
Appropriate routing in data transfer is a challenging problem that can lead to improved performance of networks in terms of lower delay in delivery of packets and higher throughput. Considering the highly distributed nature of networks, several multi-agent based algorithms, and in particular ant colony based algorithms, have been suggested in recent years. However, considering the need for quick optimization and adaptation to network changes, improving the relative slow convergence of these algorithms remains an elusive challenge. Our goal here is to reduce the time needed for convergence and to accelerate the routing algorithm's response to network failures and/or changes by imitating pheromone propagation in natural ant colonies. More specifically, information exchange among neighboring nodes is facilitated by proposing a new type of ant (helping ants) to the AntNet algorithm. The resulting algorithm, the “modified AntNet,” is then simulated via NS2 on NSF network topology. The network performance is evaluated under various node-failure and node-added conditions. Statistical analysis of results confirms that the new method can significantly reduce the average packet delivery time and rate of convergence to the optimal route when compared with standard AntNet. 相似文献
16.
Sidney Roberto Carvalho Ubirajara Franco Moreno 《Journal of The Franklin Institute》2021,358(9):5039-5072
In distributed and cooperative systems, the network structure is determinant to the success of the strategy adopted to solve complex tasks. Those systems are primarily governed by consensus protocols whose convergence is intrinsically dependent on the network topology. Most of the consensus algorithms deal with continuous values and perform average-based strategies to reach cohesion over the exchanged information. However, many problems demand distributed consensus over countable values, that cannot be handled by traditional protocols. In such a context, this work presents an approach based on semidefinite programming to design the optimal weights of a network adjacency matrix, in order to control the convergence of a distributed random consensus protocol for variables at the discrete-space domain, based on the voter model. As a second contribution, this work uses Markov theory and the biological inspiration of epidemics to find out a dynamical spreading model that can predict the information diffusion over this discrete consensus protocol. Also, convergence properties and equilibrium points of the proposed model are presented regarding the network topology. Finally, extensive numerical simulations evaluate the effectiveness of the proposed consensus algorithm, its spreading model, and the approach for optimal weight design. 相似文献
17.
提出了一种可以用于恢复工作路径和预先提供的备份路径的重路由算法,它由两个子算法组成:第一个算法用于动态决定恢复范围(RS),通过减少网络拓扑的复杂性和增大已经存在工作LSP的重用来增加恢复速度。第二个是通过动态增加恢复范围直到RS达到整个网络拓扑,来减少失败的概率。通过模拟,根据恢复速度、丢包率、网络资源利用率和现有的LSP的可重用率评价了提出的恢复方案和已经存在的方案的性能。 相似文献
18.
混沌粒子群算法在WSN覆盖优化中的应用 总被引：1，自引：0，他引：1
研究WSN覆盖优化方面的问题,提高无线传感网络通讯效率。针对无线传感网络节点分布不均匀或者节点失效时,WSN覆盖区域会出现重叠或者指定区域没有被覆盖,造成无线传感网络通讯效率下降的问题,提出了利用一种混沌粒子群算法,根据无线传感网络相关参数和条件建立数学模型,利用优化处理方式对其进行优化,提高了通讯效率。实验证明,利用混沌粒子群算法进行WSN覆盖优化,可以提高无线传感网络优化效率,取得了令人满意的效果。 相似文献
19.
《Information processing & management》2023,60(2):103221
Disease spread control is a challenging task with growing importance in recent years. Infectious disease networks have been proven to be a helpful resource for controlling the epidemic by targeting a smaller population. However, the information on these networks is often imprecise, diffused, concealed, and misleading, making it challenging to obtain a complete set of real-world data, i.e., some links might be missing, which can be a risk to the widespread of the pandemic. The former studies on infectious disease networks ignore the influence of neighborhood missing links in the infectious disease network topology, thus massively targeting the irrelevant population, resulting in poor epidemic control performance. In this paper, to address such a problem, we study how a small portion of the population should be targeted with incomplete network information to effectively prevent the pandemic. We propose an algorithm, namely, the Neighborhood Relation Aware Network Dismantling Algorithm (NRAND), to efficiently address the infectious disease network’s dismantling problem. For comparison, four network dismantling strategies are employed in our experiments. An extensive empirical study of real-world networks suggests that the proposed algorithm NRAND’s dismantling performance is significantly greater than the state-of-the-art algorithms, indicating that NRAND can be a smarter option for dismantling real-world infectious disease networks. 相似文献
20.
Chunlin Li Jingpan Bai Zhao Wenjun Yang Xihao 《Information processing & management》2019,56(1):91-109
Recently, social network has been paid more and more attention by people. Inaccurate community detection in social network can provide better product designs, accurate information recommendation and public services. Thus, the community detection (CD) algorithm based on network topology and user interests is proposed in this paper. This paper mainly includes two parts. In first part, the focused crawler algorithm is used to acquire the personal tags from the tags posted by other users. Then, the tags are selected from the tag set based on the TFIDF weighting scheme, the semantic extension of tags and the user semantic model. In addition, the tag vector of user interests is derived with the respective tag weight calculated by the improved PageRank algorithm. In second part, for detecting communities, an initial social network, which consists of the direct and unweighted edges and the vertexes with interest vectors, is constructed by considering the following/follower relationship. Furthermore, initial social network is converted into a new social network including the undirected and weighted edges. Then, the weights are calculated by the direction and the interest vectors in the initial social network and the similarity between edges is calculated by the edge weights. The communities are detected by the hierarchical clustering algorithm based on the edge-weighted similarity. Finally, the number of detected communities is detected by the partition density. Also, the extensively experimental study shows that the performance of the proposed user interest detection (PUID) algorithm is better than that of CF algorithm and TFIDF algorithm with respect to F-measure, Precision and Recall. Moreover, Precision of the proposed community detection (PCD) algorithm is improved, on average, up to 8.21% comparing with that of Newman algorithm and up to 41.17% comparing with that of CPM algorithm. 相似文献