scholarly journals Test Case Generation for Data Flow Testing using Cuckoo Search Algorithm

2019 ◽  
Vol 8 (2S11) ◽  
pp. 2953-2964

Software testing consumes the major portion of the total efforts required for software development. This activity is very time consuming and labor intensive. It is very hard to do testing in optimal manner. In this paper a new approach is proposed, which uses the nature inspired stochastic algorithm called Cuckoo Search Algorithm (CSA) for the automatic generation of test data for data flow testing. This approach considers all def-use as test adequacy criteria. For assistance to CSA in the state space a new fitness function is also proposed by using the concept of dominator tree and branch distance in a CFG. To validate the proposed approach experiments are carried out on 10 benchmarked programs and findings are contrasted with earlier work done in this domain. Further in order to prove that proposed approach performs better than the above mentioned approaches a statistical difference test (T-test) is also performed.

Energies ◽  
2018 ◽  
Vol 11 (10) ◽  
pp. 2675 ◽  
Author(s):  
Yang Zhang ◽  
Huihui Zhao ◽  
Yuming Cao ◽  
Qinhuo Liu ◽  
Zhanfeng Shen ◽  
...  

The development of remote sensing and intelligent algorithms create an opportunity to include ad hoc technology in the heating route design area. In this paper, classification maps and heating route planning regulations are introduced to create the fitness function. Modifications of ant colony optimization and the cuckoo search algorithm, as well as a hybridization of the two algorithms, are proposed to solve the specific Zhuozhou–Fangshan heating route design. Compared to the fitness function value of the manual route (234.300), the best route selected by modified ant colony optimization (ACO) was 232.343, and the elapsed time for one solution was approximately 1.93 ms. Meanwhile, the best route selected by modified Cuckoo Search (CS) was 244.247, and the elapsed time for one solution was approximately 0.794 ms. The modified ant colony optimization algorithm can find the route with smaller fitness function value, while the modified cuckoo search algorithm can find the route overlapped to the manual selected route better. The modified cuckoo search algorithm runs more quickly but easily sticks into the premature convergence. Additionally, the best route selected by the hybrid ant colony and cuckoo search algorithm is the same as the modified ant colony optimization algorithm (232.343), but with higher efficiency and better stability.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Wentan Jiao ◽  
Wenqing Chen ◽  
Jing Zhang

Image segmentation is an important part of image processing. For the disadvantages of image segmentation under multiple thresholds such as long time and poor quality, an improved cuckoo search (ICS) is proposed for multithreshold image segmentation strategy. Firstly, the image segmentation model based on the maximum entropy threshold is described, and secondly, the cuckoo algorithm is improved by using chaotic initialization population to improve the diversity of solutions, optimizing the step size factor to improve the possibility of obtaining the optimal solution, and using probability to reduce the complexity of the algorithm; finally, the maximum entropy threshold function in image segmentation is used as the individual fitness function of the cuckoo search algorithm for solving. The simulation experiments show that the algorithm has a good segmentation effect under four different thresholding conditions.


2020 ◽  
pp. 107754632095138
Author(s):  
Rosmazi Rosli ◽  
Zamri Mohamed

This article presents a new modified cuckoo search algorithm with dynamic discovery probability and step-size factor for optimizing the Bouc–Wen Model in magnetorheological damper application. The newly proposed algorithm was tested using a set of standard benchmark functions with different searching space and global optima placement. An engineering optimization application was chosen to evaluate the performance of the algorithm in complex engineering applications. The optimization task involved hysteresis parameter identification of the root mean square error between the model and an actual magnetorheological damper. The magnetorheological damper response was chosen as the objective function. The final value of the fitness function and the iteration number it took to converge were used as the qualifying indicator to the proposed cuckoo search algorithm efficiency. A comparison was done against particle swarm optimization, genetic algorithm, and sine–cosine algorithm, where the modified cuckoo search algorithm showed the lowest root mean square error and fastest convergence rate among the three algorithms.


2019 ◽  
Vol 8 (3) ◽  
pp. 6004-6009

There are countless optimization problems that have been accelerated by Nature Inspired Metaheuristic Optimization Algorithms (NIMOA) in the earlier decades. NIMOA have gained huge popularity owing to their effective results. In this study NIMOA namely, Cuckoo Search Algorithm (CSA) is used to prioritize (order) the test cases for Regression Testing (RT). Prioritizations aids in the execution of higher priority test cases to give early fault detection. This research adopts the aggressive approach of reproduction made by Cuckoos to prioritize the test cases for RT. Average Percentage of Fault Detected (APFD) metrics is used in this paper for validations of results. APFD metrics is used to compare the performance of CSA with Flower Pollination Algorithm (FPA) and traditional approaches for Test Case Prioritization (TCP). Two java applications are used for the study. CSA is implemented in Java on eclipse platform. It is learnt from the study that APFD results of CSA outperformed the FPA for both the applications namely Puzzle Game and AreaandPerimeter. It is inferred from the results that prioritized set of test cases given by NIMOA outperformed the APFD results of traditional approaches and also CSA performed better than the FPA for TCP.


Author(s):  
Praveen Ranjan Srivastava ◽  
D. V. Pavan Kumar Reddy ◽  
M. Srikanth Reddy ◽  
Ch. V. B. Ramaraju ◽  
I. Ch. Manikanta Nath

Test Case prioritization consists of proper organization and scheduling of the test cases in a specific sequence. Regression testing is an important issue and concept during software maintenance process, but due to scarcity of resources re-execution of all test cases, is not possible during regression testing. Hence in version or revision specific regression testing, it is more important to execute those test cases that are beneficial. In this chapter, a new prioritization technique is proposed for version specific regression testing using Cuckoo Search Algorithm. This technique prioritizes the test cases based on lines of code where the code is modified.


Author(s):  
Thang Trung Nguyen ◽  
Dieu Ngoc Vo

This chapter proposes a Cuckoo Search Algorithm (CSA) and a Modified Cuckoo Search Algorithm (MCSA) for solving short-term hydrothermal scheduling (ST-HTS) problem. The CSA method is a new meta-heuristic algorithm inspired from the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds of other species for solving optimization problems. In the MCSA method, the eggs are first classified into two groups in which ones with low fitness function are put in top group whereas others with higher fitness function are put in abandoned group. In addition, an updated step size in the MCSA changes and tends to decrease as the iteration increases leading to near global optimal solution. The robustness and effectiveness of the CSA and MCSA are tested on several systems with different objective functions of thermal units. The results obtained by the CSA and MCSA are analyzed and compared have shown that the two methods are favorable for solving short-term hydrothermal scheduling problems.


2018 ◽  
Vol 7 (3.12) ◽  
pp. 300
Author(s):  
K Senthil Kumar ◽  
A Muthukumaravel

Effective functionality checking of any software application is the crucial event that determines the quality of outcome obtained.  Generally, checking scenarios that involves multiple test cases in mixture with multiple components is time consuming and also increases the quality assurance cost. Selection of suitable method/approach for optimization and prioritization of test cases as well as appropriate evaluation of the application would result in reduction of fault detection effort without appreciable information loss and further would also significantly decrease the clearing up cost. In the proposed method, test cases are optimized and then prioritized by Particle Swarm Optimization algorithm (PSO) and Improved Cuckoo Search algorithm (ICSA), respectively. Finally, the result will be evaluated for software quality measures. 


2017 ◽  
Vol 7 (1.2) ◽  
pp. 37
Author(s):  
N. Manoharan ◽  
Subhransu Sekhar Dash ◽  
Raghuraman Sivalingam ◽  
Dheeraj P. R.

This paper presents a one rank cuckoo search optimization technique is proposed to design classical PID Controllers for Automatic Generation Control (AGC) of interconnected power systems. This method is proposed based on the original cuckoo search method. It was found in original cuckoo search the convergence speed is comparative lesser in reaching optimal solutions. To overcome the above mentioned problem one rank cuckoo search algorithm has been proposed which uses a bound by best solution technique to get the valid dimension so as to improve the system performance and rate of convergence. The proposed approach is applied to a four area hydro-thermal system in which area-1 and area-2 are steam reheat power plant and area-3 and area-4 are hydro power plant. The controller gains are derived using original cuckoo search and one rank cuckoo search methods. The superiority of the proposed approach is compared with the results obtained with original cuckoo search algorithm.


Sign in / Sign up

Export Citation Format

Share Document