2019
DOI: 10.1007/978-3-030-18764-4_8
|View full text |Cite
|
Sign up to set email alerts
|

Surrogate-Assisted Evolutionary Optimization of Large Problems

Abstract: This chapter presents some recent advances in surrogate-assisted evolutionary optimization of large problems. By large problems, we mean either the number of decision variables is large, or the number of objectives is large, or both. These problems pose challenges to evolutionary algorithms themselves, constructing surrogates and surrogate management. To address these challenges, we proposed two algorithms, one called kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) for many-objective o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 54 publications
0
14
0
Order By: Relevance
“…These algorithms are discussed in the following sections. Many optimization techniques based on bioinspired processes and Surrogate-Assisted natural methods have been formulated, and mathematical and statistical analysis of these algorithms has been performed [49][50][51][52]. The comparative performance study based on convergence trends was performed with different geometry parameterization techniques.…”
Section: Literature Surveymentioning
confidence: 99%
“…These algorithms are discussed in the following sections. Many optimization techniques based on bioinspired processes and Surrogate-Assisted natural methods have been formulated, and mathematical and statistical analysis of these algorithms has been performed [49][50][51][52]. The comparative performance study based on convergence trends was performed with different geometry parameterization techniques.…”
Section: Literature Surveymentioning
confidence: 99%
“…First, RBFNN is a fast, computationally efficient, and easy-to-implement method for approximation tasks [15], [18], [67]. 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. The settings of all RBFNNs in BDDEA-LDG are configured the same as those in DDEA-SE [15], so that their comparisons can be fair.…”
Section: A Experimental Setupmentioning
confidence: 99%
“…C min ≤ C ≤ C max (8) 0 ≤ θ z ≤ C ∀z ∈ Z (9) g min ≤ g z,i ≤ g max ∀z ∈ Z ∀i ∈ I (10) g z,1 + g z,1 = g z,5 + g z,6 ∀z ∈ Z (11) g z,3 + g z,4 = g z,7 + g z,8 ∀z ∈ Z (12) where OF is the objective function of three decision variables including cycle period (C), green splits (g), and offsets (θ ), Z is the intersection set (each Z has 8 g), I is the signal set of an intersection (containing green, yellow, and red signals), and C max and C min are maximum and minimum cycle length for a complete period, g max and g min are the maximum and minimum of a green splits, respectively. Equations (11) and (12) are for the ring-barrier diagram strategy such that the east-west and north-south movements will not contradict each other. The signal timing problem used in this article is a road with four intersections (Z = 4), both of which are T-junctions, as shown in Fig.…”
Section: Arterial Traffic Signal Timing Optimizationmentioning
confidence: 99%
“…Surrogate-based methods allow us to reduce the computational cost of search algorithms, as opposed to parallelisation techniques that merely focus on reducing processing time. This kind of approach has been widely investigated in various problems employing evolutionary optimisation techniques [40,41,42,43],…”
Section: Introductionmentioning
confidence: 99%