Performance analysis of six meta-heuristic algorithms over automated test suite generation for path coverage-based optimization

The paper reviews and introduces the state-of-the-art nature-inspired metaheuristic algorithms in optimization, including Firefly algorithm, PSO algorithms and ABC algorithm. By implementing these algorithms in Matlab, we will use worked examples to show how each algorithm works. Firefly algorithm is one of the evolutionary optimization algorithms, and is inspired by the flashing behaviour of fireflies in nature. There are many noisy non-linear mathematical optimization problems that can be effectively solved by Metaheuristic Algorithms. Mathematical optimization or programming is the study of such planning and design problems using mathematical tools. Nowadays, computer simulations become an indispensable tool for solving such optimization problems with various efficient search algorithms. Nature-inspired algorithms are among the most powerful algorithms for optimization. Firefly algorithm is one of the new metaheuristic algorithms for optimization problems. The algorithm is inspired by the flashing behaviour of fireflies. A Firefly Algorithm (FA) is a recent nature inspired optimization algorithm, which simulates the flash pattern and characteristics of fireflies. It is a powerful swarm intelligence algorithm inspired by the flash phenomenon of the fireflies. In this context, three types of meta-heuristics called Artificial bee Colony algorithm, Particle Swarm Optimization (PSO) and Firefly algorithms were devised to find optimal solutions of noisy non-linear continuous mathematical models. A series of computational experiments using each algorithm were conducted. The stimulation result of this experiment were analyzed and compared to the best solutions found so The Firefly algorithm in each noisy non linear optimization function seems to perform better and efficient.

Complex huge-scale scientific applications are simplified by workflow to execute in the cloud environment. The cloud is an emerging concept that effectively executes workflows, but it has a range of issues that must be addressed for it to progress. Workflow scheduling using a nature-inspired metaheuristic algorithm is a recent central theme in the cloud computing paradigm. It is an NP-complete problem that fascinates researchers to explore the optimum solution using swarm intelligence. This is a wide area where researchers work for a long time to find an optimum solution but due to the lack of actual research direction, their objectives become faint. Our systematic and extensive analysis of scheduling approaches involves recently high-cited metaheuristic algorithms like Genetic Algorithms (GA), Whale Search Algorithm (WSA), Ant Colony Optimization (ACO), Bat Algorithm, Artificial Bee Colony (ABC), Cuckoo Algorithm, Firefly Algorithm and Particle Swarm Optimization (PSO). Based on various parameters, we do not only classify them but also furnish a comprehensive striking comparison among them with the hope that our efforts will assist recent researchers to select an appropriate technique for further undiscovered issues. We also draw the attention of present researchers towards some open issues to dig out unexplored areas like energy consumption, reliability and security for considering them as future research work.

Optimization studies in high speed turning of Ti-6Al-4V

A linear equation is an equation in which each term contains a constant with a variable of degree one or single and can be described as a straight line in a Cartesian coordinate system. A Linear equations system is a collection of several linear equations. A system of linear equations whose coefficients and variables are fuzzy numbers is called a fully fuzzy linear equation system. This study aims to apply a metaheuristic algorithm to solve a system of fully fuzzy linear equations. The objective function used is the minimization objective function. At the same time, the metaheuristic algorithms used in this research are Particle Swarm Optimization (PSO), Firefly Algorithm (FA), and Cuckoo Search (CS). The input in this research is a fully fuzzy linear equation system matrix and parameters of the PSO, FA, and CS algorithms. The resulting output is the best objective function and the variable value of the fully fuzzy linear equations system. The work was compared for accuracy with the Gauss-Jordan elimination method from previous studies with the help of the Matlab programming language. The results obtained indicate that the Particle Swarm Optimization (PSO) algorithm is better at solving fully fuzzy linear equation systems than the Firefly Algorithm (FA) and Cuckoo Search (CS). This case can be seen from the value of the resulting objective function close to the value of the Gauss-Jordan elimination methodKeywords: Mathematics, investation

Hippopotamus algorithm for optimal sizing of hybrid renewable energy system

A novel performance criterion approach to optimum design of PID controller using cuckoo search algorithm for AVR system

There occur frequent requirement changes in software systems even after the software has been developed. Regression testing is continuously performed to identify the undesired affects of these requirement changes on already tested system. Test suites grow enormously with these changes due to addition of new test cases for enhanced functionality. Optimization of test suite to perform regression testing within the budgetary and time restrictions is ultimate choice for a tester because "Retest all" test suite is un-economical and is not suitable choice. Test suite optimization can be either static or on the fly. With on the fly optimization, optimal suite keeps on changing with the requirement changes. On the fly optimization of test suite is preferable option for regression testing. Presently, static test suite optimization approaches exist. We have proposed an application specific, on the fly optimization approach for test suite optimization problem. We have implemented our approach on an academic testing problem. We use fuzzy logic to optimize the test suite with multiple optimization objectives. Our approach has been successful to generate on the fly optimized test suites for changing requirements. In future, we will implement this approach on considerably large sized testing problems.

Nature-inspired meta-heuristic algorithms have proved to be very powerful in solving complex optimisation problems in recent times. The literature reports several inspirations from nature, exploited to solve computational problems. This paper is yet another step in the journey towards the utilisation of natural phenomena for seeking solutions to complex optimisation problems. In this paper, a new meta-heuristic algorithm based on the chirping behaviour of crickets is formulated to solve optimisation problems. It is validated against various benchmark test functions and then compared with popular state-of-the-art optimisation algorithms like genetic algorithm, particle swarm optimisation, bat algorithm, artificial bee colony algorithm and cuckoo search algorithm for performance efficiency. Simulation results show that the proposed algorithm has outperformed its counterparts in terms of speed and accuracy. The implication of the results and suggestions for further research are also discussed.

In recent decades, the brain-computer interface (BCI) has emerged as a leading area of research. The feature selection is vital to reduce the dataset's dimensionality, increase the computing effectiveness, and enhance the BCI's performance. Using activity-related features leads to a high classification rate among the desired tasks. This study presents a wrapper-based metaheuristic feature selection framework for BCI applications using functional near-infrared spectroscopy (fNIRS). Here, the temporal statistical features (i.e., the mean, slope, maximum, skewness, and kurtosis) were computed from all the available channels to form a training vector. Seven metaheuristic optimization algorithms were tested for their classification performance using a k-nearest neighbor-based cost function: particle swarm optimization, cuckoo search optimization, the firefly algorithm, the bat algorithm, flower pollination optimization, whale optimization, and grey wolf optimization (GWO). The presented approach was validated based on an available online dataset of motor imagery (MI) and mental arithmetic (MA) tasks from 29 healthy subjects. The results showed that the classification accuracy was significantly improved by utilizing the features selected from the metaheuristic optimization algorithms relative to those obtained from the full set of features. All of the abovementioned metaheuristic algorithms improved the classification accuracy and reduced the feature vector size. The GWO yielded the highest average classification rates (p < 0.01) of 94.83 ± 5.5%, 92.57 ± 6.9%, and 85.66 ± 7.3% for the MA, MI, and four-class (left- and right-hand MI, MA, and baseline) tasks, respectively. The presented framework may be helpful in the training phase for selecting the appropriate features for robust fNIRS-based BCI applications.

This paper presents design optimization technique of Axial Flux Permanent Magnet (AFPM)Brushless DC (BLDC)micromotor. The objective of the optimization process is to minimize the motor volume and improve joules efficiency with the constraints of minimum required torque and maximum back EMF using response surface modeling and Bat Algorithm (BA). Finite element computations have been used for numerical experiments on geometrical design variables in order to evaluate the coefficients of a second-order empirical model for the response surface representation. BA is used as an optimization technique to minimize volume and improve joules efficiency in separate optimization problem in terms of design variables. The optimization results were compared with other metaheuristic algorithms, including Genetic Algorithms (GA), and Particle Swarm Optimization (PSO). The bat algorithm shows a potential competitive against GA and PSO.

One of the challenging problems in the field of structural engineering is designing cost-efficient structures with improved performance subject to earthquake loading conditions. Structural optimization procedures can be effectively employed for performance-based optimal design of structures. In this study, bat algorithm (BA) is utilized to implement performance-based optimum seismic design of steel dual braced frames for various performance levels. The required structural seismic responses are evaluated by performing nonlinear pushover analysis. The results found by BA are then compared with those of obtained by other popular meta-heuristics such as firefly algorithm (FA) and particle swarm optimization (PSO) to provide an insight about its computational performance. Two numerical examples are presented and the numerical results reveal that the BA outperforms PSO and FA.

This study aimed to extract apigenin and luteolin from celery seeds using 2-hydroxypropyl-β-cyclodextrin (HP-β-CD) based ultrasonic-assisted technique. Optimal extraction conditions were determined through the integration of support vector regression combined with various optimization algorithms, including Genetic Algorithm, Particle Swarm Optimization, Gray Wolf Optimizer, Bat Algorithm, Firefly Algorithm, and Cuckoo Search Algorithm. The identified optimal conditions included an extraction time of 52 min, an HP-β-CD concentration of 24 mg/mL, and a solvent-to-solid ratio of 24 mL/g. Under these conditions, the predicted apigenin and luteolin content in the extract were 0.156 and 0.814 mg/g, respectively, closely aligning with the actual values of 0.158 ± 0.005 mg/g and 0.807 ± 0.008 mg/g. Notably, the HP-β-CD/water extract exhibited significantly higher concentrations of active ingredients and antioxidant activity compared to the water extract, with the content of apigenin and luteolin in the water extract being only 25 and 45%, respectively, compared to the HP-β-CD/water extract. Regarding the antioxidant effect, the water extract displayed a 50% scavenging capacity (SC50) of 331.29 ± 20.5 g/mL, whereas the SC50 for the HP-β-CD/water extract was 89.04 ± 4.70 g/mL. Molecular modeling and IR spectra analysis also suggested the formation of inclusion complexes between HP-β-CD and apigenin/luteolin. These findings suggested that HP-β-CD could be a preferable alternative to conventional solvents due to its advantages, such as easier control, safety, and cost-effectiveness. In addition, the use of support vector regression and nature-inspired optimization algorithms could be promising alternatives to traditional response surface methodology.

Redundant test cases in newly generated test suites often remain undetected until execution and waste scarce project resources. In model-based testing, the testing process starts early on in the developmental phases and enables early fault detection. The redundancy in the test suites generated from models can be detected earlier as well and removed prior to its execution. The article presents a novel model-based test suite optimization technique involving UML activity diagrams by formulating the test suite optimization problem as an Equality Knapsack Problem. The aim here is the development of a test suite optimization framework that could optimize the model-based test suites by removing the redundant test cases. An evolution-based algorithm is incorporated into the framework and is compared with the performances of two other algorithms. An empirical study is conducted with four synthetic and industrial scale Activity Diagram models and results are presented.

Software Testing is an important aspect of the real time software development process. Software testing always assures the quality of software product. As associated with software testing, there are few very important issues where there is a need to pay attention on it in the process of software development test. These issues are generation of effective test case and test suite as well as optimization of test case and suite while doing testing of software product. The important issue is that testing time of the test case and test suite. It is very much important that after development of software product effective testing should be performed. So to overcome these issues of optimization, we have proposed new approach for test suite optimization using genetic algorithm (GA). Genetic algorithm is evolutionary in nature so it is often used for optimization of problem by researcher. In this paper, our aim is to study various selections methods like tournament selection, rank selection and roulette wheel selection and then we apply this genetic algorithm (GA) on various programs which will generate optimized test suite with parameters like fitness value of test case, test suite and take minimum amount of time for execution after certain preset generation. In this paper our main objectives as per the experimental investigation, we show that tournament selection works very fine as compared to other methods with respect fitness selection of test case and test suites, testing time of test case and test suites as well as number of requirements.

The research and development of metaheuristic methods are critical issues in computer science. In the past decade, metaheuristic algorithms have been used in many engineering applications such as optimization of engineering problems, telecommunications, information security, and image processing. Many metaheuristic algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) are recently becoming very popular.There are many studies conducted in the literature on the comparison of PSO with other metaheuristic algorithms. In this chapter, various studies carried out between the years of 2010 and 2020 about the comparison of PSO with the other metaheuristic algorithms will be examined. The metaheuristic algorithms to be considered are simulated annealing (SA), genetic algorithm (GA), differential evolution (DE), ant colony optimization (ACO), artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), tabu search (TS), harmony search (HS), firefly algorithm (FF), cuckoo search (CS), bat-inspired algorithm (BA), water wave optimization (WWO), clonal selection algorithm (CLONALG), chemical reaction optimization (CRO), sine cosine algorithm (SCA), glowworm swarm optimization (GSO), and grey wolf optimizer (GWO). This study aims to evaluate and analyze the covered papers according to several criteria such as (a) rates of studies according to publishing years, (b) the metaheuristic algorithms that are compared to PSO, (c) performance evaluation of compared algorithms, (d) the metaheuristic algorithms with their inspirational approaches and their initial proposed studies and years, (e) the field of subjects where the algorithms are applied in the reviewed studies, and (f) used databases in the examined studies.This study is a comprehensive literature review of the comparison of PSO with the most popular metaheuristic algorithms. The intention of this review is to be useful for researchers who want to conduct a survey on this area of the subject as this chapter will cover the essential and helpful analysis of the related research.