12,923 research outputs found
Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation
Combinatorial interaction testing is an important software testing technique
that has seen lots of recent interest. It can reduce the number of test cases
needed by considering interactions between combinations of input parameters.
Empirical evidence shows that it effectively detects faults, in particular, for
highly configurable software systems. In real-world software testing, the input
variables may vary in how strongly they interact, variable strength
combinatorial interaction testing (VS-CIT) can exploit this for higher
effectiveness. The generation of variable strength test suites is a
non-deterministic polynomial-time (NP) hard computational problem
\cite{BestounKamalFuzzy2017}. Research has shown that stochastic
population-based algorithms such as particle swarm optimization (PSO) can be
efficient compared to alternatives for VS-CIT problems. Nevertheless, they
require detailed control for the exploitation and exploration trade-off to
avoid premature convergence (i.e. being trapped in local optima) as well as to
enhance the solution diversity. Here, we present a new variant of PSO based on
Mamdani fuzzy inference system
\cite{Camastra2015,TSAKIRIDIS2017257,KHOSRAVANIAN2016280}, to permit adaptive
selection of its global and local search operations. We detail the design of
this combined algorithm and evaluate it through experiments on multiple
synthetic and benchmark problems. We conclude that fuzzy adaptive selection of
global and local search operations is, at least, feasible as it performs only
second-best to a discrete variant of PSO, called DPSO. Concerning obtaining the
best mean test suite size, the fuzzy adaptation even outperforms DPSO
occasionally. We discuss the reasons behind this performance and outline
relevant areas of future work.Comment: 21 page
Optimization of Test Data for Basis Path Testing using Artificial Intelligence Techniques
Software testing is a process carried out with the intent of finding errors. This helps in analyzing the stability and quality of a software. Stability and quality can be achieved by suitable test data. Test data can be generated either manually or by automated process. Manual generation of test data is a difficult task. It involves lot of effort due to presence of huge number of predicate nodes in a module. In this report, an automated process is proposed for test data generation in traditional methodology for the automatically constructed control flow graph. Code Coverage is a measure used in software testing process and is one of the key indicators of software quality. It helps the tester in evaluating the effectiveness of testing. It is achieved by automatically generating test data for various functions. Code coverage is not a method or a test; it is a measure which helps in improving software reliability. Effort has been made to gather code coverage information either by source code or by the requirements specified by the customer. But less attention has been paid to achieve better coverage. This report also emphasizes on code coverage, achieved through the test data generated, using some soft computing techniques. Here, three soft computing techniques such as Genetic algorithm, Particle swarm optimization and the Clonal selection algorithm techniques have been deployed for automatic test data generation. This test data was in turn used for code coverage analysis. Experimental results show that the test data generated using Clonal selection algorithm was much more effective in achieving better code coverage over Genetic algorithm and Particle swarm optimization
Optimizing Engagement Simulations Through the Advanced Framework for Simulation, Integration, and Modeling (AFSIM) Software
The ability to effectively model and simulate military missions holds the potential to save lives, money, and resources for the United States. The Advanced Framework for Simulation, Integration, and Modeling (AFSIM) software is a tool used to rapidly simulate and model new technologies and mission level scenarios. In this thesis, our objective is to integrate a closed loop optimization routine with AFSIM to identify an effective objective function to assess optimal inputs for engagement scenarios. Given the many factors which impact a mission level engagement, we developed a tool which interfaces with AFSIM to observe the effects from multiple inputs in an engagement scenario. Our tool operates under the assumption that simulation results have met an acceptable convergence threshold. The objective function evaluates the effectiveness and associated cost with a scenario using a genetic algorithm and a particle swarm optimization algorithm. From this, a statistical analysis was performed to assess risk from the distribution of effectiveness and cost at each point. The method allows an optimal set of inputs to be selected for a desired result from the selected engagement scenario.No embargoAcademic Major: Mechanical Engineerin
The SOS Platform: Designing, Tuning and Statistically Benchmarking Optimisation Algorithms
open access articleWe present Stochastic Optimisation Software (SOS), a Java platform facilitating the algorithmic design process and the evaluation of metaheuristic optimisation algorithms. SOS reduces the burden of coding miscellaneous methods for dealing with several bothersome and time-demanding tasks such as parameter tuning, implementation of comparison algorithms and testbed problems, collecting and processing data to display results, measuring algorithmic overhead, etc. SOS provides numerous off-the-shelf methods including: (1) customised implementations of statistical tests, such as the Wilcoxon rank-sum test and the Holm–Bonferroni procedure, for comparing the performances of optimisation algorithms and automatically generating result tables in PDF and formats; (2) the implementation of an original advanced statistical routine for accurately comparing couples of stochastic optimisation algorithms; (3) the implementation of a novel testbed suite for continuous optimisation, derived from the IEEE CEC 2014 benchmark, allowing for controlled activation of the rotation on each testbed function. Moreover, we briefly comment on the current state of the literature in stochastic optimisation and highlight similarities shared by modern metaheuristics inspired by nature. We argue that the vast majority of these algorithms are simply a reformulation of the same methods and that metaheuristics for optimisation should be simply treated as stochastic processes with less emphasis on the inspiring metaphor behind them
Generating Interpretable Fuzzy Controllers using Particle Swarm Optimization and Genetic Programming
Autonomously training interpretable control strategies, called policies,
using pre-existing plant trajectory data is of great interest in industrial
applications. Fuzzy controllers have been used in industry for decades as
interpretable and efficient system controllers. In this study, we introduce a
fuzzy genetic programming (GP) approach called fuzzy GP reinforcement learning
(FGPRL) that can select the relevant state features, determine the size of the
required fuzzy rule set, and automatically adjust all the controller parameters
simultaneously. Each GP individual's fitness is computed using model-based
batch reinforcement learning (RL), which first trains a model using available
system samples and subsequently performs Monte Carlo rollouts to predict each
policy candidate's performance. We compare FGPRL to an extended version of a
related method called fuzzy particle swarm reinforcement learning (FPSRL),
which uses swarm intelligence to tune the fuzzy policy parameters. Experiments
using an industrial benchmark show that FGPRL is able to autonomously learn
interpretable fuzzy policies with high control performance.Comment: Accepted at Genetic and Evolutionary Computation Conference 2018
(GECCO '18
- …