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.

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.

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.

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.

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 II的智慧交通信号优化控制研究

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

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.

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.

面向高效节能的螺旋输送机设计参数优化方法

为解决螺旋输送机在混凝土小预制件生产过程中的能耗高,效率低等问题,提出了一种面向高效率、低能耗的混凝土螺旋输送机设计参数优化方法。首先,建立混凝土螺旋输送机工作过程的速度和力学模型,揭示影响螺旋输送过程能耗和效率的重要因素。在此基础上,以螺距、转速和输送长度为优化变量,以螺旋输送过程总能耗最小、输送效率最大化为目标,建立混凝土螺旋输送机设计参数多目标优化模型,并提出一种基于改进的非支配排序遗传算法(NSGA-Ⅱ)进行优化求解。最后,通过将多目标优化结果与单目标优化结果进行对比分析,验证了所提出优化方法在提高混凝土螺旋输送效率的同时可有效降低生产能耗。

考虑交货期的双资源柔性作业车间节能调度

为解决含有机器和工人双资源约束的柔性作业车间节能调度问题,在考虑交货期的基础上,建立了以总提前和拖期惩罚值及总能耗最小为目标的双资源柔性作业车间节能调度模型。提出了一种改进的非支配排序遗传算法(improved non-dominated sorting genetic algorithmⅡ,INSGA-Ⅱ)进行求解。针对所优化的目标,设计了一种三阶段解码方法以获得高质量的可行解;利用动态自适应交叉和变异算子以获得更多优良个体;改进拥挤距离以获得收敛性和分布性更优的种群。将INSGA-Ⅱ与多种多目标优化算法进行对比分析,实验结果表明所提算法可行且有效。

基于混合遗传蚁群算法的多目标FJSP问题研究

针对多目标柔性作业车间调度问题求解过程中未综合考虑解集多样性与求解效率的问题,提出了一种混合遗传蚁群算法来求解。首先,通过改进的NSGA-Ⅱ(non-dominated sorting genetic algorithmⅡ)获取问题的较优解,以此来确定蚁群算法的初始信息素分布;其次,根据提出的自适应伪随机比例规则和改进的信息素更新规则来优化蚂蚁的遍历过程;最后,通过邻域搜索,扩大蚂蚁的搜索空间,从而提高解集的多样性。通过Kacem和BRdata算例进行实验验证,证明混合遗传蚁群算法具有更高的求解效率和更好解集多样性。

基于双链式结构的云制造系统内资源调度

为提高云制造系统内各参与主体间的信任度及资源调度效率,研究基于双链式结构的云制造系统。首先,对区块链技术应用于云制造系统中进行分析,设计企业信息公有链及制造资源联盟链上的业务流程。其次,提出将资源调度算法写入制造资源链的智能合约中自动执行资源调度,建立考虑创新性和匹配性的多目标资源调度模型,使用带精英策略的快速非支配排序遗传算法(NSGA-Ⅱ)进行模型求解。最后,进行实验仿真分析,将本文所提出双链式结构及资源调度模型与传统云制造资源调度模型做对比,验证模型的有效性。结果表明,在基于双链式结构的云制造系统内各参与节点间相互信任后,制造资源调度具有更优的非支配解集并且资源调度速度得到了提升。

基于NSGA-Ⅱ的自适应多尺度特征通道分组优化算法

针对轻量型卷积神经网络(LCNN)的精确度和复杂度均衡优化问题,提出基于快速非支配排序遗传算法(NSGA-Ⅱ)的自适应多尺度特征通道分组优化算法对LCNN特征通道分组结构进行优化。首先,将LCNN中的特征融合层结构的复杂度最小化和精确度最大化作为两个优化目标,进行双目标函数建模及理论分析;然后,设计基于NSGA-Ⅱ的LCNN结构优化框架,并在原始LCNN结构的深度卷积层之上增加基于NSGA-Ⅱ的自适应分组层,构建基于NSGA-Ⅱ的自适应多尺度的特征融合网络NSGA2-AMFFNetwork。在图像分类数据集上的实验结果显示,与手工设计的网络结构M_blockNet_v1相比,NSGA2-AMFFNetwork的平均精确度提升了1.2202个百分点,运行时间降低了41.07%。这表明所提优化算法能较好平衡LCNN的复杂度和精确度,同时还可为领域知识不足的普通用户提供更多性能表现均衡的网络结构选择方案。

基于NSGA-Ⅱ-PSO算法的微电网多目标优化运行模式

解决微网中新能源出力的随机性与波动性是微电网优化运行的前提和关键,为此,提出一种快速非支配排序遗传算法NSGA-Ⅱ(non-dominated sorting genetic algorithm)和基本粒子群优化算法PSO(particle swarm optimization)相结合的NSGA-Ⅱ-PSO算法,考虑将经济运行成本和环境污染成本作为优化的目标函数,建立常见发电单元以及蓄电池储能的多目标优化运行模型。通过Matlab仿真对比PSO、NSGA-Ⅱ和NSGA-Ⅱ-PSO算法的适应度收敛曲线,验证所提算法具有收敛速度快、全局和局部搜索能力强的优点,较单一的PSO算法和NSGA-Ⅱ算法具有更优的特点;结合经典微网系统进行算例仿真,通过对单目标与多目标的分析,结果表明该算法能有效降低经济成本和使环境效益达到最优;并且进一步验证所提算法的优越性。

水库群消落期多目标智能优化调度研究

本文考虑了河道天然流量模式调度需求,以发电量、供水满足度最大和河道流量偏差函数值最小为目标,建立了水库群消落期多目标优化调度模型,采用非支配排序遗传算法求解,以湘江流域东江-双牌-涔天河水库群为研究对象,进行了实例分析。研究结果表明:相比常规方案,在丰、平、枯水年情景下,发电量最大方案分别能提高1571万kW·h(11.2%)、1167万kW·h(10.9%)和811万kW·h(10.0%)的发电量;生态效益最好的方案,能减小1.56(61.2%)、0.33(6.3%)和0.89(13.6%)的河道流量偏差函数值;供水满足度最大的方案能提高2.1%、2.6%和3.4%的供水效益。构建的水库群消落期多目标优化调度模型可为长江流域水库群消落调度提供理论参考。

改进NSGA-Ⅱ算法求解考虑运输约束的柔性作业车间节能调度问题

传统柔性作业车间调度通常忽略工件在机器间的运输时间和能耗,针对该问题建立了考虑运输约束与节能的柔性作业车间调度模型,并提出了改进的NSGA-Ⅱ算法求解该模型。首先,在柔性作业车间调度数学模型中设立最大完工时间、总延期、设备总负载、车间总能耗4个目标,并根据运输约束实现了调度模型矩阵编码、解码、交叉与变异,基于子代向最优解学习机制改进NSGA-Ⅱ算法迭代过程中易陷入局部最优解问题。最后,在考虑车间机器之间运输约束的前提下结合Kacem、Brandimarte算例对调度模型进行可行性分析,结果表明该模型与算法求解效率高,能有效解决车间运输约束导致的调度方案与实际加工偏差问题。