Meta-heuristic evolutionary algorithms have become widely used for solving complex optimization problems.However,their effectiveness in real-world applications is often limited by the need for many evaluations,which c...Meta-heuristic evolutionary algorithms have become widely used for solving complex optimization problems.However,their effectiveness in real-world applications is often limited by the need for many evaluations,which can be both costly and time-consuming.This is especially true for large-scale transportation networks,where the size of the problem and the high computational cost can hinder the algorithm’s performance.To address these challenges,recent research has focused on using surrogate-assisted models.These models aim to reduce the number of expensive evaluations and improve the efficiency of solving time-consuming optimization problems.This paper presents a new two-layer Surrogate-Assisted Fish Migration Optimization(SA-FMO)algorithm designed to tackle high-dimensional and computationally heavy problems.The global surrogate model offers a good approximation of the entire problem space,while the local surrogate model focuses on refining the solution near the current best option,improving local optimization.To test the effectiveness of the SA-FMO algorithm,we first conduct experiments using six benchmark functions in a 50-dimensional space.We then apply the algorithm to optimize urban rail transit routes,focusing on the Train Routing Optimization problem.This aims to improve operational efficiency and vehicle turnover in situations with uneven passenger flow during transit disruptions.The results show that SA-FMO can effectively improve optimization outcomes in complex transportation scenarios.展开更多
The Traveling Salesman Problem(TSP)is a well-known NP-Hard problem,particularly challenging for conventional solving methods due to the curse of dimensionality in high-dimensional instances.This paper proposes a novel...The Traveling Salesman Problem(TSP)is a well-known NP-Hard problem,particularly challenging for conventional solving methods due to the curse of dimensionality in high-dimensional instances.This paper proposes a novel Double-stage Surrogate-assisted Pigeon-inspired Optimization algorithm(DOSA-PIO)to address this issue.DOSA-PIO integrates the ordering points to identify the clustering structure method for data clustering and employs a local surrogate model to assist the evolution of the Pigeon-inspired Optimization(PIO)algorithm.This combination enhances the algorithm’s ability to explore the solution space and converge to optimal solutions more effectively.Additionally,two novel approaches are introduced to extend the generalizability of continuous algorithms for solving discrete problems,enabling the adaptation of continuous optimization techniques to the discrete nature of TSP.Extensive experiments using benchmark functions and high-dimensional TSP instances demonstrate that DOSA-PIO significantly outperforms comparative algorithms in various dimensions(10D,20D,30D,50D,and 100D).The proposed algorithm provides superior solutions compared to traditional methods,highlighting its potential for solving high-dimensional TSPs.By leveraging advanced data clustering techniques and surrogate-assisted optimization,DOSA-PIO offers an effective solution for high-dimensional TSP instances,with experimental results confirming its superior performance and potential for practical applications in complex optimization problems.展开更多
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.展开更多
Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,...Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,which may not capture all the features of the data.This paper proposes a novel method for time series clustering based on evolutionary multi-tasking optimization,termed i-MFEA,which uses an improved multifactorial evolutionary algorithm to optimize multiple clustering tasks simultaneously,each with a different validity index or distance measure.Therefore,i-MFEA can produce diverse and robust clustering solutions that satisfy various preferences of decision-makers.Experiments on two artificial datasets show that i-MFEA outperforms single-objective evolutionary algorithms and traditional clustering methods in terms of convergence speed and clustering quality.The paper also discusses how i-MFEA can address two long-standing issues in time series clustering:the choice of appropriate similarity measure and the number of clusters.展开更多
The constrained multi-objective multi-variable optimization of fans usually needs a great deal of computational fluid dynamics(CFD)calculations and is time-consuming.In this study,a new multi-model ensemble optimizati...The constrained multi-objective multi-variable optimization of fans usually needs a great deal of computational fluid dynamics(CFD)calculations and is time-consuming.In this study,a new multi-model ensemble optimization algorithm is proposed to tackle such an expensive optimization problem.The multi-variable and multi-objective optimization are conducted with a new flexible multi-objective infill criterion.In addition,the search direction is determined by the multi-model ensemble assisted evolutionary algorithm and the feature extraction by the principal component analysis is used to reduce the dimension of optimization variables.First,the proposed algorithm and other two optimization algorithms which prevail in fan optimizations were compared by using test functions.With the same number of objective function evaluations,the proposed algorithm shows a fast convergency rate on finding the optimal objective function values.Then,this algorithm was used to optimize the rotor and stator blades of a large axial fan,with the efficiencies as the objectives at three flow rates,the high,the design and the low flow rate.Forty-two variables were included in the optimization process.The results show that compared with the prototype fan,the total pressure efficiencies of the optimized fan at the high,the design and the low flow rate were increased by 3.35%,3.07%and 2.89%,respectively,after CFD simulations for 500 fan candidates with the constraint for the design pressure.The optimization results validate the effectiveness and feasibility of the proposed algorithm.展开更多
To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is prese...To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is presented. In the first part, the KE-VFS model is established. Firstly, the optimization is performed using the low-fidelity surrogate model to obtain the Low-Fidelity Non-Dominated Solutions(LF-NDS). Secondly, aiming to obtain the High-Fidelity(HF) sample points located in promising areas, the K-means clustering algorithm and the space-filling strategy are used to extract knowledge from the LF-NDS to the HF space. Finally,the KE-VFS model is established by means of the obtained HF and LF sample points. In the second part, a novel model management based on the Modified Hypervolume Improvement(MHVI) criterion and pre-screening strategy is proposed. In each generation of KE-VFS-CMA-ES, excessive candidate points are firstly generated and then calculated by the MHVI criterion to find out a few potential points, which will be evaluated by the HF model. Through the above two parts,the promising areas can be detected and the potential points can be screened out, which contributes to speeding up the optimization process twofold. Three classic benchmark functions and a time-consuming engineering case of the aerospace integrally stiffened shell are studied, and results illustrate the excellent efficiency, robustness and applicability of KE-VFS-CMA-ES compared with other four known multi-objective optimization algorithms.展开更多
基金supported by the National Natural Science Foundation of China(Project No.52172321,52102391)Sichuan Province Science and Technology Innovation Talent Project(2024JDRC0020)+1 种基金China Shenhua Energy Company Limited Technology Project(GJNY-22-7/2300-K1220053)Key science and technology projects in the transportation industry of the Ministry of Transport(2022-ZD7-132).
文摘Meta-heuristic evolutionary algorithms have become widely used for solving complex optimization problems.However,their effectiveness in real-world applications is often limited by the need for many evaluations,which can be both costly and time-consuming.This is especially true for large-scale transportation networks,where the size of the problem and the high computational cost can hinder the algorithm’s performance.To address these challenges,recent research has focused on using surrogate-assisted models.These models aim to reduce the number of expensive evaluations and improve the efficiency of solving time-consuming optimization problems.This paper presents a new two-layer Surrogate-Assisted Fish Migration Optimization(SA-FMO)algorithm designed to tackle high-dimensional and computationally heavy problems.The global surrogate model offers a good approximation of the entire problem space,while the local surrogate model focuses on refining the solution near the current best option,improving local optimization.To test the effectiveness of the SA-FMO algorithm,we first conduct experiments using six benchmark functions in a 50-dimensional space.We then apply the algorithm to optimize urban rail transit routes,focusing on the Train Routing Optimization problem.This aims to improve operational efficiency and vehicle turnover in situations with uneven passenger flow during transit disruptions.The results show that SA-FMO can effectively improve optimization outcomes in complex transportation scenarios.
基金funded by National Natural Science Foundation of China(Project No.52072314,52172321,52102391)China Shenhua Energy Co.,Ltd.,Science and Technology Program(Project No.GJNY-22-7)+2 种基金China State Railway Group Co.,Ltd.Science and Technology Program(P2022×013,K2023×030)Key science and technology projects in the transportation industry of the Ministry of Transport(2022-ZD7-131)the fundamental research funds for the central universities(2682022ZTPY068).
文摘The Traveling Salesman Problem(TSP)is a well-known NP-Hard problem,particularly challenging for conventional solving methods due to the curse of dimensionality in high-dimensional instances.This paper proposes a novel Double-stage Surrogate-assisted Pigeon-inspired Optimization algorithm(DOSA-PIO)to address this issue.DOSA-PIO integrates the ordering points to identify the clustering structure method for data clustering and employs a local surrogate model to assist the evolution of the Pigeon-inspired Optimization(PIO)algorithm.This combination enhances the algorithm’s ability to explore the solution space and converge to optimal solutions more effectively.Additionally,two novel approaches are introduced to extend the generalizability of continuous algorithms for solving discrete problems,enabling the adaptation of continuous optimization techniques to the discrete nature of TSP.Extensive experiments using benchmark functions and high-dimensional TSP instances demonstrate that DOSA-PIO significantly outperforms comparative algorithms in various dimensions(10D,20D,30D,50D,and 100D).The proposed algorithm provides superior solutions compared to traditional methods,highlighting its potential for solving high-dimensional TSPs.By leveraging advanced data clustering techniques and surrogate-assisted optimization,DOSA-PIO offers an effective solution for high-dimensional TSP instances,with experimental results confirming its superior performance and potential for practical applications in complex optimization problems.
基金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.
基金supported by the Open Project of Xiangjiang Laboratory(No.22XJ02003)the National Natural Science Foundation of China(No.62122093).
文摘Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,which may not capture all the features of the data.This paper proposes a novel method for time series clustering based on evolutionary multi-tasking optimization,termed i-MFEA,which uses an improved multifactorial evolutionary algorithm to optimize multiple clustering tasks simultaneously,each with a different validity index or distance measure.Therefore,i-MFEA can produce diverse and robust clustering solutions that satisfy various preferences of decision-makers.Experiments on two artificial datasets show that i-MFEA outperforms single-objective evolutionary algorithms and traditional clustering methods in terms of convergence speed and clustering quality.The paper also discusses how i-MFEA can address two long-standing issues in time series clustering:the choice of appropriate similarity measure and the number of clusters.
基金support of National Science and Technology Major Project(2017-11-0007-0021)。
文摘The constrained multi-objective multi-variable optimization of fans usually needs a great deal of computational fluid dynamics(CFD)calculations and is time-consuming.In this study,a new multi-model ensemble optimization algorithm is proposed to tackle such an expensive optimization problem.The multi-variable and multi-objective optimization are conducted with a new flexible multi-objective infill criterion.In addition,the search direction is determined by the multi-model ensemble assisted evolutionary algorithm and the feature extraction by the principal component analysis is used to reduce the dimension of optimization variables.First,the proposed algorithm and other two optimization algorithms which prevail in fan optimizations were compared by using test functions.With the same number of objective function evaluations,the proposed algorithm shows a fast convergency rate on finding the optimal objective function values.Then,this algorithm was used to optimize the rotor and stator blades of a large axial fan,with the efficiencies as the objectives at three flow rates,the high,the design and the low flow rate.Forty-two variables were included in the optimization process.The results show that compared with the prototype fan,the total pressure efficiencies of the optimized fan at the high,the design and the low flow rate were increased by 3.35%,3.07%and 2.89%,respectively,after CFD simulations for 500 fan candidates with the constraint for the design pressure.The optimization results validate the effectiveness and feasibility of the proposed algorithm.
基金supported by the National Natural Science Foundation of China(Nos.11902065,11825202)the Fundamental Research Funds for the Central Universities,China(No.DUT21RC(3)013).
文摘To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is presented. In the first part, the KE-VFS model is established. Firstly, the optimization is performed using the low-fidelity surrogate model to obtain the Low-Fidelity Non-Dominated Solutions(LF-NDS). Secondly, aiming to obtain the High-Fidelity(HF) sample points located in promising areas, the K-means clustering algorithm and the space-filling strategy are used to extract knowledge from the LF-NDS to the HF space. Finally,the KE-VFS model is established by means of the obtained HF and LF sample points. In the second part, a novel model management based on the Modified Hypervolume Improvement(MHVI) criterion and pre-screening strategy is proposed. In each generation of KE-VFS-CMA-ES, excessive candidate points are firstly generated and then calculated by the MHVI criterion to find out a few potential points, which will be evaluated by the HF model. Through the above two parts,the promising areas can be detected and the potential points can be screened out, which contributes to speeding up the optimization process twofold. Three classic benchmark functions and a time-consuming engineering case of the aerospace integrally stiffened shell are studied, and results illustrate the excellent efficiency, robustness and applicability of KE-VFS-CMA-ES compared with other four known multi-objective optimization algorithms.
