1,617 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
Integration of solar energy and optimized economic dispatch using genetic algorithm: A case-study of Abu Dhabi
© 2017 IEEE. The United Arab Emirates is focusing on cultivating Renewable Energy (RE) to meet its growing power demand. This also brings power planning to the forefront in regards to keen interests in renewable constrained economic dispatch. This paper takes note of UAE's vision in incorporating a better energy mix of Renewable Energy (RE), nuclear, hybrid system along with the existing power plants mostly utilizing natural gas; with further attention for a sound economic dispatch scenario. The paper describes economic dispatch and delves into the usage of Genetic Algorithm to optimize the proposed system of thermal plants and solar systems. The paper explains the problem formulation, describes the system used, and illustrates the results achieved. The aim of the research is in line with the objective function to minimize the total costs of production and to serve the purpose of integrating renewable energy into the traditional power production in UAE. The generation mix scenarios are assessed using genetic algorithm using MATLAB simulation for the optimization problem
Efficient Real-time Path Planning with Self-evolving Particle Swarm Optimization in Dynamic Scenarios
Particle Swarm Optimization (PSO) has demonstrated efficacy in addressing
static path planning problems. Nevertheless, such application on dynamic
scenarios has been severely precluded by PSO's low computational efficiency and
premature convergence downsides. To address these limitations, we proposed a
Tensor Operation Form (TOF) that converts particle-wise manipulations to tensor
operations, thereby enhancing computational efficiency. Harnessing the
computational advantage of TOF, a variant of PSO, designated as Self-Evolving
Particle Swarm Optimization (SEPSO) was developed. The SEPSO is underpinned by
a novel Hierarchical Self-Evolving Framework (HSEF) that enables autonomous
optimization of its own hyper-parameters to evade premature convergence.
Additionally, a Priori Initialization (PI) mechanism and an Auto Truncation
(AT) mechanism that substantially elevates the real-time performance of SEPSO
on dynamic path planning problems were introduced. Comprehensive experiments on
four widely used benchmark optimization functions have been initially conducted
to corroborate the validity of SEPSO. Following this, a dynamic simulation
environment that encompasses moving start/target points and dynamic/static
obstacles was employed to assess the effectiveness of SEPSO on the dynamic path
planning problem. Simulation results exhibit that the proposed SEPSO is capable
of generating superior paths with considerably better real-time performance (67
path planning computations per second in a regular desktop computer) in
contrast to alternative methods. The code of this paper can be accessed here.Comment: 10 pages, 7 figures, 10 table
Penguins Search Optimisation Algorithm for Association Rules Mining
Association Rules Mining (ARM) is one of the most popular and well-known approaches for the decision-making process. All existing ARM algorithms are time consuming and generate a very large number of association rules with high overlapping. To deal with this issue, we propose a new ARM approach based on penguins search optimisation algorithm (Pe-ARM for short). Moreover, an efficient measure is incorporated into the main process to evaluate the amount of overlapping among the generated rules. The proposed approach also ensures a good diversification over the whole solutions space. To demonstrate the effectiveness of the proposed approach, several experiments have been carried out on different datasets and specifically on the biological ones. The results reveal that the proposed approach outperforms the well-known ARM algorithms in both execution time and solution quality
A Global Optimisation Toolbox for Massively Parallel Engineering Optimisation
A software platform for global optimisation, called PaGMO, has been developed
within the Advanced Concepts Team (ACT) at the European Space Agency, and was
recently released as an open-source project. PaGMO is built to tackle
high-dimensional global optimisation problems, and it has been successfully
used to find solutions to real-life engineering problems among which the
preliminary design of interplanetary spacecraft trajectories - both chemical
(including multiple flybys and deep-space maneuvers) and low-thrust (limited,
at the moment, to single phase trajectories), the inverse design of
nano-structured radiators and the design of non-reactive controllers for
planetary rovers. Featuring an arsenal of global and local optimisation
algorithms (including genetic algorithms, differential evolution, simulated
annealing, particle swarm optimisation, compass search, improved harmony
search, and various interfaces to libraries for local optimisation such as
SNOPT, IPOPT, GSL and NLopt), PaGMO is at its core a C++ library which employs
an object-oriented architecture providing a clean and easily-extensible
optimisation framework. Adoption of multi-threaded programming ensures the
efficient exploitation of modern multi-core architectures and allows for a
straightforward implementation of the island model paradigm, in which multiple
populations of candidate solutions asynchronously exchange information in order
to speed-up and improve the optimisation process. In addition to the C++
interface, PaGMO's capabilities are exposed to the high-level language Python,
so that it is possible to easily use PaGMO in an interactive session and take
advantage of the numerous scientific Python libraries available.Comment: To be presented at 'ICATT 2010: International Conference on
Astrodynamics Tools and Techniques
A Survey on Underwater Acoustic Sensor Network Routing Protocols
Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research
- …