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.展开更多
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 de...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.展开更多
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 w...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.展开更多
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.展开更多
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.展开更多
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 fitnes...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.展开更多
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.展开更多
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 ...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.展开更多
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...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.展开更多
Ontology alignment is an essential and complex task to integrate heterogeneous ontology.The meta-heuristic algorithm has proven to be an effective method for ontology alignment.However,it only applies the inherent adv...Ontology alignment is an essential and complex task to integrate heterogeneous ontology.The meta-heuristic algorithm has proven to be an effective method for ontology alignment.However,it only applies the inherent advantages of metaheuristics algorithm and rarely considers the execution efficiency,especially the multi-objective ontology alignment model.The performance of such multi-objective optimization models mostly depends on the well-distributed and the fast-converged set of solutions in real-world applications.In this paper,two multi-objective grasshopper optimization algorithms(MOGOA)are proposed to enhance ontology alignment.One isε-dominance concept based GOA(EMO-GOA)and the other is fast Non-dominated Sorting based GOA(NS-MOGOA).The performance of the two methods to align the ontology is evaluated by using the benchmark dataset.The results demonstrate that the proposed EMO-GOA and NSMOGOA improve the quality of ontology alignment and reduce the running time compared with other well-known metaheuristic and the state-of-the-art ontology alignment methods.展开更多
文章旨在建立FAST(Five-hundred-meter Aperture Spherical radio Telescope)主动反射面调节模型,使得馈源舱能够最大概率地接收天体电磁波经反射面反射后的信号.根据主动反射面系统相关数据,首先建立假设目标天体在基准球面正上方的抛...文章旨在建立FAST(Five-hundred-meter Aperture Spherical radio Telescope)主动反射面调节模型,使得馈源舱能够最大概率地接收天体电磁波经反射面反射后的信号.根据主动反射面系统相关数据,首先建立假设目标天体在基准球面正上方的抛物线模型,利用遗传算法求解理想状态下的抛物面方程;然后通过空间旋转矩阵和截痕法,建立天体方位变换模型,求出天体不在基准球面正上方时的理想抛物面和反射面板的调节模型,进而得到调节后的馈源舱接收比和基准反射球面接收比.结果表明,该模型可使得馈源舱的接收比达到74.98%的水平,对实际的射电望远镜和主动反射面等相关内容有一定的借鉴意义.展开更多
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,h...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.展开更多
基金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 by the National Natural Science Foundation of China(50975121)the Project 2009-2007 of the Graduate Innovation Fund of Jilin University
文摘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.
基金supported by the National Natural Science Foundation of China (60632050)National Basic Research Program of Jiangsu Province University (08KJB520003)
文摘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.
文摘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.
基金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.
文摘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.
基金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.
基金National Natural Science Foundation of China(No.519667013)
文摘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.
基金Natural Science Foundation of Shanghai,China(No.15ZR1401600)the Fundamental Research Funds for the Central Universities,China(No.CUSF-DH-D-2015096)
文摘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.
基金the Ministry of Education-China Mobile Joint Fund Project(MCM2020J01)。
文摘Ontology alignment is an essential and complex task to integrate heterogeneous ontology.The meta-heuristic algorithm has proven to be an effective method for ontology alignment.However,it only applies the inherent advantages of metaheuristics algorithm and rarely considers the execution efficiency,especially the multi-objective ontology alignment model.The performance of such multi-objective optimization models mostly depends on the well-distributed and the fast-converged set of solutions in real-world applications.In this paper,two multi-objective grasshopper optimization algorithms(MOGOA)are proposed to enhance ontology alignment.One isε-dominance concept based GOA(EMO-GOA)and the other is fast Non-dominated Sorting based GOA(NS-MOGOA).The performance of the two methods to align the ontology is evaluated by using the benchmark dataset.The results demonstrate that the proposed EMO-GOA and NSMOGOA improve the quality of ontology alignment and reduce the running time compared with other well-known metaheuristic and the state-of-the-art ontology alignment methods.
文摘文章旨在建立FAST(Five-hundred-meter Aperture Spherical radio Telescope)主动反射面调节模型,使得馈源舱能够最大概率地接收天体电磁波经反射面反射后的信号.根据主动反射面系统相关数据,首先建立假设目标天体在基准球面正上方的抛物线模型,利用遗传算法求解理想状态下的抛物面方程;然后通过空间旋转矩阵和截痕法,建立天体方位变换模型,求出天体不在基准球面正上方时的理想抛物面和反射面板的调节模型,进而得到调节后的馈源舱接收比和基准反射球面接收比.结果表明,该模型可使得馈源舱的接收比达到74.98%的水平,对实际的射电望远镜和主动反射面等相关内容有一定的借鉴意义.
文摘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.
