Boosting Data-Driven Evolutionary Algorithm With Localized Data Generation
Open accessThe DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Abstract
By efficiently building and exploiting surrogates, data-driven evolutionary algorithms (DDEAs) can be very helpful in solving expensive and computationally intensive problems. However, they still often suffer from two difficulties. First, many existing methods for building a single ad hoc surrogate are suitable for some special problems but may not work well on some other problems. Second, the optimization accuracy of DDEAs deteriorates if available data are not enough for building accurate surrogates, which is common in expensive optimization problems. To this end, this article proposes a novel DDEA with two efficient components. First, a boosting strategy (BS) is proposed for self-aware model managements, which can iteratively build and combine surrogates to obtain suitable surrogate models for different problems. Second, a localized data generation (LDG) method is proposed to generate synthetic data to alleviate data shortage and increase data quantity, which is achieved by approximating fitness through data positions. By integrating the BS and the LDG, the BDDEA-LDG algorithm is able to improve model accuracy and data quantity at the same time automatically according to the problems at hand. Besides, a tradeoff is empirically considered to strike a better balance between the effectiveness of surrogates and the time cost for building them. The experimental results show that the proposed BDDEA-LDG algorithm can generally outperform both traditional methods without surrogates and other state-of-the-art DDEA son widely used benchmarks and an arterial traffic signal timing real-world optimization problem. Furthermore, the proposed BDDEA-LDG algorithm can use only about 2% computational budgets of traditional methods for producing competitive results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
(2012) · Cited by 9,062
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
Universal Approximation Using Radial-Basis-Function Networks
Park, J., & Sandberg, I. W. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.246 · Cited by 4,112 · cited 1×
“and easy-to-implement method for approximation tasks [15], [18], [67].”
MethodEnsemble Methods: Foundations and Algorithms
Zhou, Z.-H. (2012) · doi:10.1201/b12207 · Cited by 2,534
Large Sample Properties of Simulations Using Latin Hypercube Sampling
Stein, M. (1987) · Technometrics · doi:10.1080/00401706.1987.10488205 · Cited by 2,471
Ensemble Methods: Foundations and Algorithms
Zhou, Z. (2012) · Cited by 2,051
Data-Driven Intelligent Transportation Systems: A Survey
Zhang, J., Wang, F.-Y., Wang, K., Lin, W.-H., Xu, X., & Chen, C. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2158001 · Cited by 1,817 · cited 2×
“To alleviate traffic congestions, optimizing traffic signal control is one of the most effective ways, especially, in arterial traffic [71].”
BackgroundSelf-citationEvolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572 · cited 1×
“Therefore, many preprocessing meth-ods have also been proposed for data with poor quality, such as imbalanced [35], [36], incomplete [37], and noisy data [38].”
BackgroundSurrogate-assisted evolutionary computation: Recent advances and future challenges
Jin, Y. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.05.001 · Cited by 1,514 · cited 6×
“Before the comparisons with other algorithms, we consider the tradeoff between the EOP and SMM for the better performance of the BDDEA-LDG, because properly allocating the computational budgets and resources between EOP and SMM can be crucial to the algorithm performance [2].”
BackgroundMethodInfluentialA comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229 · cited 2×
“Such data utilizations are often achieved through surrogates [14].”
BackgroundMethodSingle- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels
Emmerich, M. T. M., Giannakoglou, K. C., & Naujoks, B. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.859463 · Cited by 759 · cited 1×
“In addition, as evaluating promising and uncertain individuals have different advantages, many strategies called infill criteria are proposed and studied based on the combinations of them, such as expected lower confidence bound [19], probability of improvement [59], and expected improvement [52], [60].”
BackgroundEvolutionary Algorithms in Engineering Applications
(1997) · Springer eBooks · doi:10.1007/978-3-662-03423-1 · Cited by 705 · cited 2×
“As decreasing T may affect optimization accuracy while increasing gen may improve accuracy [1], we cut the T from 100 to 50 and at the same time increase the gen from 100 to 500, so as to tradeoff the budget for SMM against the EOP without losing too much optimization accuracy.”
BackgroundData-Driven Evolutionary Optimization: An Overview and Case Studies
Jin, Y., Wang, H., Chugh, T., Guo, D., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869001 · Cited by 686 · cited 9×
“Based on whether the EOP can obtain new data through real FEs, DDEAs can be implemented in two versions: 1) online DDEAs and 2) offline DDEAs [8].”
BackgroundMethodInfluentialA framework for evolutionary optimization with approximate fitness functions
Jin, Y., Olhofer, M., & Sendhoff, B. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800884 · Cited by 662 · cited 3×
“Generation-based strategies perform FEs according to the generation, where the frequency for performing real FEs can be adaptive [42] or predefined [56].”
BackgroundLiu, B., Zhang, Q., & Gielen, G. E. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2248012 · Cited by 627 · cited 7×
“For example, selecting suitable and appropriate models and methods for building surrogates can improve DDEAs, such as using polynomial fitting methods [14], mathematical estimations [16], and machine learning techniques [17]–[19].”
BackgroundMethodInfluentialChugh, T., Jin, Y., Miettinen, K., Hakanen, J., & Sindhya, K. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2622301 · Cited by 625 · cited 3×
“…can be selected to build surrogates, which can include traditional interpolation methods [16] and machine learning techniques [17], such as polynomial regression model [20], Kriging model [23], [41], artificial neural networks [42]–[44], and radial basis function neural networks (RBFNNs) [45]–[47].”
MethodInfluentialEvolutionary algorithms in control systems engineering: a survey
Fleming, P. J., & Purshouse, R. C. (2002) · Control Engineering Practice · doi:10.1016/s0967-0661(02)00081-3 · Cited by 619 · cited 1×
“This is usually the case in real-world applications, where the FEs may be too expensive or computational intensive to access [3], [4].”
BackgroundMulticlass Imbalance Problems: Analysis and Potential Solutions
Wang, S., & Yao, X. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2012.2187280 · Cited by 567 · cited 1×
“Therefore, many preprocessing meth-ods have also been proposed for data with poor quality, such as imbalanced [35], [36], incomplete [37], and noisy data [38].”
BackgroundBoosting: foundations and algorithms
(2012) · Choice Reviews Online · doi:10.5860/choice.50-2112 · Cited by 505
Generalizing Surrogate-Assisted Evolutionary Computation
Lim, D., Jin, Y., Ong, Y.-S., & Sendhoff, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2027359 · Cited by 484
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437 · cited 2×
“Consequently, different kinds of EAs can be adopted as the optimizer in the BDDEA-LDG, such as particle swarm optimization [63], differential evolution [64], ant colony system [65], and genetic algorithm (GA) [66].”
MethodSurrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425 · cited 16×
“In Table S.I in the supplementary material, BDDEA-LDG is shown to be efficient on medium and high dimensional problems, significantly outperforming SA-COSO and MGP-SLPSO on 15 and 9 test problems, respectively.”
BackgroundMethodInfluentialBoosting: Foundations and Algorithms
Schapire, R. E., & Freund, Y. (2012) · The MIT Press eBooks · doi:10.7551/mitpress/8291.001.0001 · Cited by 417
Wang, H., Jin, Y., & Doherty, J. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2710978 · Cited by 415 · cited 7×
“The employed DDEAs are: DDEA-SE [15], CAL-SAPSO [18], GPEME [19], MGP-SLPSO [13], and SA-COSO [47].”
BackgroundMethodInfluentialResampling-Based Ensemble Methods for Online Class Imbalance Learning
Wang, S., Minku, L. L., & Yao, X. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2345380 · Cited by 396
Evolutionary Generative Adversarial Networks
Wang, C., Xu, C., Yao, X., & Tao, D. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2895748 · Cited by 378
Self-citationAccelerating Evolutionary Algorithms With Gaussian Process Fitness Function Models
Buche, D., Schraudolph, N. N., & Koumoutsakos, P. (2005) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2004.841917 · Cited by 335 · cited 1×
“build surrogates, which can include traditional interpolation methods [16] and machine learning techniques [17], such as polynomial regression model [20], Kriging model [23], [41],”
MethodChugh, T., Sindhya, K., Hakanen, J., & Miettinen, K. (2019) · Soft Computing · doi:10.1007/s00500-017-2965-0 · Cited by 305 · cited 1×
“As a number of DDEAs are proposed for solving multiobjective [32], [33] or many-objective problems [34], the following contents will also clarify their multi-/many-objective characteristics when surveying them among the offline and online DDEAs.”
BackgroundMultiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach
Chen, Z.-G., Zhan, Z.-H., Lin, Y., Gong, Y.-J., Gu, T.-L., Zhao, F., Yuan, H.-Q., Chen, X., Li, Q., & Zhang, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2832640 · Cited by 278 · cited 1×
“adopted as the optimizer in the BDDEA-LDG, such as particle swarm optimization [63], differential evolution [64], ant colony system [65], and genetic algorithm (GA) [66].”
MethodSelf-citationGeneralized Multitasking for Evolutionary Optimization of Expensive Problems
Ding, J., Yang, C., Jin, Y., & Chai, T. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2785351 · Cited by 277 · cited 1×
“Furthermore, in the cases that evaluated data are not enough for building an accurate surrogate, data generation can be an effective approach to increase data quantity [11], [24]–[25].”
BackgroundZhou, Z.-H., Chawla, N. V., Jin, Y., & Williams, G. J. (2014) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2014.2350953 · Cited by 275 · cited 1×
“Furthermore, in the cases that evaluated data are not enough for building an accurate surrogate, data generation can be an effective approach to increase data quantity [11], [24]–[25].”
BackgroundRegis, R. G. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262111 · Cited by 268 · cited 5×
“In the implementation of this article, all the NS surrogates are RBFNNs, which are efficient and easy-to-implement [16], [17].”
MethodInfluentialOffline Data-Driven Evolutionary Optimization Using Selective Surrogate Ensembles
Wang, H., Jin, Y., Sun, C., & Doherty, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2834881 · Cited by 262 · cited 10×
“As for BDDEA-LDG, the underlying optimization algorithm is the same as that used in DDEA-SE [15], which is a variant of GA using a simulated binary crossover (SBX), polynomial mutation, and tournament”
BackgroundMethodInfluentialData-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System
Wang, H., Jin, Y., & Jansen, J. O. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2555315 · Cited by 261 · cited 5×
“For more information, see https://creativecommons.org/licenses/by/4.0/ affect the surrogate performance, data processing methods like local smooth [23] and data mining techniques [10] can be helpful in further improving DDEAs.”
BackgroundMethodInfluentialWang, Z.-J., Zhan, Z.-H., Yu, W.-J., Lin, Y., Zhang, J., Gu, T.-L., & Zhang, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2933499 · Cited by 257
Self-citationGuo, D., Jin, Y., Ding, J., & Chai, T. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2794503 · Cited by 248 · cited 1×
“Except for the Kriging models, some researches employ the variance of surrogate outputs to measure the uncertainty [18], [58].”
MethodLiu, X.-F., Zhan, Z.-H., Gao, Y., Zhang, J., Kwong, S., & Zhang, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2875430 · Cited by 246
Self-citationReducing Fitness Evaluations Using Clustering Techniques and Neural Network Ensembles
Jin, Y., & Sendhoff, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24854-5_71 · Cited by 213 · cited 1×
“artificial neural networks [42]–[44], and radial basis function neural networks (RBFNNs) [45]–[47].”
BackgroundWang, H., & Jin, Y. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2869674 · Cited by 212 · cited 1×
“This is usually the case in real-world applications, where the FEs may be too expensive or computational intensive to access [3], [4].”
BackgroundTian, J., Tan, Y., Zeng, J., Sun, C., & Jin, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869247 · Cited by 199 · cited 16×
“In Table S.I in the supplementary material, BDDEA-LDG is shown to be efficient on medium and high dimensional problems, significantly outperforming SA-COSO and MGP-SLPSO on 15 and 9 test problems, respectively.”
BackgroundMethodInfluentialA Novel Evolutionary Sampling Assisted Optimization Method for High-Dimensional Expensive Problems
Wang, X., Wang, G. G., Song, B., Wang, P., & Wang, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2890818 · Cited by 192 · cited 1×
“For example, Wang et al. [21] integrated global and local surrogates to balance global exploration and local exploitation.”
BackgroundA systems approach to evolutionary multiobjective structural optimization and beyond
Jin, Y., & Sendhoff, B. (2009) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2009.933094 · Cited by 191
A two-layer surrogate-assisted particle swarm optimization algorithm
Sun, C., Jin, Y., Zeng, J., & Yu, Y. (2015) · Soft Computing · doi:10.1007/s00500-014-1283-z · Cited by 182 · cited 1×
“Also, DDEAs can be enhanced by managing and combining a set of surro-gates [15], [20]–[22].”
BackgroundWang, Z.-J., Zhan, Z.-H., Lin, Y., Yu, W.-J., Yuan, H.-Q., Gu, T.-L., Kwong, S., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2769108 · Cited by 177 · cited 1×
“adopted as the optimizer in the BDDEA-LDG, such as particle swarm optimization [63], differential evolution [64], ant colony system [65], and genetic algorithm (GA) [66].”
MethodSelf-citationFaster convergence by means of fitness estimation
Branke, J., & Schmidt, C. (2003) · Soft Computing · doi:10.1007/s00500-003-0329-4 · Cited by 176 · cited 2×
“The promising individuals have better-predicted fitness and may help figure out the exact optimum positions [42], [57], while evaluating the uncertain individuals can increase surrogate reliability [2], [50].”
BackgroundOptimal Cycle Program of Traffic Lights With Particle Swarm Optimization
Garcia-Nieto, J., Olivera, A. C., & Alba, E. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2260755 · Cited by 165 · cited 1×
“Therefore, to shorten the evaluations, the signal control plan is often designed through simulations of professional software, like VISSIM [72], [73].”
MethodCloudde: A Heterogeneous Differential Evolution Algorithm and Its Distributed Cloud Version
Zhan, Z., Liu, X., Zhang, H., Yu, Z., Weng, J., Li, Y., Gu, T., & Zhang, J. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2016.2597826 · Cited by 164
Self-citationHabib, A., Singh, H. K., Chugh, T., Ray, T., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2899030 · Cited by 161 · cited 1×
“As a number of DDEAs are proposed for solving multiobjective [32], [33] or many-objective problems [34], the following contents will also clarify their multi-/many-objective characteristics when surveying them among the offline and online DDEAs.”
BackgroundEvolutionary Cluster-Based Synthetic Oversampling Ensemble (ECO-Ensemble) for Imbalance Learning
Lim, P., Goh, C. K., & Tan, K. C. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2579658 · Cited by 160
Chugh, T., Chakraborti, N., Sindhya, K., & Jin, Y. (2016) · Materials and Manufacturing Processes · doi:10.1080/10426914.2016.1269923 · Cited by 145 · cited 2×
“Furthermore, in some very difficult application problems, such as blast furnace optimizations [8], [9], trauma system optimizations [10], and fused magnesium fur-naces optimizations [11], no real FEs can be conducted any more during the evolutionary process due to their practical conditions, such as…”
BackgroundMethodTrace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data
Liu, Y., Shang, F., Jiao, L., Cheng, J. S.-C., & Cheng, H. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2374695 · Cited by 132 · cited 1×
“Therefore, many preprocessing meth-ods have also been proposed for data with poor quality, such as imbalanced [35], [36], incomplete [37], and noisy data [38].”
BackgroundA new fitness estimation strategy for particle swarm optimization
Sun, C., Zeng, J., Pan, J., Xue, S., & Jin, Y. (2012) · Information Sciences · doi:10.1016/j.ins.2012.09.030 · Cited by 127
Structure optimization of neural networks for evolutionary design optimization
H�sken, M., Jin, Y., & Sendhoff, B. (2003) · Soft Computing · doi:10.1007/s00500-003-0330-y · Cited by 123
Predictive Ensemble Pruning by Expectation Propagation
Chen, H., Tiňo, P., & Yao, X. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.62 · Cited by 119 · cited 1×
“Like other researches in machine learning, our main task is to obtain a model M that has a small E ( M ) [29], [62].”
BackgroundZhang, X., Du, K.-J., Zhan, Z., Kwong, S., Gu, T., & Zhang, J. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2937565 · Cited by 118 · cited 1×
“For future work, the algorithm proposed in this article will be applied to solve problems with more complicated challenges, such as large-scale [74], multi/many-objective [75], multimodal [76], dynamics [77], and constraint [78].”
MethodSelf-citationOptimal Control for Speed Harmonization of Automated Vehicles
Malikopoulos, A. A., Hong, S., Park, B., Lee, J., & Ryu, S. (2018) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2018.2865561 · Cited by 110 · cited 1×
“Due to the substantial increase in vehicle numbers, the traffic congestion phenomenon has received increasing attention,which means traffic demand exceeds the capacity of transportation systems [70].”
BackgroundAllmendinger, R., Emmerich, M., Hakanen, J., Jin, Y., & Rigoni, E. (2017) · Journal of Multi-Criteria Decision Analysis · doi:10.1002/mcda.1605 · Cited by 98
MOEA/D assisted by rbf networks for expensive multi-objective optimization problems
Martinez, S. Z., & Coello, C. A. C. (2013) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2463372.2465805 · Cited by 98 · cited 1×
“…can be selected to build surrogates, which can include traditional interpolation methods [16] and machine learning techniques [17], such as polynomial regression model [20], Kriging model [23], [41], artificial neural networks [42]–[44], and radial basis function neural networks (RBFNNs) [45]–[47].”
Ponweiser, W., Wagner, T., & Vincze, M. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4631273 · Cited by 89 · cited 1×
“In addition, as evaluating promising and uncertain individuals have different advantages, many strategies called infill criteria are proposed and studied based on the combinations of them, such as expected lower confidence bound [19], probability of improvement [59], and expected improvement [52], [60].”
BackgroundNamura, N., Shimoyama, K., & Obayashi, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2693320 · Cited by 78 · cited 1×
“…addition, as evaluating promising and uncertain individuals have different advantages, many strategies called infill criteria are proposed and studied based on the combinations of them, such as expected lower confidence bound [19], probability of improvement [59], and expected improvement [52], [60].”
BackgroundSmall data driven evolutionary multi-objective optimization of fused magnesium furnaces
Guo, D., Chai, T., Ding, J., & Jin, Y. (2016) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci.2016.7850211 · Cited by 73 · cited 3×
“For example, in a multiobjective fused magnesium furnace optimization problem, Guo et al. [11] used a low-order polynomial model to generate synthetic data and predict their fitness.”
BackgroundComparing neural networks and Kriging for fitness approximation in evolutionary optimization
Willmes, L., Bäck, T., Jin, Y., & Sendhoff, B. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299639 · Cited by 69
Voutchkov, I. I., Keane, A. J., Bhaskar, A., & Olsen, T. M. (2005) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2005.02.003 · Cited by 63 · cited 1×
“For example, a surrogate with simplified models for the automated design problem of dispatching rules [26] may not work well for the weld sequence optimization problems [27].”
MethodRegularity Model for Noisy Multiobjective Optimization
Wang, H., Zhang, Q., Jiao, L., et al. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2459137 · Cited by 60
Quantifying uncertainty on Pareto fronts with Gaussian process conditional simulations
Binois, M., Ginsbourger, D., & Roustant, O. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.07.032 · Cited by 58 · cited 1×
“Therefore, some methods, like Kriging models [23], [51], are favored by many strategies because they are able to provide measurements of prediction uncertainty.”
MethodAlternative infill strategies for expensive multi-objective optimisation
Rahat, A. A.-A. M., Everson, R., & Fieldsend, J. E. (2017) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3071178.3071276 · Cited by 52
Dabiri, S., & Abbas, M. M. (2016) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2016.7795641 · Cited by 42 · cited 3×
“An arterial traffic signal timing problem can be formulated as follows [73]:”
BackgroundMethodSurrogate-Assisted Evolutionary Optimization of Large Problems
Chugh, T., Sun, C., Wang, H., & Jin, Y. (2019) · Studies in computational intelligence · doi:10.1007/978-3-030-18764-4_8 · Cited by 41 · cited 1×
“Second, RBFNNs have been widely used as surrogates in [12], [15], and [17], which are the compared algorithms in this article, and, therefore, using RBFNNs in BDDEA-LDG can help achieve fair comparisons.”
MethodMazumdar, A., Chugh, T., Miettinen, K., & López‐Ibáñez, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12598-1_37 · Cited by 20 · cited 1×
“As a number of DDEAs are proposed for solving multiobjective [32], [33] or manyobjective problems [34], the following contents will also clar-”
BackgroundChugh, T., Krátký, T., Miettinen, K., Jin, Y., & Makonen, P. (2019) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3321707.3321745 · Cited by 13
Cited by
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Self-citationA review of surrogate-assisted evolutionary algorithms for expensive optimization problems
He, C., Zhang, Y., Gong, D., & Ji, X. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119495 · Cited by 272
A Meta-Knowledge Transfer-Based Differential Evolution for Multitask Optimization
Li, J.-Y., Zhan, Z.-H., Tan, K. C., & Zhang, J. (2022) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3131236 · Cited by 185
Self-citation
Metadata
- Authors
- Li, J.-Y., Zhan, Z.-H., Wang, C., Jin, H., & Zhang, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2020-10
- Volume
- 24
- Issue
- 5
- Pages
- 923-937
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W3012446350
- Cited by
- 164
- References
- 72
- FWCI
- 14.06
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.