Application of DSAPSO Algorithm in Distribution Network Reconfiguration with Distributed Generation

With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability.

On the “Onion Husk” Algorithm for Approximate Solution of the Traveling Salesman Problem

The paper describes some implementation aspects of an algorithm for approximate solution of the traveling salesman problem based on the construction of convex closed contours on the initial set of points (“cities”) and their subsequent combination into a closed path (the so-called contour algorithm or “onion husk” algorithm). A number of heuristics related to the different stages of the algorithm are considered, and various variants of the algorithm based on these heuristics are analyzed. Sets of randomly generated points of different sizes (from 4 to 90 and from 500 to 10,000) were used to test the algorithms. The numerical results obtained are compared with the results of two well-known combinatorial optimization algorithms, namely the algorithm based on the branch and bound method and the simulated annealing algorithm. .

Integrated classification method of tight sandstone reservoir based on principal component analysise simulated annealing genetic algorithmefuzzy cluster means

In this research,an integrated classification method based on principal component analysis-simulated annealing genetic algorithm-fuzzy cluster means(PCA-SAGA-FCM)was proposed for the unsupervised classification of tight sandstone reservoirs which lack the prior information and core experiments.A variety of evaluation parameters were selected,including lithology characteristic parameters,poro-permeability quality characteristic parameters,engineering quality characteristic parameters,and pore structure characteristic parameters.The PCA was used to reduce the dimension of the evaluation pa-rameters,and the low-dimensional data was used as input.The unsupervised reservoir classification of tight sandstone reservoir was carried out by the SAGA-FCM,the characteristics of reservoir at different categories were analyzed and compared with the lithological profiles.The analysis results of numerical simulation and actual logging data show that:1)compared with FCM algorithm,SAGA-FCM has stronger stability and higher accuracy;2)the proposed method can cluster the reservoir flexibly and effectively according to the degree of membership;3)the results of reservoir integrated classification match well with the lithologic profle,which demonstrates the reliability of the classification method.

基于IWOA-SA-Elman神经网络的短期风电功率预测

由于风力发电的随机性和不确定性使其短期功率的预测工作十分困难,而神经网络模型依靠其强大的自学习能力在风电功率预测领域有着广泛的应用。但神经网络预测精度受初始权重影响较大,且易出现过拟合的问题。为此构建一种基于改进鲸鱼算法和模拟退火组合优化的Elman神经网络短期风电功率预测模型,模型首先利用改进鲸鱼算法结合模拟退火策略获得高质量神经网络初始权值,接着引入正则化损失函数防止其过拟合,最后以西班牙瓦伦西亚某风电场陆上短期风电功率为研究对象,将该算法与BP、LSTM、Elman、WOA-Elman、IWOA-Elman 5种神经网络算法进行算法性能测试对比,结果表明IWOA-SA-Elman神经网络模型预测误差最小,验证了该算法的合理性和有效性。

MRMR-SA-EGA-ELM的叶绿素a浓度预测模型研究

为提高叶绿素a浓度的预测精度,以南太湖区域-湖州市新塘港2020年5月至11月份的水质监测数据为原始样本数据,使用最大相关最小冗余算法(MRMR)从原始样本数据中选取效果更优的特征值,作为预测模型的输入数据,将精英遗传算法(EGA)与模拟退火算法(SA)组合优化极限学习机(ELM)网络的初始参数,最终构建MRMR-SA-EGA-ELM叶绿素a浓度预测模型。实验结果表明,MRMR-SA-EGA-ELM模型预测叶绿素a浓度的平均绝对误差(MAE)、均方误差(MSE)、决定系数(R^(2))分别为1.009、1.607、0.903,而ELM模型预测结果的MAE、MSE、R^(2)分别为2.078、8.249、0.562,MRMR-SA-EGA-ELM模型的效果得到显著提升,可实现对叶绿素a浓度的准确预测。

基于GRA-GASA-SVM的煤层瓦斯含量预测方法研究

为提升煤层瓦斯含量预测精度,提出一种采用遗传模拟退火算法混合优化支持向量机(SVM)参数的瓦斯含量预测模型(GRA-GASA-SVM模型)。该模型将GA和SA整合为遗传模拟退火算法协同优化SVM的参数,以解决传统网格寻优算法取值范围无法确定和单一智能算法优化程度有限等问题。利用灰色关联分析(GRA)压缩数据集维度,建立瓦斯含量预测参数体系并作为GASA-SVM的输入数据集。结果表明:SVM模型、GA-SVM模型和GASA-SVM模型10折交叉验证瓦斯含量预测总平均相对误差分别为15.98%、13.55%和10.58%。相比SVM模型和GA-SVM模型,GASA-SVM模型预测稳定性更优、预测精准度更高且对新样本泛化能力更强。

Using genetic/simulated annealing algorithm to solve disassembly sequence planning

Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.

An Improved Multi-Objective Hybrid Genetic-Simulated Annealing Algorithm for AGV Scheduling under Composite Operation Mode

This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time.

Age estimation from facial images based on Gabor feature fusion and the CIASO-SA algorithm

Aiming at the problem of long time-consuming and low accuracy of existing age estimation approaches,a new age estimation method using Gabor feature fusion,and an improved atomic search algorithm for feature selection is proposed.Firstly,texture features of five scales and eight directions in the face region are extracted by Gabor wavelet transform.The statistical histogram is introduced to encode and fuse the directional index with the largest feature value on Gabor scales.Secondly,a new hybrid feature selection algorithm chaotic improved atom search optimisation with simulated annealing(CIASO-SA)is presented,which is based on an improved atomic search algorithm and the simulated annealing algorithm.Besides,the CIASO-SA algorithm introduces a chaos mechanism during atomic initialisation,significantly improving the convergence speed and accuracy of the algorithm.Finally,a support vector machine(SVM)is used to get classification results of the age group.To verify the performance of the proposed algorithm,face images with three resolutions in the Adience dataset are tested.Using the Gabor real part fusion feature at 48�48 resolution,the average accuracy and 1-off accuracy of age classification exhibit a maximum of 60.4%and 85.9%,respectively.Obtained results prove the superiority of the proposed algorithm over the state-of-the-art methods,which is of great referential value for application to the mobile terminals.

基于SA-PSO算法优化CNN的电能质量扰动分类模型

针对传统电能质量扰动分类模型中扰动特征复杂、识别步骤繁琐的问题,提出了一种通过模拟退火(SA)算法与粒子群优化(PSO)算法相结合来优化卷积神经网络(CNN)的电能质量扰动分类模型。将CNN卷积层中的二维卷积核替换成一维卷积核;采用SA算法对PSO算法进行改进,规避PSO算法陷入局部最优的困境;采用改进后的PSO算法对CNN进行参数寻优;利用优化CNN提取和筛选合适的特征,根据这些特征利用分类器得到最终分类结果。通过算例分析得出,使用基于SA-PSO算法优化的CNN的电能质量扰动分类模型能精确地识别出电能质量扰动信号。

Vehicle recognition and tracking based on simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm

Target recognition and tracking is an important research filed in the surveillance industry.Traditional target recognition and tracking is to track moving objects, however, for the detected moving objects the specific content can not be determined.In this paper, a multi-target vehicle recognition and tracking algorithm based on YOLO v5 network architecture is proposed.The specific content of moving objects are identified by the network architecture, furthermore, the simulated annealing chaotic mechanism is embedded in particle swarm optimization-Gauss particle filter algorithm.The proposed simulated annealing chaotic particle swarm optimization-Gauss particle filter algorithm(SA-CPSO-GPF) is used to track moving objects.The experiment shows that the algorithm has a good tracking effect for the vehicle in the monitoring range.The root mean square error(RMSE), running time and accuracy of the proposed method are superior to traditional methods.The proposed algorithm has very good application value.

SA765Gr.Ⅱ合金钢热拉伸本构模型的参数反求

在温度为950~1150℃,应变速率为0.01~5 s^(-1)的条件下,使用Gleeble-1500D热模拟实验机对SA765Gr.Ⅱ合金钢进行了等温热拉伸实验以研究其热拉伸变形行为。首先通过线性回归方法推导了SA765Gr.Ⅱ合金钢的Norton-Hoff模型参数,之后提出了一种基于自适应模拟退火(ASA)算法求解本构模型参数的方法(反求方法)。结果表明:相比于回归方法,反求方法构建的模型预测相关系数R从0.9831提高到0.9958、均方根误差RMAE由6.392降低至3.603、平均相对误差AARE由5.38%降低至3.69%。线性回归方法构建的模型预测误差期望与标准偏差分别为0.97和8.76,反求方法构建的模型预测误差期望与标准偏差分别为0.13和5.14。通过反求方法构建的Norton-Hoff模型预测精度得到了提高。

不平衡样本下的SA-YOLO自适应损失目标检测算法

样本不平衡现象是指在数据集中以背景为主的易样本数量较大,而以前景为主的难样本数量过少,即样本存在类间不平衡与难易不平衡问题。现有目标检测算法大多是基于候选区域的两阶段算法或基于回归的单阶段算法,当应用于不平衡样本时无法避免训练中产生的预测框对大量样本过度依赖,从而导致模型过拟合且检测精度低,准确性、泛化性差。为了在不平衡样本下实现高效精准的目标检测,提出一种全新的SA-YOLO自适应损失目标检测算法。(1)针对样本不平衡问题,提出SA-Focal Loss函数,能够针对不同数据集与训练阶段对损失进行自适应调节,以达到平衡类间样本与难易样本的效果。(2)在多尺度特征预测机制下构造CSPDarknet53-SP网络架构,增强困难小目标样本全局特征的提取能力,达到提升难样本检测精度的效果。为验证SA-YOLO算法的性能,分别在样本不平衡数据集与COCO数据集上进行了大量仿真实验。结果表明:相较于现有YOLO系列算法最优指标值,SA-YOLO在不平衡数据集中mAP可达91.46%,提升10.87%,各类目标AP 50提升均在2%以上,有极强的专精性;在COCO数据集中mAP 50提升1.58%,各项指标均不低于最优值,有良好的有效性。

基于PSO-SA算法的源项反演方法研究

针对大气污染事故突发时,事故发生点无法确定或人员不能接近的情况,研究了基于环境监测数据源项反演以获取事故源项数据的技术,设计实现了一种基于粒子群-模拟退火源项反演方法。采用自适应方法调整惯性权重系数,与高斯烟羽扩散模型结合,对事故源项数据进行反演。实验结果显示:在所选监测点监测数据的反演实验中,基于粒子群-模拟退火算法(PSO-SA)结合了两种算法的优势,能够获得与期望值较为符合的反演结果。进一步分析了监测点数据误差及监测点数量对反演结果的影响,并将文中方法与粒子群算法(PSO)进行对比,同等条件下,较粒子群算法精度提高了8%,能够快速实现对大气污染源强和位置的准确估计。

基于GWO-SVR和改进SA算法的知识-业务配置

为解决业务流程下业务单元与知识资源配置分离的问题,提出一种基于灰狼算法优化支持向量回归(GWO-SVR)和改进模拟退火算法(SA)的知识-业务优化配置策略。该策略基于用户需求和业务情景分析,将知识资源封装为知识模块。在此基础上,通过配置器作用实现知识模块与业务单元间的初始配置。然后,依据知识模块评价指标参数分析,构建综合评价指标体系,并运用CRITIC-模糊综合评估法得到知识-业务配置组合评价量表;基于此评价量表,构建和训练基于GWO-SVR的知识-业务配置组合动态评价模型。由于GWO-SVR是回归模型,可将该训练好的模型的函数关系式作为改进SA算法优化的目标函数导入,通过寻优迭代找到最优值对应的最优组合方案,实现满足业务需求的知识资源最优配置。以减速器箱体加工为例进行验证,证明了所用模型和算法的有效性。

基于改进SARSA算法的航空器滑行路径规划

航空器滑行是机场运行中最重要的一环,缩短滑行时间也是提高机场运行效率的主要手段。为了改变仅依靠人工进行机坪管制的现状,文章针对航空器滑行的特殊环境,利用改进SARSA算法对航空器的滑行路径进行规划,并通过仿真验证了该算法在规划路径长度和迭代次数方面优于传统SARSA算法,进而更好地为管制员决策提供辅助参考。

Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem

The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given.

基于WOSA-BP的车辆动态称重算法研究

测量精度一直是影响车辆动态称重系统有效可靠性的主要因素。针对车辆动态称重系统测量精度较低这个问题,提出了一种基于鲸鱼优化(Whale Optimization Algorithm,WOA)算法和模拟退火(Simulated Annealing,SA)算法混合优化的BP神经网络(Back Propagation Neural Network)动态称重模型。首先,简单介绍了动态称重系统的结构和原理。然后,通过小波变换对动态称重系统的采样信号进行过滤重构处理,经过计算得到的动态车重、车速和轴数作为BP神经网络模型的输入参数。其次,建立了一个由WOSA算法优化的BP神经网络来预测实际车辆总重和轴重。最后,比较了WOSA算法优化的BP神经网络模型的预测能力并得出结论。仿真结果表明,WOSA-BP车辆动态称重模型收敛速度快,精度高,最大总重的相对误差为0.58%,最大轴重相对误差为6.73%。

Multipath Selection Algorithm Based on Dynamic Flow Prediction

Traditional traffic management techniques appear to be incompetent in complex data center networks, so proposes a load balancing strategy based on Long Short-Term Memory (LSTM) and quantum annealing by Software Defined Network (SDN) to dynamically predict the traffic and comprehensively consider the current and predicted load of the network in order to select the optimal forwarding path and balance the network load. Experiments have demonstrated that the algorithm achieves significant improvement in both system throughput and average packet loss rate for the purpose of improving network quality of service.

基于NSA/SA双模技术的锚点与非锚点精准切换对比

在5G基站的高层覆盖场景中,锚点与非锚点的切换是关键问题。锚点是提供稳定服务的主要基站,非锚点则是附近的辅助基站。通过设计优化算法来实现锚点与非锚点的切换可以提高网络资源利用效率和用户体验,进一步增强网络容量和性能。选择NSA/SA双模共享技术方案,确定5G基站高层覆盖场景部署情况,自行选择单锚点或双锚点共享载波方式。在移动性管理中获取5G基站高层覆盖场景,根据分流形式等特征定义锚点与非锚点的切换容量,以更新路径为前提设计切换流程。实验结果表明,在所提算法下可以保证锚点与非锚点的切换时延,且数据传输的丢包率可以控制在8%以内。