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 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...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.展开更多
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 sol...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.展开更多
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 ...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.展开更多
With the continuous increase of rapid urbanization and population growth,sustainable urban land-use planning is becoming a more complex and challenging task for urban planners and decision-makers.Multi-objective land-...With the continuous increase of rapid urbanization and population growth,sustainable urban land-use planning is becoming a more complex and challenging task for urban planners and decision-makers.Multi-objective land-use allocation can be regarded as a complex spatial optimization problem that aims to achieve the possible trade-offs among multiple and conflicting objectives.This paper proposes an improved Non-dominated Sorting Biogeography-Based Optimization(NSBBO)algorithm for solving the multi-objective land-use allocation problem,in which maximum accessibility,maximum compactness,and maximum spatial integration were formulated as spatial objectives;and space syntax analysis was used to analyze the potential movement patterns in the new urban planning area of the city of Kigali,Rwanda.Efficient Non-dominated Sorting(ENS)algorithm and crossover operator were integrated into classical NSBBO to improve the quality of non-dominated solutions,and local search ability,and to accelerate the convergence speed of the algorithm.The results showed that the proposed NSBBO exhibited good optimal solutions with a high hypervolume index compared to the classical NSBBO.Furthermore,the proposed algorithm could generate optimal land use scenarios according to the preferred objectives,thus having the potential to support the decision-making of urban planners and stockholders in revising and updating the existing detailed master plan of land use.展开更多
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 B...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.展开更多
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.展开更多
Due to the numerous variables to take into account as well as the inherent ambiguity and uncertainty,evaluating educational institutions can be difficult.The concept of a possibility Pythagorean fuzzy hypersoft set(pP...Due to the numerous variables to take into account as well as the inherent ambiguity and uncertainty,evaluating educational institutions can be difficult.The concept of a possibility Pythagorean fuzzy hypersoft set(pPyFHSS)is more flexible in this regard than other theoretical fuzzy set-like models,even though some attempts have been made in the literature to address such uncertainties.This study investigates the elementary notions of pPyFHSS including its set-theoretic operations union,intersection,complement,OR-and AND-operations.Some results related to these operations are also modified for pPyFHSS.Additionally,the similarity measures between pPyFHSSs are formulated with the assistance of numerical examples and results.Lastly,an intelligent decision-assisted mechanism is developed with the proposal of a robust algorithm based on similarity measures for solving multi-attribute decision-making(MADM)problems.A case study that helps the decision-makers assess the best educational institution is discussed to validate the suggested system.The algorithmic results are compared with the most pertinent model to evaluate the adaptability of pPyFHSS,as it generalizes the classical possibility fuzzy set-like theoretical models.Similarly,while considering significant evaluating factors,the flexibility of pPyFHSS is observed through structural comparison.展开更多
This study identified castor oil and phosphate ester as effective retarders through setting time,tensile,and flexural tests,and determined their optimal dosages.The mechanism by which phosphate ester affects the setti...This study identified castor oil and phosphate ester as effective retarders through setting time,tensile,and flexural tests,and determined their optimal dosages.The mechanism by which phosphate ester affects the setting time of polyurethane was further investigated using molecular dynamics simulations.Fourier transform infrared spectroscopy was also employed to systematically study the physical and chemical interactions between phosphate esters and polyurethane materials.The results demonstrate that a 1%concentration of phosphate ester provides the most effective retarding effect with minimal impact on the strength of polyurethane.When phosphate ester is added to the B component of the two-component polyurethane system,its interaction energy with component A decreases,as do the diffusion coefficient and aggregation degree of component B on the surface of component A.This reduction in interaction slows the setting time.Additionally,the addition of phosphate ester to polyurethane leads to the disappearance or weakening of functional groups,indicating competitive interactions within the phosphate ester components that inhibit the reaction rate.展开更多
基金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.
基金Foundation item： Projects（61102106, 61102105） supported by the National Natural Science Foundation of China Project（2013M530148） supported by China Postdoctoral Science Foundation Project（HEUCF120806） supported by the Fundamental Research Funds for the Central Universities of China
文摘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.
基金the Natural Science Key Foundation of Heilongjiang Province of China (No. ZJG0503) China-UK Sci-ence Network from Royal Society UK
文摘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.
基金supported by National Natural Science Foundation of China(No.60474059)Hi-tech Research and Development Program of China(863 Program,No.2006AA04Z160).
文摘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.
基金supported by the Styrelsen för Internationellt Utvecklingssamarbete.
文摘With the continuous increase of rapid urbanization and population growth,sustainable urban land-use planning is becoming a more complex and challenging task for urban planners and decision-makers.Multi-objective land-use allocation can be regarded as a complex spatial optimization problem that aims to achieve the possible trade-offs among multiple and conflicting objectives.This paper proposes an improved Non-dominated Sorting Biogeography-Based Optimization(NSBBO)algorithm for solving the multi-objective land-use allocation problem,in which maximum accessibility,maximum compactness,and maximum spatial integration were formulated as spatial objectives;and space syntax analysis was used to analyze the potential movement patterns in the new urban planning area of the city of Kigali,Rwanda.Efficient Non-dominated Sorting(ENS)algorithm and crossover operator were integrated into classical NSBBO to improve the quality of non-dominated solutions,and local search ability,and to accelerate the convergence speed of the algorithm.The results showed that the proposed NSBBO exhibited good optimal solutions with a high hypervolume index compared to the classical NSBBO.Furthermore,the proposed algorithm could generate optimal land use scenarios according to the preferred objectives,thus having the potential to support the decision-making of urban planners and stockholders in revising and updating the existing detailed master plan of land use.
文摘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.
基金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 Deanship of Graduate Studies and Scientific Research at Qassim University(QU-APC-2024-9/1).
文摘Due to the numerous variables to take into account as well as the inherent ambiguity and uncertainty,evaluating educational institutions can be difficult.The concept of a possibility Pythagorean fuzzy hypersoft set(pPyFHSS)is more flexible in this regard than other theoretical fuzzy set-like models,even though some attempts have been made in the literature to address such uncertainties.This study investigates the elementary notions of pPyFHSS including its set-theoretic operations union,intersection,complement,OR-and AND-operations.Some results related to these operations are also modified for pPyFHSS.Additionally,the similarity measures between pPyFHSSs are formulated with the assistance of numerical examples and results.Lastly,an intelligent decision-assisted mechanism is developed with the proposal of a robust algorithm based on similarity measures for solving multi-attribute decision-making(MADM)problems.A case study that helps the decision-makers assess the best educational institution is discussed to validate the suggested system.The algorithmic results are compared with the most pertinent model to evaluate the adaptability of pPyFHSS,as it generalizes the classical possibility fuzzy set-like theoretical models.Similarly,while considering significant evaluating factors,the flexibility of pPyFHSS is observed through structural comparison.
基金Funded by the National Natural Science Foundation of China(No.52370128)the Fundamental Research Funds for the Central Universities(No.2572022AW54)。
文摘This study identified castor oil and phosphate ester as effective retarders through setting time,tensile,and flexural tests,and determined their optimal dosages.The mechanism by which phosphate ester affects the setting time of polyurethane was further investigated using molecular dynamics simulations.Fourier transform infrared spectroscopy was also employed to systematically study the physical and chemical interactions between phosphate esters and polyurethane materials.The results demonstrate that a 1%concentration of phosphate ester provides the most effective retarding effect with minimal impact on the strength of polyurethane.When phosphate ester is added to the B component of the two-component polyurethane system,its interaction energy with component A decreases,as do the diffusion coefficient and aggregation degree of component B on the surface of component A.This reduction in interaction slows the setting time.Additionally,the addition of phosphate ester to polyurethane leads to the disappearance or weakening of functional groups,indicating competitive interactions within the phosphate ester components that inhibit the reaction rate.
