A Multi-Objective Approach for Test Suite Reduction During Testing of Web Applications

2021 ◽  
Vol 12 (3) ◽  
pp. 81-122
Author(s):  
Munish Khanna ◽  
Naresh Chauhan ◽  
Dilip Kumar Sharma ◽  
Law Kumar Singh
Keyword(s):  
Genetic Algorithm ◽  
Web Applications ◽  
State Of The Art ◽  
Test Suite ◽  
Test Cases ◽  
Nsga Ii ◽  
Multi Objective ◽  
Reduction Problem ◽  
Test Suite Reduction ◽  
Experimental Findings

During the development and maintenance phases of evolving software, new test cases would be needed for the verification of the accuracy of the modifications as well as for new functionalities leading to an increase in the size of the test suite. Various related objectives are to be kept in mind while reducing the original test suite by removing redundancy and generating a practical representative set of the unique test cases, some of which may need to be maximized and the remaining ones minimized. This paper presents a multi-objective approach for the test suite reduction problem in which one objective is to be minimized and the remaining two maximized. In this study, experiments were performed on diverse versions of four web applications. Various state-of-the-art algorithms and their updated versions were compared with non-dominated sorting genetic algorithm-II (NSGA-II) for performance evaluation. Based on experimental findings, it was concluded that NSGA-II outperforms all other algorithms; moreover, the algorithm attempts to satisfy all the objectives without compromising coverage.

Comparison of Multi-Objective Evolutionary Algorithms to Prioritize Regression Test Cases

2021 ◽  
Vol 9 (12) ◽  
pp. 1445-1454
Keyword(s):  
Fault Detection ◽  
Evolutionary Algorithms ◽  
Fitness Function ◽  
Optimal Solution ◽  
Test Suite ◽  
Test Case ◽  
Test Cases ◽  
Nsga Ii ◽  
Multi Objective ◽  
Regression Test

Regression testing is one of the most critical testing activities among software product verification activities. Nevertheless, resources and time constraints could inhibit the execution of a full regression test suite, hence leaving us in confusion on what test cases to run to preserve the high quality of software products. Different techniques can be applied to prioritize test cases in resource-constrained environments, such as manual selection, automated selection, or hybrid approaches. Different Multi-Objective Evolutionary Algorithms (MOEAs) have been used in this domain to find an optimal solution to minimize the cost of executing a regression test suite while obtaining maximum fault detection coverage as if the entire test suite was executed. MOEAs achieve this by selecting set of test cases and determining the order of their execution. In this paper, three Multi Objective Evolutionary Algorithms, namely, NSGA-II, IBEA and MoCell are used to solve test case prioritization problems using the fault detection rate and branch coverage of each test case. The paper intends to find out what’s the most effective algorithm to be used in test cases prioritization problems, and which algorithm is the most efficient one, and finally we examined if changing the fitness function would impose a change in results. Our experiment revealed that NSGA-II is the most effective and efficient MOEA; moreover, we found that changing the fitness function caused a significant reduction in evolution time, although it did not affect the coverage metric.

scholarly journals Assessing a Multi-Objective Genetic Algorithm with a Simulated Environment for Energy-Saving of Air Conditioning Systems with User Preferences

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 344
Author(s):  
Alejandro Humberto García Ruiz ◽  
Salvador Ibarra Martínez ◽  
José Antonio Castán Rocha ◽  
Jesús David Terán Villanueva ◽  
Julio Laria Menchaca ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Energy Consumption ◽  
Energy Saving ◽  
User Satisfaction ◽  
Air Conditioning ◽  
State Of The Art ◽  
User Preferences ◽  
The State ◽  
Nsga Ii ◽  
Air Conditioning System

Electricity is one of the most important resources for the growth and sustainability of the population. This paper assesses the energy consumption and user satisfaction of a simulated air conditioning system controlled with two different optimization algorithms. The algorithms are a genetic algorithm (GA), implemented from the state of the art, and a non-dominated sorting genetic algorithm II (NSGA II) proposed in this paper; these algorithms control an air conditioning system considering user preferences. It is worth noting that we made several modifications to the objective function’s definition to make it more robust. The energy-saving optimization is essential to reduce CO2 emissions and economic costs; on the other hand, it is desirable for the user to feel comfortable, yet it will entail a higher energy consumption. Thus, we integrate user preferences with energy-saving on a single weighted function and a Pareto bi-objective problem to increase user satisfaction and decrease electrical energy consumption. To assess the experimentation, we constructed a simulator by training a backpropagation neural network with real data from a laboratory’s air conditioning system. According to the results, we conclude that NSGA II provides better results than the state of the art (GA) regarding user preferences and energy-saving.

scholarly journals Analisis Perbandingan Aggregat Of Function (AOF) dengan Non-Dominated Sorting Genetic Algorithm (NSGA-II) dalam Menentukan Optimasi Multi-Objective pada Penjadwalan Mesin Produksi Flow Shop

2018 ◽  
Vol 17 (2) ◽  
pp. 158
Author(s):  
Fifin Sonata ◽  
Dede Prabowo Wiguna
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Total Tardiness ◽  
Pareto Optimal ◽  
Nsga Ii ◽  
Trade Off ◽  
Multi Objective

Penjadwalan mesin produksi dalam dunia industri memiliki peranan penting sebagai bentuk pengambilan keputusan. Salah satu jenis sistem penjadwalan mesin produksi adalah sistem penjadwalan mesin produksi tipe flow shop. Dalam penjadwalan flow shop, terdapat sejumlah pekerjaan (job) yang tiap-tiap job memiliki urutan pekerjaan mesin yang sama. Optimasi penjadwalan mesin produksi flow shop berkaitan dengan penyusunan penjadwalan mesin yang mempertimbangkan 2 objek yaitu makespan dan total tardiness. Optimasi kedua permasalahan tersebut merupakan optimasi yang bertolak belakang sehingga diperlukan model yang mengintegrasikan permasalahan tersebut dengan optimasi multi-objective A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimazitaion : NSGA-II. Dalam penelitian ini akan dibandingkan 2 buah metode yaitu Aggregat Of Function (AOF) dengan NSGA-II agar dapat terlihat nilai solusinya. Penyelesaian penjadwalan mesin produksi flow shop dengan algoritma NSGA-II untuk membangun jadwal dengan meminimalkan makespan dan total tardiness.Tujuan yang ingin dicapai adalah mengetahui bahwa model yang dikembangkan akan memberikan solusi penjadwalan mesin produksi flow shop yang efisien berupa solusi pareto optimal yang dapat memberikan sekumpulan solusi alternatif bagi pengambil keputusan dalam membuat penjadwalan mesin produksi yang diharapkan. Solusi pareto optimal yang dihasilkan merupakan solusi optimasi multi-objective yang optimal dengan trade-off terhadap seluruh objek, sehingga seluruh solusi pareto optimal sama baiknya.

Kinematic Multi-Objective Optimization of Circular-Toothed Gerotor Pumps by Genetic Algorithm

2017 ◽  
Author(s):  
Andrew J. Robison ◽  
Andrea Vacca
Keyword(s):  
Genetic Algorithm ◽  
Design Method ◽  
Third Party ◽  
Low Flow ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Generation Algorithm ◽  
Multi Objective ◽  
Pareto Curve

A gerotor gear generation algorithm has been developed that evaluates key performance objective functions to be minimized or maximized, and then an optimization algorithm is applied to determine the best design. Because of their popularity, circular-toothed gerotors are the focus of this study, and future work can extend this procedure to other gear forms. Parametric equations defining the circular-toothed gear set have been derived and implemented. Two objective functions were used in this kinematic optimization: maximize the ratio of displacement to pump radius, which is a measure of compactness, and minimize the kinematic flow ripple, which can have a negative effect on system dynamics and could be a major source of noise. Designs were constrained to ensure drivability, so the need for additional synchronization gearing is eliminated. The NSGA-II genetic algorithm was then applied to the gear generation algorithm in modeFRONTIER, a commercial software that integrates multi-objective optimization with third-party engineering software. A clear Pareto front was identified, and a multi-criteria decision-making genetic algorithm was used to select three optimal designs with varying priorities of compactness vs low flow variation. In addition, three pumps used in industry were scaled and evaluated with the gear generation algorithm for comparison. The scaled industry pumps were all close to the Pareto curve, but the optimized designs offer a slight kinematic advantage, which demonstrates the usefulness of the proposed gerotor design method.

Synthesis of LC-Oscillators Using Rival Multi-Objective Multi-Constraint Optimization Kernels

2015 ◽  
pp. 1-27 ◽  
Author(s):  
Ricardo Póvoa ◽  
Ricardo Lourenço ◽  
Nuno Lourenço ◽  
António Canelas ◽  
Ricardo Martins ◽  
...  
Keyword(s):  
Design Automation ◽  
State Of The Art ◽  
Voltage Controlled Oscillator ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective ◽  
Lc Oscillator ◽  
Lc Oscillators ◽  
Statistical Results ◽  
Multiple Synthesis

This chapter presents a state-of-the-art multi-objective/multi-constraint design automation approach applied to the design of an LC-Voltage Controlled Oscillator and an LC-Oscillator for a 130 nm technology node and leading to sets of design solutions showing figures-of-merit around -192 dBc/Hz and -186 dBc/Hz, respectively. The proposed approach, implemented in AIDA-C, guarantees accuracy by using commercial circuit simulators (HSPICE® and ELDO®) to evaluate the performance of the tentative circuit solutions, where the number of time-consuming circuit simulations is efficiently pruned by the optimization kernel. Three multi-objective optimization algorithms, the NSGA-II, the MOPSO, and the MOSA, are experimented with in the synthesis of the quoted oscillators and compared in terms of performance using statistical results obtained from multiple synthesis runs for each one of the oscillators. The performance of the optimized oscillators is then compared to other state-of-the-art results, showing the benefits of the presented multi-objective design approach.

An Effective Approach to Test Suite Reduction and Fault Detection Using Data Mining Techniques

2017 ◽  
Vol 8 (4) ◽  
pp. 1-31 ◽  
Author(s):  
B. Subashini ◽  
D. Jeya Mala
Keyword(s):  
Data Mining ◽  
Attribute Reduction ◽  
Test Suite ◽  
Test Cases ◽  
Data Mining Techniques ◽  
Coverage Analysis ◽  
Quality Product ◽  
Irrelevant Attributes ◽  
Test Suite Reduction ◽  
Using Data

Software testing is used to find bugs in the software to provide a quality product to the end users. Test suites are used to detect failures in software but it may be redundant and it takes a lot of time for the execution of software. In this article, an enormous number of test cases are created using combinatorial test design algorithms. Attribute reduction is an important preprocessing task in data mining. Attributes are selected by removing all weak and irrelevant attributes to reduce complexity in data mining. After preprocessing, it is not necessary to test the software with every combination of test cases, since the test cases are large and redundant, the healthier test cases are identified using a data mining techniques algorithm. This is healthier and the final test suite will identify the defects in the software, it will provide better coverage analysis and reduces execution time on the software.

scholarly journals A Novel Multi-Objective Five-Elements Cycle Optimization Algorithm

Algorithms ◽  
2019 ◽  
Vol 12 (11) ◽  
pp. 244 ◽  
Author(s):  
Chunling Ye ◽  
Zhengyan Mao ◽  
Mandan Liu
Keyword(s):  
Optimization Algorithm ◽  
Test Suite ◽  
Nsga Ii ◽  
Pareto Solution ◽  
Multi Objective ◽  
Chinese Traditional Culture ◽  
Knee Point ◽  
Five Elements ◽  
Fish Group ◽  
The Individual

Inspired by the mechanism of generation and restriction among five elements in Chinese traditional culture, we present a novel Multi-Objective Five-Elements Cycle Optimization algorithm (MOFECO). During the optimization process of MOFECO, we use individuals to represent the elements. At each iteration, we first divide the population into several cycles, each of which contains several individuals. Secondly, for every individual in each cycle, we judge whether to update it according to the force exerted on it by other individuals in the cycle. In the case of an update, a local or global update is selected by a dynamically adjustable probability P s ; otherwise, the individual is retained. Next, we perform combined mutation operations on the updated individuals, so that a new population contains both the reserved and updated individuals for the selection operation. Finally, the fast non-dominated sorting method is adopted on the current population to obtain an optimal Pareto solution set. The parameters’ comparison of MOFECO is given by an experiment and also the performance of MOFECO is compared with three classic evolutionary algorithms Non-dominated Sorting Genetic Algorithm II (NSGA-II), Multi-Objective Particle Swarm Optimization algorithm (MOPSO), Pareto Envelope-based Selection Algorithm II (PESA-II) and two latest algorithms Knee point-driven Evolutionary Algorithm (KnEA) and Non-dominated Sorting and Local Search (NSLS) on solving test function sets Zitzler et al’s Test suite (ZDT), Deb et al’s Test suite (DTLZ), Walking Fish Group (WFG) and Many objective Function (MaF). The experimental results indicate that the proposed MOFECO can approach the true Pareto-optimal front with both better diversity and convergence compared to the five other algorithms.

Solving Facility Location Problems with a Tol for Rapid Development of Multi-Objective Evolutionary Algorithms (MOEAs)

2007 ◽  
pp. 642-660
Author(s):  
A. L. Medaglia
Keyword(s):  
Genetic Algorithm ◽  
Facility Location ◽  
Rapid Development ◽  
Service Level ◽  
International Markets ◽  
Nsga Ii ◽  
Multi Objective ◽  
Location Models ◽  
Cost Cutting ◽  
Facility Location Models

The low price of coffee in the international markets has forced the Federación Nacional de Cafeteros de Colombia (FNCC) to look for cost-cutting opportunities. An alternative that has been considered is the reduction of the operating infrastructure by closing some of the FNCC-owned depots. This new proposal of the coffee supplier network is supported by (uncapacitated and capacitated) facility location models that minimize operating costs while maximizing service level (coverage). These bi-objective optimization models are solved by means of NSGA II, a multi-objective evolutionary algorithm (MOEA). From a computational perspective, this chapter presents the multi-objective Java Genetic Algorithm (MO-JGA) framework, a new tool for the rapid development of MOEAs built on top of the Java Genetic Algorithm (JGA). We illustrate MO-JGA by implementing NSGA II-based solutions for the bi-objective location models.

Sign in / Sign up

Export Citation Format

Share Document