During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution qual...During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.展开更多
An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), whic...An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.展开更多
精准预测高速铁路风险对高速铁路安全管理至关重要。为有效预测高速铁路运行中的风险概率,解决事故诱因内外部特征的提取与学习过程难以同时兼顾的问题,提出一种考虑事故诱因拓扑结构的内外双视角的高速铁路风险预测模型(internal and e...精准预测高速铁路风险对高速铁路安全管理至关重要。为有效预测高速铁路运行中的风险概率,解决事故诱因内外部特征的提取与学习过程难以同时兼顾的问题,提出一种考虑事故诱因拓扑结构的内外双视角的高速铁路风险预测模型(internal and external perspectives on the topological dendrogram of accident causes,IEPTDAC)。首先,基于树状结构刻画事故内部诱因的拓扑关系,从“人、机、环、管”4个方面提取事故诱因的外部特征;在此基础上,采用卷积神经网络的多层卷积操作提取事故诱因的内外部特征,并引入粒子群算法对卷积神经网络的关键超参数进行优化,进一步提升模型的预测性能;最后,选取某铁路局的5个区段,以19个事故诱因与风险事故数据作为研究对象,在1、3和5 h的时间粒度下,分别采用9种既有预测模型与IEPTDAC模型进行对比分析。实验结果表明,相较于现有的组合预测模型以及传统的单一预测模型,IEPTDAC模型拥有更优的预测精度和拟合效果。例如,在1 h时间粒度下,对比实验中基于暂态提取变换与DSRNet-AttBiLSTM的预测模型,IEPTDAC模型的平均绝对误差fmae降低了32.04%,均方根误差f_(rmse)降低了36.35%,决定系数f_(r^(2))提高了0.46%;在1、3和5 h的时间粒度下,IEPTDAC与传统的ConvLSTM(convolutional long short-term memory)模型相比,f_(r^(2))分别提高1.71%、3.00%、1.27%。此外,本文设计的模型消融实验验证了IEPTDAC模型各分支的合理性和有效性。该方法为高速铁路风险预测提供了一种有效的技术手段。展开更多
基金Projects(50275150,61173052)supported by the National Natural Science Foundation of China
文摘During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.
文摘An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.
文摘精准预测高速铁路风险对高速铁路安全管理至关重要。为有效预测高速铁路运行中的风险概率,解决事故诱因内外部特征的提取与学习过程难以同时兼顾的问题,提出一种考虑事故诱因拓扑结构的内外双视角的高速铁路风险预测模型(internal and external perspectives on the topological dendrogram of accident causes,IEPTDAC)。首先,基于树状结构刻画事故内部诱因的拓扑关系,从“人、机、环、管”4个方面提取事故诱因的外部特征;在此基础上,采用卷积神经网络的多层卷积操作提取事故诱因的内外部特征,并引入粒子群算法对卷积神经网络的关键超参数进行优化,进一步提升模型的预测性能;最后,选取某铁路局的5个区段,以19个事故诱因与风险事故数据作为研究对象,在1、3和5 h的时间粒度下,分别采用9种既有预测模型与IEPTDAC模型进行对比分析。实验结果表明,相较于现有的组合预测模型以及传统的单一预测模型,IEPTDAC模型拥有更优的预测精度和拟合效果。例如,在1 h时间粒度下,对比实验中基于暂态提取变换与DSRNet-AttBiLSTM的预测模型,IEPTDAC模型的平均绝对误差fmae降低了32.04%,均方根误差f_(rmse)降低了36.35%,决定系数f_(r^(2))提高了0.46%;在1、3和5 h的时间粒度下,IEPTDAC与传统的ConvLSTM(convolutional long short-term memory)模型相比,f_(r^(2))分别提高1.71%、3.00%、1.27%。此外,本文设计的模型消融实验验证了IEPTDAC模型各分支的合理性和有效性。该方法为高速铁路风险预测提供了一种有效的技术手段。
