In recent years,surrogate models derived from genuine data samples have proven to be efficient in addressing optimization challenges that are costly or time⁃intensive.However,the individuals in the population become i...In recent years,surrogate models derived from genuine data samples have proven to be efficient in addressing optimization challenges that are costly or time⁃intensive.However,the individuals in the population become indistinguishable as the curse of dimensionality increases in the objective space and the accumulation of surrogate approximated errors.Therefore,in this paper,each objective function is modeled using a radial basis function approach,and the optimal solution set of the surrogate model is located by the multi⁃objective evolutionary algorithm of strengthened dominance relation.The original objective function values of the true evaluations are converted to two indicator values,and then the surrogate models are set up for the two performance indicators.Finally,an adaptive infill sampling strategy that relies on approximate performance indicators is proposed to assist in selecting individuals for real evaluations from the potential optimal solution set.The algorithm is contrasted against several advanced surrogate⁃assisted evolutionary algorithms on two suites of test cases,and the experimental findings prove that the approach is competitive in solving expensive many⁃objective optimization problems.展开更多
In this work,a hybrid meta-model based design space differentiation（HMDSD）method is proposed for practical problems.In the proposed method,an iteratively reduced promising region is constructed using the expensive p...In this work,a hybrid meta-model based design space differentiation（HMDSD）method is proposed for practical problems.In the proposed method,an iteratively reduced promising region is constructed using the expensive points,with two different search strategies respectively applied inside and outside the promising region.Besides,the hybrid meta-model strategy applied in the search process makes it possible to solve the complex practical problems.Tested upon a serial of benchmark math functions,the HMDSD method shows great efficiency and search accuracy.On top of that,a practical lightweight design demonstrates its superior performance.展开更多
Modern engineering design optimization often relies on computer simulations to evaluate candidate designs, a setup which results in expensive black-box optimization problems. Such problems introduce unique challenges,...Modern engineering design optimization often relies on computer simulations to evaluate candidate designs, a setup which results in expensive black-box optimization problems. Such problems introduce unique challenges, which has motivated the application of metamodel-assisted computational intelligence algorithms to solve them. Such algorithms combine a computational intelligence optimizer which employs a population of candidate solutions, with a metamodel which is a computationally cheaper approximation of the expensive computer simulation. However, although a variety of metamodels and optimizers have been proposed, the optimal types to employ are problem dependant. Therefore, a priori prescribing the type of metamodel and optimizer to be used may degrade its effectiveness. Leveraging on this issue, this study proposes a new computational intelligence algorithm which autonomously adapts the type of the metamodel and optimizer during the search by selecting the most suitable types out of a family of candidates at each stage. Performance analysis using a set of test functions demonstrates the effectiveness of the proposed algorithm, and highlights the merit of the proposed adaptation approach.展开更多
Expensive optimization problem(EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for t...Expensive optimization problem(EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for the algorithm to find a satisfactory solution. Moreover, due to the fast-growing application demands in the economy and society, such as the emergence of the smart cities, the internet of things, and the big data era, solving EOP more efficiently has become increasingly essential in various fields, which poses great challenges on the problem-solving ability of optimization approach for EOP. Among various optimization approaches, evolutionary computation(EC) is a promising global optimization tool widely used for solving EOP efficiently in the past decades. Given the fruitful advancements of EC for EOP, it is essential to review these advancements in order to synthesize and give previous research experiences and references to aid the development of relevant research fields and real-world applications. Motivated by this, this paper aims to provide a comprehensive survey to show why and how EC can solve EOP efficiently. For this aim, this paper firstly analyzes the total optimization cost of EC in solving EOP. Then, based on the analysis, three promising research directions are pointed out for solving EOP, which are problem approximation and substitution, algorithm design and enhancement, and parallel and distributed computation. Note that, to the best of our knowledge, this paper is the first that outlines the possible directions for efficiently solving EOP by analyzing the total expensive cost. Based on this, existing works are reviewed comprehensively via a taxonomy with four parts, including the above three research directions and the real-world application part. Moreover, some future research directions are also discussed in this paper. It is believed that such a survey can attract attention, encourage discussions, and stimulate new EC research ideas for solving EOP and related real-world applications more efficiently.展开更多
基金Sponsored by Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi(Grant No.2022L294)Taiyuan University of Science and Technology Scientific Research Initial Funding(Grant Nos.W2022018,W20242012)Foundamental Research Program of Shanxi Province(Grant No.202403021212170).
文摘In recent years,surrogate models derived from genuine data samples have proven to be efficient in addressing optimization challenges that are costly or time⁃intensive.However,the individuals in the population become indistinguishable as the curse of dimensionality increases in the objective space and the accumulation of surrogate approximated errors.Therefore,in this paper,each objective function is modeled using a radial basis function approach,and the optimal solution set of the surrogate model is located by the multi⁃objective evolutionary algorithm of strengthened dominance relation.The original objective function values of the true evaluations are converted to two indicator values,and then the surrogate models are set up for the two performance indicators.Finally,an adaptive infill sampling strategy that relies on approximate performance indicators is proposed to assist in selecting individuals for real evaluations from the potential optimal solution set.The algorithm is contrasted against several advanced surrogate⁃assisted evolutionary algorithms on two suites of test cases,and the experimental findings prove that the approach is competitive in solving expensive many⁃objective optimization problems.
基金Project supported by the Plan for the growth of young teachers,the National Natural Science Foundation of China(No.51505138)the National 973 Program of China(No.2010CB328005)+1 种基金Outstanding Youth Foundation of NSFC(No.50625519)Program for Changjiang Scholars
文摘In this work,a hybrid meta-model based design space differentiation（HMDSD）method is proposed for practical problems.In the proposed method,an iteratively reduced promising region is constructed using the expensive points,with two different search strategies respectively applied inside and outside the promising region.Besides,the hybrid meta-model strategy applied in the search process makes it possible to solve the complex practical problems.Tested upon a serial of benchmark math functions,the HMDSD method shows great efficiency and search accuracy.On top of that,a practical lightweight design demonstrates its superior performance.
文摘Modern engineering design optimization often relies on computer simulations to evaluate candidate designs, a setup which results in expensive black-box optimization problems. Such problems introduce unique challenges, which has motivated the application of metamodel-assisted computational intelligence algorithms to solve them. Such algorithms combine a computational intelligence optimizer which employs a population of candidate solutions, with a metamodel which is a computationally cheaper approximation of the expensive computer simulation. However, although a variety of metamodels and optimizers have been proposed, the optimal types to employ are problem dependant. Therefore, a priori prescribing the type of metamodel and optimizer to be used may degrade its effectiveness. Leveraging on this issue, this study proposes a new computational intelligence algorithm which autonomously adapts the type of the metamodel and optimizer during the search by selecting the most suitable types out of a family of candidates at each stage. Performance analysis using a set of test functions demonstrates the effectiveness of the proposed algorithm, and highlights the merit of the proposed adaptation approach.
基金supported by National Key Research and Development Program of China (No. 2019YFB2102102)the Outstanding Youth Science Foundation (No. 61822602)+3 种基金National Natural Science Foundations of China (Nos. 62176094, 61772207 and 61873097)the Key-Area Research and Development of Guangdong Province (No. 2020B010166002)Guangdong Natural Science Foundation Research Team (No. 2018B030312003)National Research Foundation of Korea (No. NRF-2021H1D3A2A01082705)。
文摘Expensive optimization problem(EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for the algorithm to find a satisfactory solution. Moreover, due to the fast-growing application demands in the economy and society, such as the emergence of the smart cities, the internet of things, and the big data era, solving EOP more efficiently has become increasingly essential in various fields, which poses great challenges on the problem-solving ability of optimization approach for EOP. Among various optimization approaches, evolutionary computation(EC) is a promising global optimization tool widely used for solving EOP efficiently in the past decades. Given the fruitful advancements of EC for EOP, it is essential to review these advancements in order to synthesize and give previous research experiences and references to aid the development of relevant research fields and real-world applications. Motivated by this, this paper aims to provide a comprehensive survey to show why and how EC can solve EOP efficiently. For this aim, this paper firstly analyzes the total optimization cost of EC in solving EOP. Then, based on the analysis, three promising research directions are pointed out for solving EOP, which are problem approximation and substitution, algorithm design and enhancement, and parallel and distributed computation. Note that, to the best of our knowledge, this paper is the first that outlines the possible directions for efficiently solving EOP by analyzing the total expensive cost. Based on this, existing works are reviewed comprehensively via a taxonomy with four parts, including the above three research directions and the real-world application part. Moreover, some future research directions are also discussed in this paper. It is believed that such a survey can attract attention, encourage discussions, and stimulate new EC research ideas for solving EOP and related real-world applications more efficiently.
