Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm

The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.

Solving Job-Shop Scheduling Problem Based on Improved Adaptive Particle Swarm Optimization Algorithm

An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.

Angular insensitive nonreciprocal ultrawide band absorption in plasma-embedded photonic crystals designed with improved particle swarm optimization algorithm

Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded photonic crystals arranged in a structure composed of periodic and quasi-periodic sequences on a normalized scale.The effective dielectric function,which determines the absorption of the plasma,is subject to the basic parameters of the plasma,causing the absorption of the proposed absorber to be easily modulated by these parameters.Compared with other quasi-periodic sequences,the Octonacci sequence is superior both in relative bandwidth and absolute bandwidth.Under further optimization using IPSO with 14 parameters set to be optimized,the absorption characteristics of the proposed structure with different numbers of layers of the smallest structure unit N are shown and discussed.IPSO is also used to address angular insensitive nonreciprocal ultrawide bandwidth absorption,and the optimized result shows excellent unidirectional absorbability and angular insensitivity of the proposed structure.The impacts of the sequence number of quasi-periodic sequence M and collision frequency of plasma1ν1 to absorption in the angle domain and frequency domain are investigated.Additionally,the impedance match theory and the interference field theory are introduced to express the findings of the algorithm.

Multi-objective reservoir operation using particle swarm optimization with adaptive random inertia weights

Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.

Research on Optimization of Freight Train ATO Based on Elite Competition Multi-Objective Particle Swarm Optimization

In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm.

Study on Optimization of Urban Rail Train Operation Control Curve Based on Improved Multi-Objective Genetic Algorithm

A multi-objective improved genetic algorithm is constructed to solve the train operation simulation model of urban rail train and find the optimal operation curve.In the train control system,the conversion point of operating mode is the basic of gene encoding and the chromosome composed of multiple genes represents a control scheme,and the initial population can be formed by the way.The fitness function can be designed by the design requirements of the train control stop error,time error and energy consumption.the effectiveness of new individual can be ensured by checking the validity of the original individual when its in the process of selection,crossover and mutation,and the optimal algorithm will be joined all the operators to make the new group not eliminate on the best individual of the last generation.The simulation result shows that the proposed genetic algorithm comparing with the optimized multi-particle simulation model can reduce more than 10%energy consumption,it can provide a large amount of sub-optimal solution and has obvious optimization effect.

A hybrid discrete particle swarm optimization-genetic algorithm for multi-task scheduling problem in service oriented manufacturing systems

To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.

Dynamic Self-Adaptive Double Population Particle Swarm Optimization Algorithm Based on Lorenz Equation

In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.

Particle Swarm Optimization Algorithm Based on Chaotic Sequences and Dynamic Self-Adaptive Strategy

To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

Milling Parameters Optimization of Al-Li Alloy Thin-Wall Workpieces Using Response Surface Methodology and Particle Swarm Optimization

To improve the milling surface quality of the Al-Li alloy thin-wall workpieces and reduce the cutting energy consumption.Experimental research on the milling processing of AA2195 Al-Li alloy thin-wall workpieces based on Response Surface Methodology was carried out.The single factor and interaction of milling parameters on surface roughness and specific cutting energy were analyzed,and the multi-objective optimization model was constructed.The Multiobjective Particle Swarm Optimization algorithm introducing the Chaos Local Search algorithm and the adaptive inertial weight was applied to determine the optimal combination of milling parameters.It was observed that surface roughness was mainly influenced by feed per tooth,and specific cutting energy was negatively correlated with feed per tooth,radial cutting depth and axial cutting depth,while cutting speed has a non-significant influence on specific cutting energy.The optimal combination of milling parameters with different priorities was obtained.The experimental results showed that the maximum relative error of measured and predicted values was 8.05%,and the model had high reliability,which ensured the low surface roughness and cutting energy consumption.It was of great guiding significance for the success of Al-Li alloy thin-wall milling with a high precision and energy efficiency.

Dynamic Multi-objective Optimization of Chemical Processes Using Modified BareBones MOPSO Algorithm

Dynamic multi-objective optimization is a complex and difficult research topic of process systems engineering. In this paper,a modified multi-objective bare-bones particle swarm optimization( MOBBPSO) algorithm is proposed that takes advantage of a few parameters of bare-bones algorithm. To avoid premature convergence,Gaussian mutation is introduced; and an adaptive sampling distribution strategy is also used to improve the exploratory capability. Moreover, a circular crowded sorting approach is adopted to improve the uniformity of the population distribution.Finally, by combining the algorithm with control vector parameterization,an approach is proposed to solve the dynamic optimization problems of chemical processes. It is proved that the new algorithm performs better compared with other classic multiobjective optimization algorithms through the results of solving three dynamic optimization problems.

Short-term Load Prediction of Integrated Energy System with Wavelet Neural Network Model Based on Improved Particle Swarm Optimization and Chaos Optimization Algorithm

To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)model optimized by the improved particle swarm optimization(IPSO)and chaos optimization algorithm(COA)for short-term load prediction of IES.The proposed model overcomes the disadvantages of the slow convergence and the tendency to fall into the local optimum in traditional WNN models.First,the Pearson correlation coefficient is employed to select the key influencing factors of load prediction.Then,the traditional particle swarm optimization(PSO)is improved by the dynamic particle inertia weight.To jump out of the local optimum,the COA is employed to search for individual optimal particles in IPSO.In the iteration,the parameters of WNN are continually optimized by IPSO-COA.Meanwhile,the feedback link is added to the proposed model,where the output error is adopted to modify the prediction results.Finally,the proposed model is employed for load prediction.The experimental simulation verifies that the proposed model significantly improves the prediction accuracy and operation efficiency compared with the artificial neural network(ANN),WNN,and PSO-WNN.

Interactive Multi-objective Optimization Design for the Pylon Structure of an Airplane

The pylon structure of an airplane is very complex, and its high-fidelity analysis is quite time-consuming. If posterior preference optimization algorithm is used to solve this problem, the huge time consumption will be unacceptable in engineering practice due to the large amount of evaluation needed for the algorithm. So, a new interactive optimization algorithm-interactive multi-objective particle swarm optimization （IMOPSO） is presented. IMOPSO is efficient, simple and operable. The decision-maker can expediently determine the accurate preference in IMOPSO. IMOPSO is used to perform the pylon structure optimization design of an airplane, and a satisfactory design is achieved after only 12 generations of IMOPSO evolutions. Compared with original design, the maximum displacement of the satisfactory design is reduced, and the mass of the satisfactory design is decreased for 22%.

Multi-objective reconfigurable production line scheduling for smart home appliances

In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.

Research on the Optimization Approach for Cargo Oil Tank Design Based on the Improved Particle Swarm Optimization Algorithm

Based on the improved particle swarm optimization(PSO) algorithm,an optimization approach for the cargo oil tank design(COTD) is presented in this paper.The purpose is to design an optimal overall dimension of the cargo oil tank(COT) under various kinds of constraints in the preliminary design stage.A non-linear programming model is built to simulate the optimization design,in which the requirements and rules for COTD are used as the constraints.Considering the distance between the inner shell and hull,a fuzzy constraint is used to express the feasibility degree of the double-hull configuration.In terms of the characteristic of COTD,the PSO algorithm is improved to solve this problem.A bivariate extremum strategy is presented to deal with the fuzzy constraint,by which the maximum and minimum cargo capacities are obtained simultaneously.Finally,the simulation demonstrates the feasibility and effectiveness of the proposed approach.

改进粒子群优化算法结合BP神经网络模型的水体透射光谱总磷浓度预测研究

使用光谱数据结合融合算法对水体污染物含量进行准确检测以保护水资源已成为一个关键问题。然而,光谱数据的高维特性以及模型的不稳定常常导致预测效果不佳,无法准确的进行检测。本研究提出了一种环保和准确的方法,实现对长江水体中总磷浓度含量的预测。具体而言,首先对测得的长江水质光谱数据进行最大最小归一化和均值中心化两种预处理操作,在消除不同数据量级差异的同时去除了噪声,确保了数据的一致性和可靠性。其次,为了解决光谱数据的高维度问题,采用了核主成分分析(KPCA)方法来降低数据维度并提取特征。KPCA方法通过在高维度的空间中找到一个分类平面,选出能代表原始数据99.42%信息量的前6个主成分,用于后续预测模型的训练。接着在原始粒子群算法的基础上引入了粒子初始化规则、多种群竞争策略、参数自适应更新策略、种群多样性引导策略和粒子变异机制,提高了粒子群的寻优能力,降低粒子陷入局部最优解的概率。并使用改进后的粒子群算法对BP神经网络(BPNN)中的初始化权重和参数大小进行寻优,从而加快网络的收敛效果,提高预测能力。最后,使用本研究所提出的预测模型对测试集中的样本进行总磷浓度的预测,实验结果得到R^(2)为0.975786,RMSE为0.002242,MAE为0.001612。将本模型与当前预测性能较好的其他基准模型进行预测效果的对比,本研究所提出的模型对长江水体总磷浓度预测拟合效果更好,精确度更高。在水资源保护和环境管理领域中使用光谱数据结合融合算法进行预测模型的研究和实践提供了新的思路和观点。

突发公共卫生事件下救援物资配送方案研究

在突发公共卫生事件封控情况下,大规模应急救援物资的配送需要兼顾效率、成本及安全性,在有限的救援投入下获取最大化资源利用和最小化配送成本,同时避免人员的交叉感染。为此,提出了基于两层配送网络的应急物资配送方案,并提出改进粒子群优化算法(Improved Particle Swarm Optimization Algorithm,IPSOA)对配送路径进行优化。首先,根据行政区划分以及物资需求点的空间分布、各需求点的居民人数和需求量,采用层次聚类算法建立由“物资储备中心-物资集散中心”和“物资集散中心-物资需求点”构成的两层配送网络,每层配送网络都由多配送中心和多需求点组成,该物资配送属于多配送车辆的多中心车辆路径规划问题(Multi-Depot Vehicle Routing Problem,MDVRP)。其次,为了获取合理高效的配送路径,以配送成本最小为目标,构建基于多约束的物资配送优化模型,并提出基于人工鱼群算法(Artificial Fish Swarm Algorithm,AFSA)的粒子群优化(AFSA-PSO)算法对两层配送网络进行求解。最后,以某市9个行政区在疫情封控期间的数据为例验证两层配送网络和AFSA-PSO算法的有效性。结果表明:构建的两层配送网络和AFSA-PSO算法能够对多车辆MDVRP问题进行有效求解,科学规划配送路径;算法对比发现,AFSA-PSO能够避免模型过早收敛,且能够获取比遗传算法和粒子群优化算法更少的车辆数和更短的配送路径,有效地降低配送成本,提高经济效益。

基于空间特点的老旧居民小区同功能区域重划分研究

老旧小区的居住环境可能因年久失修而变得陈旧和不安全,重划分研究有助于改善小区的绿化、照明、交通等基础设施,提升居民的居住舒适度和安全感。为此,该研究分析了老旧居民小区空间特点,基于此,以空气质量、噪声水平、交通便利性、绿化覆盖率为目标函数,结合目标权重,构建老旧居民小区同功能区域重划分模型。引入免疫机制改进免疫粒子群算法,求解该模型。实例分析结果显示:研究方法应用后同功能区域利用率明显升高。该方法能够充分利用小区现有的空间资源,通过合理布局和功能整合,提高空间利用率,减少资源浪费。

Optimizing the lattice design of a diffraction-limited storage ring with a rational combination of particle swarm and genetic algorithms

In the lattice design of a diffraction-limited storage ring（DLSR） consisting of compact multi-bend achromats（MBAs）, it is challenging to simultaneously achieve an ultralow emittance and a satisfactory nonlinear performance, due to extremely large nonlinearities and limited tuning ranges of the element parameters. Nevertheless, in this paper we show that the potential of a DLSR design can be explored with a successive and iterative implementation of the multi-objective particle swarm optimization（MOPSO） and multi-objective genetic algorithm（MOGA）. For the High Energy Photon Source, a planned kilometer-scale DLSR, optimizations indicate that it is feasible to attain a natural emittance of about 50 pm·rad, and simultaneously realize a sufficient ring acceptance for on-axis longitudinal injection, by using a hybrid MBA lattice. In particular, this study demonstrates that a rational combination of the MOPSO and MOGA is more effective than either of them alone, in approaching the true global optima of an explorative multi-objective problem with many optimizing variables and local optima.