2020
DOI: 10.1016/j.jksuci.2019.09.010
|View full text |Cite
|
Sign up to set email alerts
|

PSO based test case generation for critical path using improved combined fitness function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 36 publications
(14 citation statements)
references
References 12 publications
0
13
0
1
Order By: Relevance
“…compared with the particle swarm optimization (PSO) described in document [22], the parallel genetic algorithm with the elite set (PGA) described in document [23], the simulated annealing genetic algorithm (SAGA) described in document [24], the deep intelligent ant colony optimization algorithm (ACA) described in document [25], and the chemical reaction algorithm (CRO) described in document [26]. Te algorithm parameters are shown in Table 1.…”
Section: The Simulation Experiments and The Comparison Of Resultsmentioning
confidence: 99%
“…compared with the particle swarm optimization (PSO) described in document [22], the parallel genetic algorithm with the elite set (PGA) described in document [23], the simulated annealing genetic algorithm (SAGA) described in document [24], the deep intelligent ant colony optimization algorithm (ACA) described in document [25], and the chemical reaction algorithm (CRO) described in document [26]. Te algorithm parameters are shown in Table 1.…”
Section: The Simulation Experiments and The Comparison Of Resultsmentioning
confidence: 99%
“…Once the power flow in the complex domain has been solved for each time period, as shown in ( 23 ), and the complex power generated by the node for each time period has been determined, as shown in ( 25 ), the fitness function (an adaptation of the objective function common in metaheuristics [ 42 , 43 ]) is then calculated for each individual from the set of candidate solutions resulting in the master stage. The main advantage of using a fitness function instead of the original objective function is that it aids the proposed optimizer in exploring unfeasible regions in search of global optimal solutions in the promissory and unexplored feasible areas of the solution space [ 44 , 45 ].…”
Section: Methodology Proposedmentioning
confidence: 99%
“…To guarantee all constraints that comprise the problem studied here, we used the fitness function (FF) presented in Equation (12). It is important to mention that a fitness function is a common adaptation of the objective function used when working with metaheuristic techniques and should be evaluated using the constraints for each individual proposed by the master stage [24,25]. The implementation of a fitness function (instead of the original objective function) allows efficient exploration and exploitation of the solution space by the algorithm, since exploring not-feasible regions increases the chances of finding a solution of good quality, by reducing processing times in the majority of the cases [26,27].…”
Section: Mathematical Formulationmentioning
confidence: 99%