2013
DOI: 10.1016/j.asoc.2012.10.001
|View full text |Cite
|
Sign up to set email alerts
|

A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
30
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 56 publications
(30 citation statements)
references
References 30 publications
0
30
0
Order By: Relevance
“…Similar to other scheduling problems, the TTSP is one kind of combination optimization problems. It is illustrated to be an NP-hard problem through the analysis of the nature of the problem carried out by many researchers [1][2][3]. In addition, through the fitness distance analysis [4], we know that the TTSP has many local optima.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Similar to other scheduling problems, the TTSP is one kind of combination optimization problems. It is illustrated to be an NP-hard problem through the analysis of the nature of the problem carried out by many researchers [1][2][3]. In addition, through the fitness distance analysis [4], we know that the TTSP has many local optima.…”
Section: Introductionmentioning
confidence: 99%
“…Different from the hybrid method using different kinds of algorithms, using chaos in the evolutionary process represents its advantages in improving the searching ability. Lu et al proposed a chaotic nondominated sorting genetic algorithm for the multiobjective test task scheduling problem and validated the best performance in convergence and diversity through the experiment and analysis [1]. Donald et al utilized the chaos-induced discrete self-organizing migrating algorithm to solve the lot-streaming flow shop scheduling problem with setup time [7].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Mahdiyeh [27] introduced chaotic sequence into particle swarm optimization to improve global searching capability and escape premature convergence to local minima for a power system stabilizer design. Although researchers have studied approaches that combined chaos with evolutionary algorithms in various fields, the research on combing chaotic operators with NSGA-II has not been well addressed [22,24,26] and will be explored in detail in this study. Meanwhile, it is also the first time that adopting the NSGA-II combined with chaotic operators in the domain of HEV as in this study.…”
Section: Introductionmentioning
confidence: 99%
“…NSGA-II was presented by Deb in 2002 and has been successfully applied to optimize reactive power dispatch problems [21], automatic test task scheduling problems [22], propulsion system of marine vessels [23], and other optimization problems. This method can effectively obtain improved spreading solutions.…”
Section: Introductionmentioning
confidence: 99%