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.展开更多
It has been theoretically proven that at a high threshold an approximate expression for a quantile of GEV （Generalized Extreme Values） distribution can be derived from GPD （Generalized Pareto Distribution）. Afterw...It has been theoretically proven that at a high threshold an approximate expression for a quantile of GEV （Generalized Extreme Values） distribution can be derived from GPD （Generalized Pareto Distribution）. Afterwards, a quantile of extreme rainfall events in a certain return period is found using L-moment estimation and extreme rainfall events simulated by GPD and GEV, with all aspects of their results compared. Numerical simulations show that POT （Peaks Over Threshold）-based GPD is advantageous in its simple operation and subjected to practically no effect of the sample size of the primitive series, producing steady high-precision fittings in the whole field of values （including the high-end heavy tailed）. In comparison, BM （Block Maximum）-based GEV is limited, to some extent, to the probability and quantile simulation, thereby showing that GPD is an extension of GEV, the former being of greater utility and higher significance to climate research compared to the latter.展开更多
Gigacycle fatigue behavior of 60Si2CrVA high strength spring steel was investigated by ultrasonic fatigue test machine. Fatigue fractography was observed by scanning electron microscopy （SEM）. Maximum inclusion size...Gigacycle fatigue behavior of 60Si2CrVA high strength spring steel was investigated by ultrasonic fatigue test machine. Fatigue fractography was observed by scanning electron microscopy （SEM）. Maximum inclusion sizes and fatigue strength in different volumes were estimated by statistics of extreme values （SEV） and generalized Pareto distribution （GPD） methods. The results showed that S N curves of 60Si2CrVA spring steels for two rolling processes were not horizontal asymptotes but a gradient in a regime of 109 cycles, and traditional fatigue limits were eliminated. Surface machined topography and inclusions in steel were major factors that led to elimination of fatigue limit for 60Si2CrVA spring steel. The SEV and GPD methods could effectively predict size of the maximum inclusion and fatigue strength in different volumes of 60Si2CrVA spring steel. Predicted fatigue strength was in accordance with experimental results by ultrasonic fatigue testing.展开更多
For multi-objective optimization problems, particle swarm optimization(PSO) algorithm generally needs a large number of fitness evaluations to obtain the Pareto optimal solutions. However, it will become substantially...For multi-objective optimization problems, particle swarm optimization(PSO) algorithm generally needs a large number of fitness evaluations to obtain the Pareto optimal solutions. However, it will become substantially time-consuming when handling computationally expensive fitness functions. In order to save the computational cost, a surrogate-assisted PSO with Pareto active learning is proposed. In real physical space(the objective functions are computationally expensive), PSO is used as an optimizer, and its optimization results are used to construct the surrogate models. In virtual space, objective functions are replaced by the cheaper surrogate models, PSO is viewed as a sampler to produce the candidate solutions. To enhance the quality of candidate solutions, a hybrid mutation sampling method based on the simulated evolution is proposed, which combines the advantage of fast convergence of PSO and implements mutation to increase diversity. Furthermore, ε-Pareto active learning(ε-PAL)method is employed to pre-select candidate solutions to guide PSO in the real physical space. However, little work has considered the method of determining parameter ε. Therefore, a greedy search method is presented to determine the value ofεwhere the number of active sampling is employed as the evaluation criteria of classification cost. Experimental studies involving application on a number of benchmark test problems and parameter determination for multi-input multi-output least squares support vector machines(MLSSVM) are given, in which the results demonstrate promising performance of the proposed algorithm compared with other representative multi-objective particle swarm optimization(MOPSO) algorithms.展开更多
基金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.
基金supported jointly Science Foundation of China （Grant No. 40675043） Program of the Jiangsu Key Laboratory of Meteorological Disaster （Grant No. KLME050209）.
文摘It has been theoretically proven that at a high threshold an approximate expression for a quantile of GEV （Generalized Extreme Values） distribution can be derived from GPD （Generalized Pareto Distribution）. Afterwards, a quantile of extreme rainfall events in a certain return period is found using L-moment estimation and extreme rainfall events simulated by GPD and GEV, with all aspects of their results compared. Numerical simulations show that POT （Peaks Over Threshold）-based GPD is advantageous in its simple operation and subjected to practically no effect of the sample size of the primitive series, producing steady high-precision fittings in the whole field of values （including the high-end heavy tailed）. In comparison, BM （Block Maximum）-based GEV is limited, to some extent, to the probability and quantile simulation, thereby showing that GPD is an extension of GEV, the former being of greater utility and higher significance to climate research compared to the latter.
基金Sponsored by National Basic Research Program(973 Program)of China(2004CB619100)
文摘Gigacycle fatigue behavior of 60Si2CrVA high strength spring steel was investigated by ultrasonic fatigue test machine. Fatigue fractography was observed by scanning electron microscopy （SEM）. Maximum inclusion sizes and fatigue strength in different volumes were estimated by statistics of extreme values （SEV） and generalized Pareto distribution （GPD） methods. The results showed that S N curves of 60Si2CrVA spring steels for two rolling processes were not horizontal asymptotes but a gradient in a regime of 109 cycles, and traditional fatigue limits were eliminated. Surface machined topography and inclusions in steel were major factors that led to elimination of fatigue limit for 60Si2CrVA spring steel. The SEV and GPD methods could effectively predict size of the maximum inclusion and fatigue strength in different volumes of 60Si2CrVA spring steel. Predicted fatigue strength was in accordance with experimental results by ultrasonic fatigue testing.
基金supported by the National Natural Sciences Foundation of China(61603069,61533005,61522304,U1560102)the National Key Research and Development Program of China(2017YFA0700300)
文摘For multi-objective optimization problems, particle swarm optimization(PSO) algorithm generally needs a large number of fitness evaluations to obtain the Pareto optimal solutions. However, it will become substantially time-consuming when handling computationally expensive fitness functions. In order to save the computational cost, a surrogate-assisted PSO with Pareto active learning is proposed. In real physical space(the objective functions are computationally expensive), PSO is used as an optimizer, and its optimization results are used to construct the surrogate models. In virtual space, objective functions are replaced by the cheaper surrogate models, PSO is viewed as a sampler to produce the candidate solutions. To enhance the quality of candidate solutions, a hybrid mutation sampling method based on the simulated evolution is proposed, which combines the advantage of fast convergence of PSO and implements mutation to increase diversity. Furthermore, ε-Pareto active learning(ε-PAL)method is employed to pre-select candidate solutions to guide PSO in the real physical space. However, little work has considered the method of determining parameter ε. Therefore, a greedy search method is presented to determine the value ofεwhere the number of active sampling is employed as the evaluation criteria of classification cost. Experimental studies involving application on a number of benchmark test problems and parameter determination for multi-input multi-output least squares support vector machines(MLSSVM) are given, in which the results demonstrate promising performance of the proposed algorithm compared with other representative multi-objective particle swarm optimization(MOPSO) algorithms.
