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.

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 adaptive reanalysis method for genetic algorithm with application to fast truss optimization

Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.

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.

Improved genetic algorithm for nonlinear programming problems

An improved genetic algorithm（IGA） based on a novel selection strategy to handle nonlinear programming problems is proposed.Each individual in selection process is represented as a three-dimensional feature vector which is composed of objective function value,the degree of constraints violations and the number of constraints violations.It is easy to distinguish excellent individuals from general individuals by using an individuals＇ feature vector.Additionally,a local search（LS） process is incorporated into selection operation so as to find feasible solutions located in the neighboring areas of some infeasible solutions.The combination of IGA and LS should offer the advantage of both the quality of solutions and diversity of solutions.Experimental results over a set of benchmark problems demonstrate that IGA has better performance than other algorithms.

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.

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.

土石坝风险等级智能预测分析及模型优化研究

大坝溃坝会造成大量的生命财产损失和巨大的环境破坏。精准快速确定土石坝风险等级,对于控制土石坝溃坝危害具有重要意义。本文采用K-最近邻(KNN)算法填补了数据库中大量缺失数据,引入遗传优化算法(GA)优化轻量级梯度提升机(LightGBM)超参数,建立了基于GA-LightGBM的土石坝风险等级快速预测模型。采用受试者工作特征曲线(ROC)、曲线下面积(AUC)值等其他评价指标对模型精度进行验证,并将其与传统机器学习模型进行了对比。研究表明,所提模型预测准确率为89.95%,准确度最高。模型的AUC值为0.977,说明模型在适用性和预测精度方面都优于传统预测模型。采用SHAP分析对该模型进行了全局影响因素分析及案例分析,结果表明,检查频次是导致土石坝风险最重要的影响因素之一。

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.

基于改进的粒子群优化的FastSLAM方法

提出了一种基于改进的粒子群优化（IPSO）的快速同时定位和地图创建（FastSLAM）方法——IPSO FastSLAM算法。该算法在粒子预估过程中引入观测信息，调整了粒子的提议分布，增强了位置预测的准确性。改进的粒子群优化采用两步优化策略，即首先通过种群速度自适应调整惯性权重，有效地克服了粒子退化问题，改善了算法的实时性，然后针对粒子耗尽问题，在粒子群优化算法中引入遗传算法的变异运算对其进行改进，扩大解空间的范围，从而保持了种群的多样性。仿真和实时数据实验验证了该方法正确、可行。

平板式“快集快响”微小卫星布局优化设计方法

针对平板式“快集快响”微小卫星转动惯量大的问题,提出一种基于级联遗传算法的“快集快响”微小卫星布局优化设计方法。该方法采用“迁移+交换+调整”3种操作规划部组件在卫星上的布局与安装位置,以降低卫星的转动惯量。其中,“迁移”操作用于完成部组件与功能板块的最优匹配,实现功能板块间的质量均衡;“交换”操作用于完成同一功能板块内部组件的最优布局;“调整”操作通过在小范围内微调部组件的位置,进一步扩大最优解的搜索范围,使卫星获得最优的转动惯量与布局方案。通过在仿真算例中与其他2种优化方法进行对比,所提方法的性能优势得到验证;并通过工程实例展示了所提优化方法的有效性。

基于NSGA-Ⅱ串行模式搜索的新能源发电与抽水蓄能电站联合系统多时间尺度优化调度方法

针对新能源发电与抽水蓄能电站联合发电系统,提出一种多时间尺度优化调度策略,并提出一种结合快速非支配排序遗传算法(NSGA-Ⅱ)和模式搜索算法的NSGA-Ⅱ-PS算法,该策略针对不同的时间尺度分别设定目标函数与约束条件,对比NSGA-Ⅱ与NSGA-Ⅱ-PS在解决本调度问题结果上的优劣性。在日前、日中时间尺度对联合系统进行优化调度,制定调度计划。结果表明:在高比例新能源消纳的基础上,新能源发电与抽水蓄能电站联合系统多时间尺度优化调度可在日前、日中尺度实现联合系统经济安全运行。

基于FastICA的遗传径向基神经网络轴承故障诊断研究

针对电机轴承故障诊断效率低和诊断结果准确率不高的问题,提出一种基于FastICA的遗传径向基神经网络的优化算法。利用独立分量分析算法,将信号分离成多个独立的信号源;根据独立信号源构建独立特征向量;将分离所得的独立信号源作为样本,输入到遗传算法优化后的径向基神经网络中进行故障识别,并与其他分类算法比较。实验结果表明,对于电机轴承多信号的故障诊断,该算法具有更好的故障诊断能力。

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.

中国天眼馈源舱接收比的优化控制

建立了中国天眼——500米口径球面射电望远镜(FAST)馈源舱接收比优化控制的数学模型,得到天眼系统反射面的理想抛物面方程,并基于遗传算法给出天眼系统主索节点的调节方案,为天眼系统工作抛物面的构建提供了一个重要参考。数值仿真表明,在被观测天体方位角为36.795°,仰角为78.169°时,馈源舱接收比为61.43%,高出基准球面的馈源舱接收比约55.97个百分点,优化效果明显。

基于NSGA II的智慧交通信号优化控制研究

随着城市私家车的日益增多,交通拥堵等问题也越来越严重。交叉路口交通信号配时直接影响道路通行效率,而定时或多时段控制交通信号,无法及时根据车、人流量优化控制交通信号。以城市单交叉路口三车道为基础,来探讨基于NSGA II的智慧交通信号优化方案,以车辆延误、排序长度和行人延误三个目标优化交通信号配时方案。通过实验分析NSGA II和GA算法表明,NSGA II在多目标交通信号中配时更智慧,能取得更优交通效益。

FAST观测规划系统设计与研发

望远镜的动态调度是决定望远镜产出率的关键因素。本文在学习国内外望远镜调度规划的基础上,结合FAST实际情况,设计了FAST观测管理系统,同时实现了FAST观测规划子系统。FAST观测调度规划是一个多目标优化问题,本文在考虑影响望远镜观测数据质量的天气条件、观测目标的科学价值等影响因子的情况下,采用遗传算法对FAST观测申请MSB进行动态调度规划,最后将规划好的观测申请解析成FAST总控系统识别的指令集文本发送给总控系统。该系统还将向用户展示场址基本信息以及观测申请的观测进度等。通过观测调度,提高FAST的观测质量和产出率,同时减少观测人员的负担。

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.

基于截痕法和遗传算法的FAST主动反射面形状调节模型研究

文章旨在建立FAST(Five-hundred-meter Aperture Spherical radio Telescope)主动反射面调节模型,使得馈源舱能够最大概率地接收天体电磁波经反射面反射后的信号.根据主动反射面系统相关数据,首先建立假设目标天体在基准球面正上方的抛物线模型,利用遗传算法求解理想状态下的抛物面方程;然后通过空间旋转矩阵和截痕法,建立天体方位变换模型,求出天体不在基准球面正上方时的理想抛物面和反射面板的调节模型,进而得到调节后的馈源舱接收比和基准反射球面接收比.结果表明,该模型可使得馈源舱的接收比达到74.98%的水平,对实际的射电望远镜和主动反射面等相关内容有一定的借鉴意义.

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.