Improved non-dominated sorting genetic algorithm (NSGA)-II in multi-objective optimization studies of wind turbine blades

The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an example, a 5 MW wind turbine blade design is presented by taking the maximum power coefficient and the minimum blade mass as the optimization objectives. The optimal results show that this algorithm has good performance in handling the multi-objective optimization of wind turbines, and it gives a Pareto-optimal solution set rather than the optimum solutions to the conventional multi objective optimization problems. The wind turbine blade optimization method presented in this paper provides a new and general algorithm for the multi-objective optimization of wind turbines.

An Optimization Approach for Convolutional Neural Network Using Non-Dominated Sorted Genetic Algorithm-Ⅱ

In computer vision,convolutional neural networks have a wide range of uses.Images representmost of today’s data,so it’s important to know how to handle these large amounts of data efficiently.Convolutional neural networks have been shown to solve image processing problems effectively.However,when designing the network structure for a particular problem,you need to adjust the hyperparameters for higher accuracy.This technique is time consuming and requires a lot of work and domain knowledge.Designing a convolutional neural network architecture is a classic NP-hard optimization challenge.On the other hand,different datasets require different combinations of models or hyperparameters,which can be time consuming and inconvenient.Various approaches have been proposed to overcome this problem,such as grid search limited to low-dimensional space and queuing by random selection.To address this issue,we propose an evolutionary algorithm-based approach that dynamically enhances the structure of Convolution Neural Networks(CNNs)using optimized hyperparameters.This study proposes a method using Non-dominated sorted genetic algorithms(NSGA)to improve the hyperparameters of the CNN model.In addition,different types and parameter ranges of existing genetic algorithms are used.Acomparative study was conducted with various state-of-the-art methodologies and algorithms.Experiments have shown that our proposed approach is superior to previous methods in terms of classification accuracy,and the results are published in modern computing literature.

Planning of DC Electric Spring with Particle Swarm Optimization and Elitist Non-dominated Sorting Genetic Algorithm

This paper addresses the planning problem of parallel DC electric springs (DCESs). DCES, a demand-side management method, realizes automatic matching of power consumption and power generation by adjusting non-critical load (NCL) and internal storage. It can offer higher power quality to critical load (CL), reduce power imbalance and relieve pressure on energy storage systems (RESs). In this paper, a planning method for parallel DCESs is proposed to maximize stability gain, economic benefits, and penetration of RESs. The planning model is a master optimization with sub-optimization to highlight the priority of objectives. Master optimization is used to improve stability of the network, and sub-optimization aims to improve economic benefit and allowable penetration of RESs. This issue is a multivariable nonlinear mixed integer problem, requiring huge calculations by using common solvers. Therefore, particle Swarm optimization (PSO) and Elitist non-dominated sorting genetic algorithm (NSGA-II) were used to solve this model. Considering uncertainty of RESs, this paper verifies effectiveness of the proposed planning method on IEEE 33-bus system based on deterministic scenarios obtained by scenario analysis.

Satellite constellation design with genetic algorithms based on system performance

Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.

Suspended sediment load prediction using non-dominated sorting genetic algorithm Ⅱ

Awareness of suspended sediment load (SSL) and its continuous monitoring plays an important role in soil erosion studies and watershed management.Despite the common use of the conventional model of the sediment rating curve (SRC) and the methods proposed to correct it,the results of this model are still not sufficiently accurate.In this study,in order to increase the efficiency of SRC model,a multi-objective optimization approach is proposed using the Non-dominated Sorting Genetic Algorithm Ⅱ (NSGA-Ⅱ) algorithm.The instantaneous flow discharge and SSL data from the Ramian hydrometric station on the Ghorichay River,Iran are used as a case study.In the first part of the study,using self-organizing map (SOM),an unsupervised artificial neural network,the data were clustered and classified as two homogeneous groups as 70% and 30% for use in calibration and evaluation of SRC models,respectively.In the second part of the study,two different groups of SRC model comprised of conventional SRC models and optimized models (single and multi-objective optimization algorithms) were extracted from calibration data set and their performance was evaluated.The comparative analysis of the results revealed that the optimal SRC model achieved through NSGA-Ⅱ algorithm was superior to the SRC models in the daily SSL estimation for the data used in this study.Given that the use of the SRC model is common,the proposed model in this study can increase the efficiency of this regression model.

OPTIMIZATION ON ANTENNA PATTERN OF SPACEBORNE SAR WITH IMPROVED NSGA-Ⅱ

Optimization of antenna array pattern used in a spaceborne Synthetic Aperture Radar (SAR) system is considered in this study. A robust evolutionary algorithm, Non-dominated Sorting Genetic Algorithms (the improved NSGA-Ⅱ), is applied on a spaceborne SAR antenna pattern design. The system consists of two objective functions with two constraints. Pareto fronts are generated as a result of multi-objective optimization. After being validated by a test problem ZDT4, the algorithms are used to synthesize spaceborne SAR antenna radiation pattern. The good results with low Ambi- guity-to-Signal Ratio (ASR) and high directivity are obtained in the paper.

Strengthened Dominance Relation NSGA-Ⅲ Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.

Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis

Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.

Optimization of solar thermal power station LCOE based on NSGA-Ⅱ algorithm

In view of the high cost of solar thermal power generation in China,it is difficult to realize large-scale production in engineering and industrialization.Non-dominated sorting genetic algorithm II(NSGA-II)is applied to optimize the levelling cost of energy(LCOE)of the solar thermal power generation system in this paper.Firstly,the capacity and generation cost of the solar thermal power generation system are modeled according to the data of several sets of solar thermal power stations which have been put into production abroad.Secondly,the NSGA-II genetic algorithm and particle swarm algorithm are applied to the optimization of the solar thermal power station LCOE respectively.Finally,for the linear Fresnel solar thermal power system,the simulation experiments are conducted to analyze the effects of different solar energy generation capacities,different heat transfer mediums and loan interest rates on the generation price.The results show that due to the existence of scale effect,the greater the capacity of the power station,the lower the cost of leveling and electricity,and the influence of the types of heat storage medium and the loan on the cost of leveling electricity are relatively high.

Models for Location Inventory Routing Problem of Cold Chain Logistics with NSGA-Ⅱ Algorithm

In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location,inventory and transportation.Due to the complex of LIR problem( LIRP), a multi-objective genetic algorithm(GA), non-dominated sorting in genetic algorithm Ⅱ( NSGA-Ⅱ) has been introduced. Its performance is tested over a real case for the proposed problems. Results indicate that NSGA-Ⅱ provides a competitive performance than GA,which demonstrates that the proposed model and multi-objective GA are considerably efficient to solve the problem.

Non-dominated sorting based multi-page photo collage

The development of social networking services(SNSs)revealed a surge in image sharing.The sharing mode of multi-page photo collage(MPC),which posts several image collages at a time,can often be observed on many social network platforms,which enables uploading images and arrangement in a logical order.This study focuses on the construction of MPC for an image collection and its formulation as an issue of joint optimization,which involves not only the arrangement in a single collage but also the arrangement among different collages.Novel balance-aware measurements,which merge graphic features and psychological achievements,are introduced.Non-dominated sorting genetic algorithm is adopted to optimize the MPC guided by the measurements.Experiments demonstrate that the proposed method can lead to diverse,visually pleasant,and logically clear MPC results,which are comparable to manually designed MPC results.

Robust Optimization Method of Cylindrical Roller Bearing by Maximizing Dynamic Capacity Using Evolutionary Algorithms

Optimization of cylindrical roller bearings(CRBs)has been performed using a robust design.It ensures that the changes in the objective function,even in the case of variations in design variables during manufacturing,have a minimum possible value and do not exceed the upper limit of a desired range of percentage variation.Also,it checks the feasibility of design outcome in presence of manufacturing tolerances in design variables.For any rolling element bearing,a long life indicates a satisfactory performance.In the present study,the dynamic load carrying capacity C,which relates to fatigue life,has been optimized using the robust design.In roller bearings,boundary dimensions(i.e.,bearing outer diameter,bore diameter and width)are standard.Hence,the performance is mainly affected by the internal dimensions and not the bearing boundary dimensions mentioned formerly.In spite of this,besides internal dimensions and their tolerances,the tolerances in boundary dimensions have also been taken into consideration for the robust optimization.The problem has been solved with the elitist non-dominating sorting genetic algorithm(NSGA-II).Finally,for the visualization and to ensure manufacturability of CRB using obtained values,radial dimensions drawing of one of the optimized CRB has been made.To check the robustness of obtained design after optimization,a sensitivity analysis has also been carried out to find out how much the variation in the objective function will be in case of variation in optimized value of design variables.Optimized bearings have been found to have improved life as compared with standard ones.

提升光储充电站运行效率的多目标优化配置策略

光储充电站的运行效率直接影响到其经济效益及电网侧的电能质量。针对在进行容量配置时对运行效率考虑不足会导致非必要的电能损耗,文中提出一种提升光储充电站运行效率的多目标优化配置策略。通过分析光储充电站变换器与内源线路功率损耗对于运行效率的影响,提出充电站的运行效率评估指标与计算方法,并讨论光储充电站运行效率对其容量配置的影响。建立以充电站经济效益、运行效率、电网侧峰谷供电功率补偿能力最佳为优化目标的多目标容量优化配置策略。针对优化目标特性,提出一种改进二代非支配排序遗传算法得到优化策略求解方法。选取中国西南地区某典型光储充电站运营场景,通过算例验证了优化策略的有效性与优越性。

低碳视角下多式联运网络设计优化问题研究

网络设计与低碳补贴激励措施,是推进多式联运可持续发展的重要途径。基于此,从低碳视角研究水陆联运网络设计优化与补贴模式问题,考虑政府管理部门与物流用户的互动博弈行为,构建基于双层规划的水陆联运物流网络优化模型。该模型中上层规划(政府层)确定网络扩容投资决策及其补贴方案,从而最小化扩容投资与低碳补贴总成本,以及系统中碳排放量;下层模型(物流用户)则是基于广义费用的用户均衡分配模型。针对上述双层优化模型的特点,设计了基于相继平均配流算法(MSA)的改进快速非支配排序遗传算法(NSGA-Ⅱ)。以长江经济带中游地区的水陆联运物流网络为例,进行相应的实证研究,验证上述优化模型及算法的有效性;并且,在对网络进行扩容投资的情况下,对比4种补贴方案,即1)对铁路及水运弧段按固定值进行补贴;2)不进行补贴;3)不同地区的铁路及水运弧段的补贴不同;4)补贴值随机连续。研究结果表明:扩容投资可以减少网络中的超载弧段数量,同时提升网络性能;对铁路及水运弧段进行运输补贴能有效降低碳排放量;若政府关注预算限制,则倾向于按固定值补贴的方案;若更重视碳减排效果,则倾向于采取不同地区不同补贴值的方案。

基于智能优化算法的高频变压器电磁结构优化设计

高频变压器(HFT)作为电力电子变换器等功率变换装备的核心部件,其优化设计是实现高功率密度、高效率和高可靠性的重要环节。为有效解决高频条件下显著的涡流效应和复杂紧凑的结构使变压器损耗难以准确计算、针对绝缘设计裕量不足的问题,本文提出计及高频效应和结构效应的电磁场建模方法,构建了高频变压器多目标协同优化设计方案。首先建立了低成本与高效率兼备的磁心损耗计算模型。其次,根据面积等效原理推导了考虑绕组结构效应的近似Dowell模型,实现绕组损耗的高精度计算。然后提出了考虑绕组端部效应和频率影响的漏感计算模型,减小漏感对于结构和频率的依赖性。在此基础上,采用一种新型多重绝缘结构,提高绕组间的绝缘耐压水平。最后,基于改进的非支配排序遗传算法(INSGA-Ⅱ)和自由参数扫描法建立了高频变压器的优化设计流程,根据筛选的最优设计方案研制了一台高频变压器样机。

基于改进遗传算法的舾装件托盘多载具协同拣选方法

为提升舾装件托盘的拣选效率,建立拣选过程的数学模型,提出一种基于改进遗传算法(Improved Genetic Algorithm, IGA)的舾装件托盘多载具协同拣选方法。针对遗传算法(Genetic Algorithm, GA)流程与实际拣选过程的差异,改进GA的初始化过程和染色体交叉方式,并对变异过程进行更贴近实际生产的修改。针对GA难以得到全局最优解的问题,采用变邻域搜索(Variable Neighborhood Search, VNS)策略降低陷入局部最优解的可能性。采用实例计算验证该算法的有效性,可优化传统舾装件托盘拣选方法。

基于改进NSGA-Ⅱ算法的RV减速器参数多目标优化研究

旋转矢量(RV)减速器是工业机器人核心部件,对于机器人的性能起到关键作用。针对提升RV减速器综合性能的问题,从优化传动压力角的相关参数出发,对其结构参数(摆线轮齿数、短幅系数、针径系数、摆线轮宽度等)的多目标优化设计进行了研究。首先,研究了摆线轮平均压力角、传动效率和传动机构体积三者的相关参数之间的关系;然后,以此为优化目标,在摆线轮标准齿廓方程的基础上建立了多目标优化数学模型(该模型采用了基于非支配占优排序遗传学算法(NSGA-Ⅱ)改进了交叉算子系数生成的改进NSGA-Ⅱ算法);通过模型求解得到了帕累托最优解集,根据模糊集合理论的相关方法选取了最优解;最后,以某公司220-BX型RV减速器为例,进行了优化设计,建立了3D模型后进行了有限元分析,并加工出实验样机,进行了传动效率对比实验。实验结果表明:摆线轮平均压力角减小了7.19%,体积减小了11.1%,传动效率提高了4.9%。研究结果表明:该模型交互性强,能提高设计效率并节省设计开销,可为实际RV减速器工程优化设计提供参考。

A Multi-Objective Optimization for Locating Maintenance Stations and Operator Dispatching of Corrective Maintenance

In this study,we introduce a novel multi-objective optimization model tailored for modern manufacturing,aiming to mitigate the cost impacts of operational disruptions through optimized corrective maintenance.Central to our approach is the strategic placement of maintenance stations and the efficient allocation of personnel,addressing a crucial gap in the integration of maintenance personnel dispatching and station selection.Our model uniquely combines the spatial distribution of machinery with the expertise of operators to achieve a harmonious balance between maintenance efficiency and cost-effectiveness.The core of our methodology is the NSGA Ⅲ+Dispatch,an advanced adaptation of the Non-Dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ),meticulously designed for the selection of maintenance stations and effective operator dispatching.This method integrates a comprehensive coding process,crossover operator,and mutation operator to efficiently manage multiple objectives.Rigorous empirical testing,including a detailed analysis from a taiwan region electronic equipment manufacturer,validated the effectiveness of our approach across various scenarios of machine failure frequencies and operator configurations.The findings reveal that the proposed model significantly outperforms current practices by reducing response times by up to 23%in low-frequency and 28.23%in high-frequency machine failure scenarios,leading to notable improvements in efficiency and cost reduction.Additionally,it demonstrates significant improvements in oper-ational efficiency,particularly in selective high-frequency failure contexts,while ensuring substantial manpower cost savings without compromising on operational effectiveness.This research significantly advances maintenance strategies in production environments,providing the manufacturing industry with practical,optimized solutions for diverse machine malfunction situations.Furthermore,the methodologies and principles developed in this study have potential applications in various other sectors,including healthcare,transportation,and energy,where maintenance efficiency and resource optimization are equally critical.

基于改进NSGA-Ⅲ的微电网储能多目标优化配置

为提升微电网中储能配置的可靠性与经济性,提出一种基于改进NSGA-Ⅲ算法的微电网储能系统容量多目标优化配置方法。构建了微电网储能容量配置双层优化模型,外层以储能一次投资成本最小为优化目标,内层以微电网综合运行成本最小、负荷缺电率最小和可再生能源利用率最大为优化目标;在传统NSGA-Ⅲ算法中嵌入Levy理论和一个区域角度量化机制,使其更加适用于所提直流微电网储能容量双层优化配置模型的寻优迭代求解,并结合典型日数据,仿真验证了所提模型及算法的有效性。

基于改进遗传算法的220 kV变电站限流调度策略研究

220 kV变电站运行方式较复杂,且变电站限流调度具有多目标约束,运用传统的遗传算法难以找到最优的限流调度策略。提出了基于改进遗传算法的220 kV变电站限流调度策略。分析220 kV变电站的四种限流调度措施对导纳矩阵的影响。结合分析结果,建立限流调度策略效果模型和经济成本模型,并将两者相结合搭建220 kV变电站限流调度多目标优化策略。采用混沌映射、非支配排序和自适应函数的改进遗传算法进行多目标优化策略求解,所获取的最优解即为最优限流调度策略。结合最优策略,实现220 kV变电站限流调度。仿真试验结果表明,所提策略的限流调度效果更理想、电能损耗量更少。该策略对于变电站限流调度具有参考价值。