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 exa...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.展开更多
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 ne...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.展开更多
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...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 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 optic...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.展开更多
This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is establish...This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.展开更多
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...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.展开更多
Multi-objective land allocation(MOLA)can be regarded as a spatial optimization problem that allocates appropriate use to certain land units subjecting to multiple objectives and constraints.This article develops an im...Multi-objective land allocation(MOLA)can be regarded as a spatial optimization problem that allocates appropriate use to certain land units subjecting to multiple objectives and constraints.This article develops an improved knowledge-informed non-dominated sorting genetic algorithm II(NSGA-II)for solving the MOLA problem by integrating the patch-based,edge growing/decreasing,neighborhood,and constraint steering rules.By applying both the classical and the knowledge-informed NSGA-II to a simulated planning area of 30×30 grid,we find that:when compared to the classical NSGA-II,the knowledge-informed NSGA-II consistently produces solutions much closer to the true Pareto front within shorter computation time without sacrificing the solution diversity;the knowledge-informed NSGA-II is more effective and more efficient in encouraging compact land allocation;the solutions produced by the knowledge-informed have less scattered/isolated land units and provide a good compromise between construction sprawl and conservation land protection.The better performance proves that knowledge-informed NSGA-II is a more reasonable and desirable approach in the planning context.展开更多
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 NS...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.展开更多
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 ...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.展开更多
基金Project supported by the National Basic Research Program of China (973 Program) (No. 2007CB714600)
文摘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.
基金This research was supported by the Researchers Supporting Program(TUMAProject-2021-27)Almaarefa University,Riyadh,Saudi Arabia.
文摘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.
基金supported in part by the National Natural Science Foundation of China under Grant No.52177171 and 51877040Jiangsu Provincial Key Laboratory of Smart Grid Technology and Equipment,Southeast University,China.
文摘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 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.
基金Supported by the Natural Science Foundation of Zhejiang Province(No.LQ22F030015).
文摘This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.
文摘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.
文摘Multi-objective land allocation(MOLA)can be regarded as a spatial optimization problem that allocates appropriate use to certain land units subjecting to multiple objectives and constraints.This article develops an improved knowledge-informed non-dominated sorting genetic algorithm II(NSGA-II)for solving the MOLA problem by integrating the patch-based,edge growing/decreasing,neighborhood,and constraint steering rules.By applying both the classical and the knowledge-informed NSGA-II to a simulated planning area of 30×30 grid,we find that:when compared to the classical NSGA-II,the knowledge-informed NSGA-II consistently produces solutions much closer to the true Pareto front within shorter computation time without sacrificing the solution diversity;the knowledge-informed NSGA-II is more effective and more efficient in encouraging compact land allocation;the solutions produced by the knowledge-informed have less scattered/isolated land units and provide a good compromise between construction sprawl and conservation land protection.The better performance proves that knowledge-informed NSGA-II is a more reasonable and desirable approach in the planning context.
文摘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.
基金in part supported by the Key Research and Development Project of Hubei Province(Nos.2020BAB1141,2023BAB094)the Key Project of Science and Technology Research ProgramofHubei Educational Committee(No.D20211402)+1 种基金the Teaching Research Project of Hubei University of Technology(No.XIAO2018001)the Project of Xiangyang Industrial Research Institute of Hubei University of Technology(No.XYYJ2022C04).
文摘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.
