2022
DOI: 10.1016/j.engappai.2022.104727
|View full text |Cite
|
Sign up to set email alerts
|

A differential evolution algorithm with the guided movement for population and its application to interplanetary transfer trajectory design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…The efficient L-SHADE algorithms, include the three variants applied in this study, as well as SPS-L-SHADE-EIG that uses rotation invariant mechanism [107], L-SHADE-cnEpSin [108] that uses ensemble of sinusoidal approaches in parameter adaptation, L-SHADE-X [109] that introduces dimensionalitydependent spread parameter in distribution from which scaling factor is generated and an archive with offsprings that did not reach the main population despite having good performance, or OLSHADE-CS [110] that uses novel initialization and conservative selection mechanisms. In our opinion large successes of L-SHADE-based algorithms justify testing various their variants on different practical applications, as in [111]- [113].…”
Section: A Chosen Optimization Algorithmsmentioning
confidence: 96%
See 1 more Smart Citation
“…The efficient L-SHADE algorithms, include the three variants applied in this study, as well as SPS-L-SHADE-EIG that uses rotation invariant mechanism [107], L-SHADE-cnEpSin [108] that uses ensemble of sinusoidal approaches in parameter adaptation, L-SHADE-X [109] that introduces dimensionalitydependent spread parameter in distribution from which scaling factor is generated and an archive with offsprings that did not reach the main population despite having good performance, or OLSHADE-CS [110] that uses novel initialization and conservative selection mechanisms. In our opinion large successes of L-SHADE-based algorithms justify testing various their variants on different practical applications, as in [111]- [113].…”
Section: A Chosen Optimization Algorithmsmentioning
confidence: 96%
“…Various issues may affect this choice. Some of them are related to the flexibility of the specific algorithm, like balancing exploration and exploitation during search [46]- [49], fitness-landscape analysis [45], [50], [51], the approach to control parameter adaptation [52]- [57], or specification of the population size [58]- [61]. The other factors are related to the comparison settings that are set by the user, like the assumed maximum number of allowed function calls [62], [63], the specific benchmarks or criteria based on which the choice is being made [64]- [66], the statistical tests used in the evaluation [67], [68], or the nature of the decision space [69]- [70].…”
Section: Introductionmentioning
confidence: 99%
“…Unlike the deep reinforcement learning generating regulatory strategies, evolutionary computation does not require known jig states, i.e., s t , but only a surrogate model evaluating candidate solutions and parameter boundaries is needed. Evolutionary algorithms, such as diferential evolution (DE) [16][17][18][19], are efective in solving the highdimensional optimization problems. However, to avoid large adjustment of equipment parameters, DE can only locally fne-tune the control parameters.…”
Section: Regulatory Strategies With Auto-diferential Evolutionmentioning
confidence: 99%
“…To adjust the search direction, the multiple-operator method is a candidate. In this method, use of different reproduction operators leads to the generation of diverse types of solutions, aiding in adjusting the search direction of the population [3,[6][7][8]. However, the selection of reproduction operators also usually relies on subjective human experience, making it tough to determine the timing and scope of their application.…”
Section: Introductionmentioning
confidence: 99%