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.

基于SACPS算法的住宅小区电动汽车集群有序充电

针对传统电动汽车有序充电存在的充电影响因素考虑不全、优化目标过于单一、充电体验不友好等问题,以住宅小区电动汽车集群充电为研究对象,构建集群有序充电模型,提出模拟退火的混沌粒子群(simulated annealing chaotic particle swarm,简称SACPS)算法,且使用该文算法对集群有序充电模型进行优化,最后对优化结果进行仿真实验.仿真实验结果表明:相对于其他2种算法,该文算法能使电动汽车集群有序充电模型取得更低的最佳适应度;与集群无序充电相比,SACPS算法的集群有序充电的负荷峰值、负荷峰谷比、充电费用分别降低了42.62%,96.81%,15.61%;SACPS算法的集群有序充电在一定程度上实现了与其他负荷的错峰用电.因此,SACPS算法具有优越性.

基于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模型预测稳定性更优、预测精准度更高且对新样本泛化能力更强。

Location and Capacity Determination Method of Electric Vehicle Charging Station Based on Simulated Annealing Immune Particle Swarm Optimization

As the number of electric vehicles(EVs)continues to grow and the demand for charging infrastructure is also increasing,how to improve the charging infrastructure has become a bottleneck restricting the development of EVs.In other words,reasonably planning the location and capacity of charging stations is important for development of the EV industry and the safe and stable operation of the power system.Considering the construction and maintenance of the charging station,the distribution network loss of the charging station,and the economic loss on the user side of the EV,this paper takes the node and capacity of charging station planning as control variables and the minimum cost of system comprehensive planning as objective function,and thus proposes a location and capacity planning model for the EV charging station.Based on the problems of low efficiency and insufficient global optimization ability of the current algorithm,the simulated annealing immune particle swarm optimization algorithm(SA-IPSO)is adopted in this paper.The simulated annealing algorithm is used in the global update of the particle swarm optimization(PSO),and the immune mechanism is introduced to participate in the iterative update of the particles,so as to improve the speed and efficiency of PSO.Voronoi diagram is used to divide service area of the charging station,and a joint solution process of Voronoi diagram and SA-IPSO is proposed.By example analysis,the results show that the optimal solution corresponding to the optimisation method proposed in this paper has a low overall cost,while the average charging waiting time is only 1.8 min and the charging pile utilisation rate is 75.5%.The simulation comparison verifies that the improved algorithm improves the operational efficiency by 18.1%and basically does not fall into local convergence.

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.

Cascade refrigeration system synthesis based on hybrid simulated annealing and particle swarm optimization algorithm

Cascade refrigeration system(CRS)can meet a wider range of refrigeration temperature requirements and is more energy efficient than single-refrigerant refrigeration system,making it more widely used in low-temperature industry processes.The synthesis of a CRS with simultaneous consideration of heat integration between refrigerant and process streams is challenging but promising for significant cost saving and reduction of carbon emission.This study presented a stochastic optimization method for the synthesis of CRS.An MINLP model was formulated based on the superstructure developed for the CRS,and an optimization framework was proposed,where simulated annealing algorithm was used to evolve the numbers of pressure/temperature levels for all sub-refrigeration systems,and particle swarm optimization algorithm was employed to optimize the continuous variables.The effectiveness of the proposed methodology was verified by a case study of CRS optimization in an ethylene plant with 21.89%the total annual cost saving.

Imbalanced Data Classification Using SVM Based on Improved Simulated Annealing Featuring Synthetic Data Generation and Reduction

Imbalanced data classification is one of the major problems in machine learning.This imbalanced dataset typically has significant differences in the number of data samples between its classes.In most cases,the performance of the machine learning algorithm such as Support Vector Machine(SVM)is affected when dealing with an imbalanced dataset.The classification accuracy is mostly skewed toward the majority class and poor results are exhibited in the prediction of minority-class samples.In this paper,a hybrid approach combining data pre-processing technique andSVMalgorithm based on improved Simulated Annealing(SA)was proposed.Firstly,the data preprocessing technique which primarily aims at solving the resampling strategy of handling imbalanced datasets was proposed.In this technique,the data were first synthetically generated to equalize the number of samples between classes and followed by a reduction step to remove redundancy and duplicated data.Next is the training of a balanced dataset using SVM.Since this algorithm requires an iterative process to search for the best penalty parameter during training,an improved SA algorithm was proposed for this task.In this proposed improvement,a new acceptance criterion for the solution to be accepted in the SA algorithm was introduced to enhance the accuracy of the optimization process.Experimental works based on ten publicly available imbalanced datasets have demonstrated higher accuracy in the classification tasks using the proposed approach in comparison with the conventional implementation of SVM.Registering at an average of 89.65%of accuracy for the binary class classification has demonstrated the good performance of the proposed works.

THD Reduction for Permanent Magnet Synchronous Motor Using Simulated Annealing

Any nonlinear behavior of the system is analyzed by a useful way of Total Harmonic Distortion(THD)technique.Reduced THD achieves lower peak current,higher efficiency and longer equipment life span.Simulated annealing(SA)is applied due to the effectiveness of locating solutions that are close to ideal and to challenge large-scale combinatorial optimization for Permanent Magnet Synchronous Machine(PMSM).The parameters of direct torque controllers(DTC)for the drive are automatically adjusted by the optimization algorithm.Advantages of the PI-Fuzzy-SA algorithm are retained when used together.It also improves the rate of system convergence.Speed response improvement and har-monic reduction is achieved with SA-based DTC for PMSM.This mechanism is known to be faster than other algorithms.Also,it is observed that as compared to other algorithms,the projected algorithm yields a reduced total harmonic distor-tion.As a result of the employment of Space Vector Modulation(SVM)techni-que,the system is resistant to changes in motor specifications and load torque.Through MATLAB&Simulink simulation,the experiment is done and the per-formance is calculated for the controller.

Simulated Annealing with Deep Learning Based Tongue Image Analysis for Heart Disease Diagnosis

Tongue image analysis is an efficient and non-invasive technique to determine the internal organ condition of a patient in oriental medicine,for example,traditional Chinese medicine(TCM),Japanese traditional herbal medicine,and traditional Korean medicine(TKM).The diagnosis procedure is mainly based on the expert’s knowledge depending upon the visual inspec-tion comprising color,substance,coating,form,and motion of the tongue.But conventional tongue diagnosis has limitations since the procedure is inconsistent and subjective.Therefore,computer-aided tongue analyses have a greater potential to present objective and more consistent health assess-ments.This manuscript introduces a novel Simulated Annealing with Transfer Learning based Tongue Image Analysis for Disease Diagnosis(SADTL-TIADD)model.The presented SADTL-TIADD model initially pre-processes the tongue image to improve the quality.Next,the presented SADTL-TIADD technique employed an EfficientNet-based feature extractor to generate useful feature vectors.In turn,the SA with the ELM model enhances classification efficiency for disease detection and classification.The design of SA-based parameter tuning for heart disease diagnosis shows the novelty of the work.A wide-ranging set of simulations was performed to ensure the improved performance of the SADTL-TIADD algorithm.The experimental outcomes highlighted the superior of the presented SADTL-TIADD system over the compared methods with maximum accuracy of 99.30%.

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.

Improving Performance of Recurrent Neural Networks Using Simulated Annealing for Vertical Wind Speed Estimation

An accurate vertical wind speed(WS)data estimation is required to determine the potential for wind farm installation.In general,the vertical extrapolation of WS at different heights must consider different parameters fromdifferent locations,such as wind shear coefficient,roughness length,and atmospheric conditions.The novelty presented in this article is the introduction of two steps optimization for the Recurrent Neural Networks(RNN)model to estimate WS at different heights using measurements from lower heights.The first optimization of the RNN is performed to minimize a differentiable cost function,namely,mean squared error(MSE),using the Broyden-Fletcher-Goldfarb-Shanno algorithm.Secondly,the RNN is optimized to reduce a non-differentiable cost function using simulated annealing(RNN-SA),namely mean absolute error(MAE).Estimation ofWS vertically at 50 m height is done by training RNN-SA with the actualWS data a 10–40 m heights.The estimatedWS at height of 50 m and the measured WS at 10–40 heights are further used to train RNN-SA to obtain WS at 60 m height.This procedure is repeated continuously until theWS is estimated at a height of 180 m.The RNN-SA performance is compared with the standard RNN,Multilayer Perceptron(MLP),Support Vector Machine(SVM),and state of the art methods like convolutional neural networks(CNN)and long short-term memory(LSTM)networks to extrapolate theWS vertically.The estimated values are also compared with realWS dataset acquired using LiDAR and tested using four error metrics namely,mean squared error(MSE),mean absolute percentage error(MAPE),mean bias error(MBE),and coefficient of determination(R2).The numerical experimental results show that the MSE values between the estimated and actualWS at 180mheight for the RNN-SA,RNN,MLP,and SVM methods are found to be 2.09,2.12,2.37,and 2.63,respectively.

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

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

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

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

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

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

A Simulated Annealing-Based Algorithm for Traveling Salesman Problem

ＡＳｉｍｕｌａｔｅｄＡｎｎｅａｌｉｎｇ－ＢａｓｅｄＡｌｇｏｒｉｔｈｍｆｏｒＴｒａｖｅｌｉｎｇＳａｌｅｓｍａｎＰｒｏｂｌｅｍＧＵＯＭａｏｚｕＣＨＥＮＢｉｎＨＯＮＧＪｉａｒｏｎｇ（郭茂祖）（陈彬）（洪家荣）（Ｄｅｐｔ．ｏｆＣｏｍｐｕｔｅｒＳｃｉｅｎｃｅａ...

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.

Simulated Annealing for Land Cover Classification in PolSAR Images

Simulated Annealing (SA) is used in this work as a global optimization technique applied in discrete search spaces in order to change the characterization of pixels in a Polarimetric Synthetic Aperture Radar (PolSAR) image which have been classified with different label than the surrounding land cover type. Accordingly, Land Cover type classification is achieved with high reliability. For this purpose, an energy function is employed which is minimized by means of SA when the false classified pixels are correctly labeled. All PolSAR pixels are initially classified using 9 specifically selected types of land cover by means of Google Earth maps. Each Land Cover Type is represented by a histogram of the 8 Cameron’s elemental scatterers by means of coherent target decomposition (CTD). Each PolSAR pixel is categorized according to the local histogram of the elemental scatterers. SA is applied in the discreet space of nine land cover types. Classification results prove that the Simulated Annealing approach used is very successful for correctly separating regions with different Land Cover Types.

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. .