Improved Genetic Optimization Algorithm with Subdomain Model for Multi-objective Optimal Design of SPMSM

For an optimal design of a surface-mounted permanent magnet synchronous motor(SPMSM),many objective functions should be considered.The classical optimization methods,which have been habitually designed based on magnetic circuit law or finite element analysis(FEA),have inaccuracy or calculation time problems when solving the multi-objective problems.To address these problems,the multi-independent-population genetic algorithm(MGA)combined with subdomain(SD)model are proposed to improve the performance of SPMSM such as magnetic field distribution,cost and efficiency.In order to analyze the flux density harmonics accurately,the accurate SD model is first established.Then,the MGA with time-saving SD model are employed to search for solutions which belong to the Pareto optimal set.Finally,for the purpose of validation,the electromagnetic performance of the new design motor are investigated by FEA,comparing with the initial design and conventional GA optimal design to demonstrate the advantage of MGA optimization method.

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.

Multi-objective Trajectory Planning Method based on the Improved Elitist Non-dominated Sorting Genetic Algorithm

Robot manipulators perform a point-point task under kinematic and dynamic constraints.Due to multi-degreeof-freedom coupling characteristics,it is difficult to find a better desired trajectory.In this paper,a multi-objective trajectory planning approach based on an improved elitist non-dominated sorting genetic algorithm(INSGA-II)is proposed.Trajectory function is planned with a new composite polynomial that by combining of quintic polynomials with cubic Bezier curves.Then,an INSGA-II,by introducing three genetic operators:ranking group selection(RGS),direction-based crossover(DBX)and adaptive precision-controllable mutation(APCM),is developed to optimize travelling time and torque fluctuation.Inverted generational distance,hypervolume and optimizer overhead are selected to evaluate the convergence,diversity and computational effort of algorithms.The optimal solution is determined via fuzzy comprehensive evaluation to obtain the optimal trajectory.Taking a serial-parallel hybrid manipulator as instance,the velocity and acceleration profiles obtained using this composite polynomial are compared with those obtained using a quintic B-spline method.The effectiveness and practicability of the proposed method are verified by simulation results.This research proposes a trajectory optimization method which can offer a better solution with efficiency and stability for a point-to-point task of robot manipulators.

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.

Optimal Site and Size of Distributed Generation Allocation in Radial Distribution Network Using Multi-objective Optimization

Distributed generation(DG)allocation in the distribution network is generally a multi-objective optimization problem.The maximum benefits of DG injection in the distribution system highly depend on the selection of an appropriate number of DGs and their capacity along with the best location.In this paper,the improved decomposition based evolutionary algorithm(I-DBEA)is used for the selection of optimal number,capacity and site of DG in order to minimize real power losses and voltage deviation,and to maximize the voltage stability index.The proposed I-DBEA technique has the ability to incorporate non-linear,nonconvex and mixed-integer variable problems and it is independent of local extrema trappings.In order to validate the effectiveness of the proposed technique,IEEE 33-bus,69-bus,and 119-bus standard radial distribution networks are considered.Furthermore,the choice of optimal number of DGs in the distribution system is also investigated.The simulation results of the proposed method are compared with the existing methods.The comparison shows that the proposed method has the ability to get the multi-objective optimization of different conflicting objective functions with global optimal values along with the smallest size of DG.

Aerodynamic multi-objective integrated optimization based on principal component analysis

Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which, as the purpose of this paper, aims to improve the convergence of Pareto front in multi-objective optimization design. The mathematical efficiency,the physical reasonableness and the reliability in dealing with redundant objectives of PCA are verified by typical DTLZ5 test function and multi-objective correlation analysis of supercritical airfoil,and the proposed method is integrated into aircraft multi-disciplinary design（AMDEsign） platform, which contains aerodynamics, stealth and structure weight analysis and optimization module.Then the proposed method is used for the multi-point integrated aerodynamic optimization of a wide-body passenger aircraft, in which the redundant objectives identified by PCA are transformed to optimization constraints, and several design methods are compared. The design results illustrate that the strategy used in this paper is sufficient and multi-point design requirements of the passenger aircraft are reached. The visualization level of non-dominant Pareto set is improved by effectively reducing the dimension without losing the primary feature of the problem.

改进多目标鮣鱼优化算法求解多容量养老院选址分配问题

为应对未来老龄化时代的到来,完善养老服务体系,针对养老院的选址分配问题,在考虑用户满意度和覆盖率的情况下,构建多目标优化模型。首先,考虑老人对养老院的满意度、养老院相对于社区位置满意度以及养老院相对于大型医院位置满意度,构建了最大化平均满意度和覆盖率以及最小化建设成本的多目标选址分配模型。其次,针对模型的特点,融入两阶段思想,设计了一种改进鮣鱼优化算法对模型进行求解。实验结果表明,该算法能够快速且有效地获得一簇Pareto解,可权衡实际需求和对不同目标的偏好,考虑满意度或成本,在Pareto解中可选择恰当的养老院选址分配方案。最后,通过与其他三种算法的对比分析,验证了模型的可行性和算法的优越性。