2019
DOI: 10.1007/s13042-019-00979-6
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid optimization approach based on clustering and chaotic sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(4 citation statements)
references
References 70 publications
0
4
0
Order By: Relevance
“…For instance, in Ref. [ 33 ], chaotic sequences are applied to dynamically improve population size to avoid immature convergence; in Ref. [ 34 ], chaotic sequences are used in the generation of the initial population and the performance of the mutation operators.…”
Section: Details Of Optimization Techniquesmentioning
confidence: 99%
“…For instance, in Ref. [ 33 ], chaotic sequences are applied to dynamically improve population size to avoid immature convergence; in Ref. [ 34 ], chaotic sequences are used in the generation of the initial population and the performance of the mutation operators.…”
Section: Details Of Optimization Techniquesmentioning
confidence: 99%
“…If certain systems evolve from two nearest points, after a sufficient amount of time, they would be infinitely far apart. The chaotic attractor's time patterns are entirely irregular, with no recurrence in any monitoring period of the final length [20]. Although the state is generated by a deterministic equation, there is arbitrariness in the temporal domain and long-term uncertainty in the state.…”
Section: Objective Function and Coamentioning
confidence: 99%
“…A multiobjective integer programming model of UAV flight path was proposed by establishing a mathematical model through three-dimensional grid cells. The author of [9] proposed an algorithm based on the clustering idea, which divides the region of waypoints of different individuals through clustering and obtains the approximate optimal waypoint of UAV so as to guide the generation of offspring. In [10,11], the authors studied the characteristics of the evolutionary algorithm (EA), analyzed the main problems in evolutionary algorithm path planning, and established an evaluation system for a single path point.…”
Section: Introductionmentioning
confidence: 99%