An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was...An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step （RAS） was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm （QEA） and an individual＇s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.展开更多
In the previous papers,Quantum-inspired multi-objective evolutionary algorithm(QMEA)was proved to be better than conventional genetic algorithms for multi-objective optimization problem.To improve the quality of the n...In the previous papers,Quantum-inspired multi-objective evolutionary algorithm(QMEA)was proved to be better than conventional genetic algorithms for multi-objective optimization problem.To improve the quality of the non-dominated set as well as the diversity of population in multi-objective problems,in this paper,a Novel Cloud-based quantum-inspired multi-objective evolutionary Algorithm(CQMEA)is proposed.CQMEA is proposed by employing the concept and principles of Cloud theory.The algorithm utilizes the random orientation and stability of the cloud model,uses a self-adaptive mechanism with cloud model of Quantum gates updating strategy to implement global search efficient.By using the self-adaptive mechanism and the better solution which is determined by the membership function uncertainly,Compared with several well-known algorithms such as NSGA-Ⅱ,QMEA.Experimental results show that(CQMEA)is more effective than QMEA and NSGA-Ⅱ.展开更多
The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.Q...The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.QAA takes the advantage of the principles in quantum computing,such as qubit,quantum gate,and quantum superposition of states,to get more probabilistic-based status with small colonies.By updating the pheromone in the ant algorithm and rotating the quantum gate,the algorithm can finally reach the optimal solution.The detailed steps to use QAA are presented,and by solving series of test cases of classical knapsack problems,the effectiveness and generality of the new algorithm are validated.展开更多
Attribute reduction in the rough set theory is an important feature selection method, but finding a minimum attribute reduction has been proven to be a non-deterministic polynomial （NP）-hard problem. Therefore, it i...Attribute reduction in the rough set theory is an important feature selection method, but finding a minimum attribute reduction has been proven to be a non-deterministic polynomial （NP）-hard problem. Therefore, it is necessary to investigate some fast and effective approximate algorithms. A novel and enhanced quantum-inspired shuffled frog leaping based minimum attribute reduction algorithm （QSFLAR） is proposed. Evolutionary frogs are represented by multi-state quantum bits, and both quantum rotation gate and quantum mutation operators are used to exploit the mechanisms of frog population diversity and convergence to the global optimum. The decomposed attribute subsets are co-evolved by the elitist frogs with a quantum-inspired shuffled frog leaping algorithm. The experimental results validate the better feasibility and effectiveness of QSFLAR, comparing with some representa- tive algorithms. Therefore, QSFLAR can be considered as a more competitive algorithm on the efficiency and accuracy for minimum attribute reduction.展开更多
Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and eco...Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.展开更多
Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review exp...Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review explores the historical development of MOEAs,beginning with foundational concepts in multi-objective optimization,basic types of MOEAs,and the evolution of Pareto-based selection and niching methods.Further advancements,including decom-position-based approaches and hybrid algorithms,are discussed.Applications are analyzed in established domains such as engineering and economics,as well as in emerging fields like advanced analytics and machine learning.The significance of MOEAs in addressing real-world problems is emphasized,highlighting their role in facilitating informed decision-making.Finally,the development trajectory of MOEAs is compared with evolutionary processes,offering insights into their progress and future potential.展开更多
In recent years,the development of new types of nuclear reactors,such as transportable,marine,and space reactors,has presented new challenges for the optimization of reactor radiation-shielding design.Shielding struct...In recent years,the development of new types of nuclear reactors,such as transportable,marine,and space reactors,has presented new challenges for the optimization of reactor radiation-shielding design.Shielding structures typically need to be lightweight,miniaturized,and radiation-protected,which is a multi-parameter and multi-objective optimization problem.The conventional multi-objective(two or three objectives)optimization method for radiation-shielding design exhibits limitations for a number of optimization objectives and variable parameters,as well as a deficiency in achieving a global optimal solution,thereby failing to meet the requirements of shielding optimization for newly developed reactors.In this study,genetic and artificial bee-colony algorithms are combined with a reference-point-selection strategy and applied to the many-objective(having four or more objectives)optimal design of reactor radiation shielding.To validate the reliability of the methods,an optimization simulation is conducted on three-dimensional shielding structures and another complicated shielding-optimization problem.The numerical results demonstrate that the proposed algorithms outperform conventional shielding-design methods in terms of optimization performance,and they exhibit their reliability in practical engineering problems.The many-objective optimization algorithms developed in this study are proven to efficiently and consistently search for Pareto-front shielding schemes.Therefore,the algorithms proposed in this study offer novel insights into improving the shielding-design performance and shielding quality of new reactor types.展开更多
Multi-firmware comparison techniques can improve efficiency when auditing firmwares in bulk.How-ever,the problem of matching functions between multiple firmwares has not been studied before.This paper proposes a multi...Multi-firmware comparison techniques can improve efficiency when auditing firmwares in bulk.How-ever,the problem of matching functions between multiple firmwares has not been studied before.This paper proposes a multi-firmware comparison method based on evolutionary algorithms and trusted base points.We first model the multi-firmware comparison as a multi-sequence matching problem.Then,we propose an adaptation function and a population generation method based on trusted base points.Finally,we apply an evolutionary algorithm to find the optimal result.At the same time,we design the similarity of matching results as an evaluation metric to measure the effect of multi-firmware comparison.The experiments show that the proposed method outperforms Bindiff and the string-based method.Precisely,the similarity between the matching results of the proposed method and Bindiff matching results is 61%,and the similarity between the matching results of the proposed method and the string-based method is 62.8%.By sampling and manual verification,the accuracy of the matching results of the proposed method can be about 66.4%.展开更多
When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by usin...When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models.The generated solutions exhibit excessive randomness,which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima.To improve SAEAs greatly,this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1)Employing a surrogate model in lieu of expensive(true)function evaluations;and 2)Proposing and using an inverse surrogate model to generate new solutions.By using the same training data but with its inputs and outputs being reversed,the latter is simple to train.It is then used to generate new vectors in objective space,which are mapped into decision space to obtain their corresponding solutions.Using a particular example,this work shows its advantages over existing SAEAs.The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency.展开更多
In recent years,feature selection(FS)optimization of high-dimensional gene expression data has become one of the most promising approaches for cancer prediction and classification.This work reviews FS and classificati...In recent years,feature selection(FS)optimization of high-dimensional gene expression data has become one of the most promising approaches for cancer prediction and classification.This work reviews FS and classification methods that utilize evolutionary algorithms(EAs)for gene expression profiles in cancer or medical applications based on research motivations,challenges,and recommendations.Relevant studies were retrieved from four major academic databases-IEEE,Scopus,Springer,and ScienceDirect-using the keywords‘cancer classification’,‘optimization’,‘FS’,and‘gene expression profile’.A total of 67 papers were finally selected with key advancements identified as follows:(1)The majority of papers(44.8%)focused on developing algorithms and models for FS and classification.(2)The second category encompassed studies on biomarker identification by EAs,including 20 papers(30%).(3)The third category comprised works that applied FS to cancer data for decision support system purposes,addressing high-dimensional data and the formulation of chromosome length.These studies accounted for 12%of the total number of studies.(4)The remaining three papers(4.5%)were reviews and surveys focusing on models and developments in prediction and classification optimization for cancer classification under current technical conditions.This review highlights the importance of optimizing FS in EAs to manage high-dimensional data effectively.Despite recent advancements,significant limitations remain:the dynamic formulation of chromosome length remains an underexplored area.Thus,further research is needed on dynamic-length chromosome techniques for more sophisticated biomarker gene selection techniques.The findings suggest that further advancements in dynamic chromosome length formulations and adaptive algorithms could enhance cancer classification accuracy and efficiency.展开更多
A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's...A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.展开更多
In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and red...In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
In order to establish the lake eutrophic evaluation model for multiple indices,based on the gauge transformation,an index formula in the form of a logarithmic power function was proposed to design an eutrophic evaluat...In order to establish the lake eutrophic evaluation model for multiple indices,based on the gauge transformation,an index formula in the form of a logarithmic power function was proposed to design an eutrophic evaluation model for the ＂ normalized values＂ of multi-indexes.The parameters in the formula were also optimized by bee immune evolutionary algorithm（BEIEA）.The universal index formula was suitable to multiindices items for eutrophic evaluation.At the same time,the formula was applied to practical eutrophic evaluations in 10 regions of Dong Lake.The evaluation results were coincident with those obtained from the power function of weighted sums and also with actual conditions.It was shown that the bee immune evolutionary algorithm was suitable to the parameter optimization in the eutrophic evaluation model.展开更多
In order to optimize the signal control system, this paper proposes a method to design an optimized fuzzy logic controller （FLC） with the DNA evolutionary algorithm. Inspired by the DNA molecular operation character...In order to optimize the signal control system, this paper proposes a method to design an optimized fuzzy logic controller （FLC） with the DNA evolutionary algorithm. Inspired by the DNA molecular operation characteristics, the DNA evolutionary algorithm modifies the corresponding genetic operators. Compared with the traditional genetic algorithm （GA）, the DNA evolutionary algorithm can overcome weak local search capability and premature convergence. The parameters of membership functions are optimized by adopting the quaternary encoding method and performing corresponding DNA genetic operators. The relevant optimized parameters are combined with the FLC for single intersection traffic signal control. Simulation experiments shows the better performance of the FLC with the DNA evolutionary algorithm optimization. The experimental results demonstrate the efficiency of the nrotmsed method.展开更多
A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good...A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.展开更多
Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,...Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving them.More than 60%of the publications are related to SI and EA.This paper intents to give a comprehensive literature review of SI and EA for solving FJSP.First,the mathematical model of FJSP is presented and the constraints in applications are summarized.Then,the encoding and decoding strategies for connecting the problem and algorithms are reviewed.The strategies for initializing algorithms?population and local search operators for improving convergence performance are summarized.Next,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are presented.Finally,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.展开更多
Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems....Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.展开更多
This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global sea...This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.展开更多
Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remed...Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.展开更多
基金supported by the National Natural Science Foundation of China (61473179)the Doctor Foundation of Shandong Province (BS2013DX032)the Youth Scholars Development Program of Shandong University of Technology (2014-09)
文摘An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step （RAS） was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm （QEA） and an individual＇s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.
基金Supported by the National Natural Science Foundation of China under Grant No.60903168the Scientific Research Fund of Hunan Provincial Education Department of China under Grant No.10B062Guangdong University of Petrochemical Technology Youth innovative personnel training project(NO 2010YC09)
文摘In the previous papers,Quantum-inspired multi-objective evolutionary algorithm(QMEA)was proved to be better than conventional genetic algorithms for multi-objective optimization problem.To improve the quality of the non-dominated set as well as the diversity of population in multi-objective problems,in this paper,a Novel Cloud-based quantum-inspired multi-objective evolutionary Algorithm(CQMEA)is proposed.CQMEA is proposed by employing the concept and principles of Cloud theory.The algorithm utilizes the random orientation and stability of the cloud model,uses a self-adaptive mechanism with cloud model of Quantum gates updating strategy to implement global search efficient.By using the self-adaptive mechanism and the better solution which is determined by the membership function uncertainly,Compared with several well-known algorithms such as NSGA-Ⅱ,QMEA.Experimental results show that(CQMEA)is more effective than QMEA and NSGA-Ⅱ.
基金supported by the National Natural Science Foundation of China(70871081)the Shanghai Leading Academic Discipline Project(S30504).
文摘The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.QAA takes the advantage of the principles in quantum computing,such as qubit,quantum gate,and quantum superposition of states,to get more probabilistic-based status with small colonies.By updating the pheromone in the ant algorithm and rotating the quantum gate,the algorithm can finally reach the optimal solution.The detailed steps to use QAA are presented,and by solving series of test cases of classical knapsack problems,the effectiveness and generality of the new algorithm are validated.
基金supported by the National Natural Science Foundation of China(6113900261171132)+4 种基金the Funding of Jiangsu Innovation Program for Graduate Education(CXZZ11 0219)the Natural Science Foundation of Jiangsu Education Department(12KJB520013)the Applying Study Foundation of Nantong(BK2011062)the Open Project Program of State Key Laboratory for Novel Software Technology,Nanjing University(KFKT2012B28)the Natural Science Pre-Research Foundation of Nantong University(12ZY016)
文摘Attribute reduction in the rough set theory is an important feature selection method, but finding a minimum attribute reduction has been proven to be a non-deterministic polynomial （NP）-hard problem. Therefore, it is necessary to investigate some fast and effective approximate algorithms. A novel and enhanced quantum-inspired shuffled frog leaping based minimum attribute reduction algorithm （QSFLAR） is proposed. Evolutionary frogs are represented by multi-state quantum bits, and both quantum rotation gate and quantum mutation operators are used to exploit the mechanisms of frog population diversity and convergence to the global optimum. The decomposed attribute subsets are co-evolved by the elitist frogs with a quantum-inspired shuffled frog leaping algorithm. The experimental results validate the better feasibility and effectiveness of QSFLAR, comparing with some representa- tive algorithms. Therefore, QSFLAR can be considered as a more competitive algorithm on the efficiency and accuracy for minimum attribute reduction.
基金supported by the National Natural Science Foundation of China[Grant No.12461035]Qinghai University Students Innovative Training Program Project[2024-QX-57].
文摘Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.
文摘Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review explores the historical development of MOEAs,beginning with foundational concepts in multi-objective optimization,basic types of MOEAs,and the evolution of Pareto-based selection and niching methods.Further advancements,including decom-position-based approaches and hybrid algorithms,are discussed.Applications are analyzed in established domains such as engineering and economics,as well as in emerging fields like advanced analytics and machine learning.The significance of MOEAs in addressing real-world problems is emphasized,highlighting their role in facilitating informed decision-making.Finally,the development trajectory of MOEAs is compared with evolutionary processes,offering insights into their progress and future potential.
基金supported by the National Natural Science Foundation of China(Nos.12475174 and 12175101)Yue Lu Shan Center Industrial Innovation(No.2024YCII0108)。
文摘In recent years,the development of new types of nuclear reactors,such as transportable,marine,and space reactors,has presented new challenges for the optimization of reactor radiation-shielding design.Shielding structures typically need to be lightweight,miniaturized,and radiation-protected,which is a multi-parameter and multi-objective optimization problem.The conventional multi-objective(two or three objectives)optimization method for radiation-shielding design exhibits limitations for a number of optimization objectives and variable parameters,as well as a deficiency in achieving a global optimal solution,thereby failing to meet the requirements of shielding optimization for newly developed reactors.In this study,genetic and artificial bee-colony algorithms are combined with a reference-point-selection strategy and applied to the many-objective(having four or more objectives)optimal design of reactor radiation shielding.To validate the reliability of the methods,an optimization simulation is conducted on three-dimensional shielding structures and another complicated shielding-optimization problem.The numerical results demonstrate that the proposed algorithms outperform conventional shielding-design methods in terms of optimization performance,and they exhibit their reliability in practical engineering problems.The many-objective optimization algorithms developed in this study are proven to efficiently and consistently search for Pareto-front shielding schemes.Therefore,the algorithms proposed in this study offer novel insights into improving the shielding-design performance and shielding quality of new reactor types.
文摘Multi-firmware comparison techniques can improve efficiency when auditing firmwares in bulk.How-ever,the problem of matching functions between multiple firmwares has not been studied before.This paper proposes a multi-firmware comparison method based on evolutionary algorithms and trusted base points.We first model the multi-firmware comparison as a multi-sequence matching problem.Then,we propose an adaptation function and a population generation method based on trusted base points.Finally,we apply an evolutionary algorithm to find the optimal result.At the same time,we design the similarity of matching results as an evaluation metric to measure the effect of multi-firmware comparison.The experiments show that the proposed method outperforms Bindiff and the string-based method.Precisely,the similarity between the matching results of the proposed method and Bindiff matching results is 61%,and the similarity between the matching results of the proposed method and the string-based method is 62.8%.By sampling and manual verification,the accuracy of the matching results of the proposed method can be about 66.4%.
基金supported in part by the National Natural Science Foundation of China(51775385)the Natural Science Foundation of Shanghai(23ZR1466000)+2 种基金the Shanghai Industrial Collaborative Science and Technology Innovation Project(2021-cyxt2-kj10)the Innovation Program of Shanghai Municipal Education Commission(202101070007E00098)Fundo para o Desenvolvimento das Ciencias e da Tecnologia(FDCT)(0147/2024/AFJ).
文摘When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models.The generated solutions exhibit excessive randomness,which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima.To improve SAEAs greatly,this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1)Employing a surrogate model in lieu of expensive(true)function evaluations;and 2)Proposing and using an inverse surrogate model to generate new solutions.By using the same training data but with its inputs and outputs being reversed,the latter is simple to train.It is then used to generate new vectors in objective space,which are mapped into decision space to obtain their corresponding solutions.Using a particular example,this work shows its advantages over existing SAEAs.The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency.
基金funded by the Ministry of Higher Education of Malaysia,grant number FRGS/1/2022/ICT02/UPSI/02/1.
文摘In recent years,feature selection(FS)optimization of high-dimensional gene expression data has become one of the most promising approaches for cancer prediction and classification.This work reviews FS and classification methods that utilize evolutionary algorithms(EAs)for gene expression profiles in cancer or medical applications based on research motivations,challenges,and recommendations.Relevant studies were retrieved from four major academic databases-IEEE,Scopus,Springer,and ScienceDirect-using the keywords‘cancer classification’,‘optimization’,‘FS’,and‘gene expression profile’.A total of 67 papers were finally selected with key advancements identified as follows:(1)The majority of papers(44.8%)focused on developing algorithms and models for FS and classification.(2)The second category encompassed studies on biomarker identification by EAs,including 20 papers(30%).(3)The third category comprised works that applied FS to cancer data for decision support system purposes,addressing high-dimensional data and the formulation of chromosome length.These studies accounted for 12%of the total number of studies.(4)The remaining three papers(4.5%)were reviews and surveys focusing on models and developments in prediction and classification optimization for cancer classification under current technical conditions.This review highlights the importance of optimizing FS in EAs to manage high-dimensional data effectively.Despite recent advancements,significant limitations remain:the dynamic formulation of chromosome length remains an underexplored area.Thus,further research is needed on dynamic-length chromosome techniques for more sophisticated biomarker gene selection techniques.The findings suggest that further advancements in dynamic chromosome length formulations and adaptive algorithms could enhance cancer classification accuracy and efficiency.
基金Supported by the National Natural Science Foundation of China (No.60133010 and No.60141002).
文摘A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.
基金supported by the National Natural Science Foundation of China under Grant No.61972040the Science and Technology Research and Development Project funded by China Railway Material Trade Group Luban Company.
文摘In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金Supported by Science and Technology Basic Special Project(2009IM020100)National Natural Science Foundation of China(5077904250739002)~~
文摘In order to establish the lake eutrophic evaluation model for multiple indices,based on the gauge transformation,an index formula in the form of a logarithmic power function was proposed to design an eutrophic evaluation model for the ＂ normalized values＂ of multi-indexes.The parameters in the formula were also optimized by bee immune evolutionary algorithm（BEIEA）.The universal index formula was suitable to multiindices items for eutrophic evaluation.At the same time,the formula was applied to practical eutrophic evaluations in 10 regions of Dong Lake.The evaluation results were coincident with those obtained from the power function of weighted sums and also with actual conditions.It was shown that the bee immune evolutionary algorithm was suitable to the parameter optimization in the eutrophic evaluation model.
基金The National Natural Science Foundation of China(No.60972001)the Scientific Innovation Research of College Graduates in Jiangsu Province(No.CXZZ_0163)the Scientific Research Foundation of Graduate School of Southeast University(No.YBPY1212)
文摘In order to optimize the signal control system, this paper proposes a method to design an optimized fuzzy logic controller （FLC） with the DNA evolutionary algorithm. Inspired by the DNA molecular operation characteristics, the DNA evolutionary algorithm modifies the corresponding genetic operators. Compared with the traditional genetic algorithm （GA）, the DNA evolutionary algorithm can overcome weak local search capability and premature convergence. The parameters of membership functions are optimized by adopting the quaternary encoding method and performing corresponding DNA genetic operators. The relevant optimized parameters are combined with the FLC for single intersection traffic signal control. Simulation experiments shows the better performance of the FLC with the DNA evolutionary algorithm optimization. The experimental results demonstrate the efficiency of the nrotmsed method.
文摘A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.
基金supported in part by the National Natural Science Foundation of China(61603169,61773192,61803192)in part by the funding from Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technologyin part by Singapore National Research Foundation(NRF-RSS2016-004)
文摘Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving them.More than 60%of the publications are related to SI and EA.This paper intents to give a comprehensive literature review of SI and EA for solving FJSP.First,the mathematical model of FJSP is presented and the constraints in applications are summarized.Then,the encoding and decoding strategies for connecting the problem and algorithms are reviewed.The strategies for initializing algorithms?population and local search operators for improving convergence performance are summarized.Next,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are presented.Finally,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.
基金This work was supported by an EPSRC grant (No.EP/C520696/1).
文摘Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.
基金Supported by the National Natural Science Foundation of China(60133010,60073043,70071042)
文摘This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.
基金supported in part by the National Natural Science Foundation of China(61806051,61903078)Natural Science Foundation of Shanghai(20ZR1400400)+2 种基金Agricultural Project of the Shanghai Committee of Science and Technology(16391902800)the Fundamental Research Funds for the Central Universities(2232020D-48)the Project of the Humanities and Social Sciences on Young Fund of the Ministry of Education in China(Research on swarm intelligence collaborative robust optimization scheduling for high-dimensional dynamic decisionmaking system(20YJCZH052))。
文摘Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.
