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.

Non-dominated sorting quantum particle swarm optimization and its application in cognitive radio spectrum allocation

In order to solve discrete multi-objective optimization problems, a non-dominated sorting quantum particle swarm optimization (NSQPSO) based on non-dominated sorting and quantum particle swarm optimization is proposed, and the performance of the NSQPSO is evaluated through five classical benchmark functions. The quantum particle swarm optimization (QPSO) applies the quantum computing theory to particle swarm optimization, and thus has the advantages of both quantum computing theory and particle swarm optimization, so it has a faster convergence rate and a more accurate convergence value. Therefore, QPSO is used as the evolutionary method of the proposed NSQPSO. Also NSQPSO is used to solve cognitive radio spectrum allocation problem. The methods to complete spectrum allocation in previous literature only consider one objective, i.e. network utilization or fairness, but the proposed NSQPSO method, can consider both network utilization and fairness simultaneously through obtaining Pareto front solutions. Cognitive radio systems can select one solution from the Pareto front solutions according to the weight of network reward and fairness. If one weight is unit and the other is zero, then it becomes single objective optimization, so the proposed NSQPSO method has a much wider application range. The experimental research results show that the NSQPS can obtain the same non-dominated solutions as exhaustive search but takes much less time in small dimensions; while in large dimensions, where the problem cannot be solved by exhaustive search, the NSQPSO can still solve the problem, which proves the effectiveness of NSQPSO.

Multi-objective optimization of water supply network rehabilitation with non-dominated sorting Genetic Algorithm-II

Through the transformation of hydraulic constraints into the objective functions associated with a water supply network rehabilitation problem, a non-dominated sorting Genetic Algorithm-II (NSGA-II) can be used to solve the altered multi-objective optimization model. The introduction of NSGA-II into water supply network optimal rehabilitation problem solves the conflict between one fitness value of standard genetic algorithm (SGA) and multi-objectives of rehabilitation problem. And the uncertainties brought by using weight coefficients or punish functions in conventional methods are controlled. And also by in-troduction of artificial inducement mutation (AIM) operation, the convergence speed of population is accelerated;this operation not only improves the convergence speed, but also improves the rationality and feasibility of solutions.

GREEDY NON-DOMINATED SORTING IN GENETIC ALGORITHM-ⅡFOR VEHICLE ROUTING PROBLEM IN DISTRIBUTION

Vehicle routing problem in distribution （VRPD） is a widely used type of vehicle routing problem （VRP）, which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when modeling. For multi-objective optimization model, most researches consider two objectives. A multi-objective mathematical model for VRP is proposed, which considers the number of vehicles used, the length of route and the time arrived at each client. Genetic algorithm is one of the most widely used algorithms to solve VRP. As a type of genetic algorithm （GA）, non-dominated sorting in genetic algorithm-Ⅱ （NSGA-Ⅱ） also suffers from premature convergence and enclosure competition. In order to avoid these kinds of shortage, a greedy NSGA-Ⅱ （GNSGA-Ⅱ） is proposed for VRP problem. Greedy algorithm is implemented in generating the initial population, cross-over and mutation. All these procedures ensure that NSGA-Ⅱ is prevented from premature convergence and refine the performance of NSGA-Ⅱ at each step. In the distribution problem of a distribution center in Michigan, US, the GNSGA-Ⅱ is compared with NSGA-Ⅱ. As a result, the GNSGA-Ⅱ is the most efficient one and can get the most optimized solution to VRP problem. Also, in GNSGA-Ⅱ, premature convergence is better avoided and search efficiency has been improved sharply.

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.

Intracellular sorting pathways of the amyloid precursor protein provide novel neuroprotective strategies

Alzheimer＇s disease（AD）is the most common cause of senile dementia.It is characterized by the formation of plaques mainly composed of the amyloid-beta peptide（Aβ）.Diverse lines of evidence support the notion that accumulation of Aβis a primary cause of AD pathogenesis（Huang and Mucke,2012）.Amyloid precusor protein（APP）processing is dependent on its subcelluar trafficking pathway：Aβis derived from APP by proteolyric processing.

Modeling and Optimization of Electrical Discharge Machining of SiC Parameters, Using Neural Network and Non-Dominating Sorting Genetic Algorithm (NSGA II)

Silicon Carbide (SiC) machining by traditional methods with regards to its high hardness is not possible. Electro Discharge Machining, among non-traditional machining methods, is used for machining of SiC. The present work is aimed to optimize the surface roughness and material removal rate of electro discharge machining of SiC parameters simultaneously. As the output parameters are conflicting in nature, so there is no single combination of machining parameters, which provides the best machining performance. Artificial neural network (ANN) with back propagation algorithm is used to model the process. A multi-objective optimization method, non-dominating sorting genetic algorithm-II is used to optimize the process. Affects of three important input parameters of process viz., discharge current, pulse on time (Ton), pulse off time (Toff) on electric discharge machining of SiC are considered. Experiments have been conducted over a wide range of considered input parameters for training and verification of the model. Testing results demonstrate that the model is suitable for predicting the response parameters. A pareto-optimal set has been predicted in this work.

Non-dominated Sorting Advanced Butterfly Optimization Algorithm for Multi-objective Problems

This paper uses the Butterfly Optimization Algorithm(BOA)with dominated sorting and crowding distance mechanisms to solve multi-objective optimization problems.There is also an improvement to the original version of BOA to alleviate its drawbacks before extending it into a multi-objective version.Due to better coverage and a well-distributed Pareto front,non-dominant rankings are applied to the modified BOA using the crowding distance strategy.Seven benchmark functions and eight real-world problems have been used to test the performance of multi-objective non-dominated advanced BOA(MONSBOA),including unconstrained,constrained,and real-world design multiple-objective,highly nonlinear constraint problems.Various performance metrics,such as Generational Distance(GD),Inverted Generational Distance(IGD),Maximum Spread(MS),and Spacing(S),have been used for performance comparison.It is demonstrated that the new MONSBOA algorithm is better than the compared algorithms in more than 80%occasions in solving problems with a variety of linear,nonlinear,continuous,and discrete characteristics based on the Pareto front when compared quantitatively.From all the analysis,it may be concluded that the suggested MONSBOA is capable of producing high-quality Pareto fronts with very competitive results with rapid convergence.

Optimization of dynamic aperture by using non-dominated sorting genetic algorithm-Ⅱ in a diffraction-limited storage ring with solenoids for generating round beam

Purpose Round beam,i.e.,with equal horizontal and vertical emittance,is preferable than a horizontally flat one for some beamline applications in Diffraction-limited storage rings(DLSRs),for the purposes of reducing the number of photons getting discarded and better phase space match between photon and electron beam.Conventional methods of obtaining round beam inescapably results in a reduction of dynamic aperture(DA).In order to recover the DA as much as possible for improving the injection efficiency,the DA optimization by using Non-dominated sorting genetic algorithm-Ⅱ(NSGA-Ⅱ)to generate round beam,particularly to one of the designed lattice of the High Energy Photon Source(HEPS)storage ring,are presented.Method According to the general unconstrained model of NSGA-Ⅱ,we modified the standard model by using parallel computing to optimize round beam lattices with errors,especially for a strong coupling,such as solenoid scheme.Results and conclusion The results of numerical tracking verify the correction of the theory framework of solenoids with fringe fields and demonstrates the feasibility on the HEPS storage ring with errors to operate in round beam mode after optimizing DA.

煤矸分拣多机械臂任务分配问题研究

针对煤矸分拣过程中分拣率低、大粒度矸石分拣效果差等问题,通过考虑矸石粒度、分拣时间、矸石与分拣区边界距离等因素,构建矸石优先级模型;采取分拣机械臂放置矸石后不复位的方式,提出了一种煤矸分拣多机械臂任务分配策略,并以分拣率为标准进行评判,最后,采用本研究分配策略和传统的分配策略进行仿真。结果表明:本研究分配策略比传统的分配策略分拣效果更好,提高了7%~10%的分拣率,减少了大粒度矸石的漏拣数量;当矸石的间距不变时,矸石数量变化对分拣率影响较小,分拣率波动在3%左右,验证了本研究分配策略的有效性;矸石间距对分拣率和分拣机械臂数量的影响较大,当矸石的间距增大时,分拣率得到提高;矸石间距在250 mm以上时,3个分拣机械臂能保证较高的分拣率。

基于路径约束的无人机进离场程序设计

在整个城市空中交通系统中,起降场终端区作为重要一环,其间的无人机进离场安全和效率至关重要。针对这一环,需要设计合理的空域结构和排序策略,以确保无人机进离场的安全和效率。从空域设计和排序策略等方面,考虑进离场路径约束,设计无人机进离场程序。首先建立无人机进离场空域模型,设计飞行程序;采用先到先服务排序策略,按计划排序策略和诚信原则排序策略进行仿真实验,并从延误时间和模型稳定性等方面分析,得到三种排序策略中先到先服务排序策略与模型匹配度最高。

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.

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.

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

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

基于RR-DNS和MASK SORT的负载均衡策略实现

负载均衡技术是提高应用服务器承载能力和效率关键技术,通过对DNS轮序排程和网络掩码排序技术原理的深入研究,将两种技术进行了有效结合,给出了解决网络负载均衡问题的具体方法,该方法详细介绍了DNS轮序排程和网络掩码排序的实现过程及Windows Server 2003环境下的配置与测试步骤;系统测试结果表明,该方法实现了用户访问负载在各应用服务器间的有效均衡,提高了访问的响应速度,且系统工作稳定、易于实现。

考虑能量效率和SOC均衡的电池储能电站双层功率分配策略

电化学储能电站在应用于调频、调压等功率波动性工况时,存在能量效率较低、荷电状态(state of charge,SOC)不均衡等问题。该文提出考虑能量效率和SOC均衡的电池储能电站双层功率分配策略,其主要包括单元优化层和子系统优化层:单元优化层通过充电/放电优先级分区计算实际运行单元数量及其编号,建立以储能单元能耗最小为目标的优化模型,并采用遗传算法求解最优解集;子系统优化层引入基于电化学阻抗的电池能耗模型,以储能子系统能耗最低和SOC均衡为目标建立多目标优化模型,并采用非支配快速排序遗传算法(non-dominated sorting genetic algorithms-II,NSGA-II)进行求解。通过某地区锂电池储能电站实际参数验证所提策略的有效性,结果表明,与SOC比例分配策略和单层功率分配策略相比,所提功率分配策略在降低电站能耗的同时能最大程度实现SOC均衡,保障电站双向调节能力,提高储能电站经济性。

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

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

基于改进蜂群算法的资源实时均衡策略

针对传统人力资源调度算法在复杂场景下分配效率低的问题,文中基于改进蜂群算法提出一种面向人力资源的实时均衡调配策略。对于传统蜂群算法存在的实时性差、易陷入最优解的缺点,在算法的首阶段引入最佳蜜源位置算法来提升收敛速度,在次阶段使用排序策略增加算法全局能力,在末阶段提出一种基于蜜源浓度的全局更新策略,以提升算法实时性,进而改进原算法的缺陷。实验测试结果表明:所提算法的迭代次数约为120次,相较于原算法有明显提升;对目标函数的求解值在对比算法中为最优,表明所提算法求解质量高、收敛速度快,能够有效提升资源管理水平。

Optimization of maintenance strategy for high-speed railwaycatenary system based on multistate model

A multi-objective optimization model considering both reliability and maintenance cost is proposed to solve the contradiction between reliability and maintenance cost in high-speed railway catenary system maintenance activities.The non-dominated sorting genetic algorithm 2(NSGA2)is applied to multi-objective optimization,and the optimization result is a set of Pareto solutions.Firstly,multistate failure mode analysis is conducted for the main devices leading to the failure of catenary,and then the reliability and failure mode of the whole catenary system is analyzed.The mathematical relationship between system reliability and maintenance cost is derived considering the existing catenary preventive maintenance mode to improve the reliability of the system.Secondly,an improved NSGA2(INSGA2)is proposed,which strengths population diversity by improving selection operator,and introduces local search strategy to ensure that population distribution is more uniform.The comparison results of the two algorithms before and after improvement on the zero-ductility transition(ZDT)series functions show that the population diversity is better and the solution is more uniform using INSGA2.Finally,the INSGA2 is applied to multi-objective optimization of system reliability and maintenance cost in different maintenance periods.The decision-makers can choose the reasonable solutions as the maintenance plans in the optimization results by weighing the relationship between the system reliability and the maintenance cost.The selected maintenance plans can ensure the lowest maintenance cost while the system reliability is as high as possible.