3,195 research outputs found
A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses
In many technical fields, single-objective optimization procedures in
continuous domains involve expensive numerical simulations. In this context, an
improvement of the Artificial Bee Colony (ABC) algorithm, called the Artificial
super-Bee enhanced Colony (AsBeC), is presented. AsBeC is designed to provide
fast convergence speed, high solution accuracy and robust performance over a
wide range of problems. It implements enhancements of the ABC structure and
hybridizations with interpolation strategies. The latter are inspired by the
quadratic trust region approach for local investigation and by an efficient
global optimizer for separable problems. Each modification and their combined
effects are studied with appropriate metrics on a numerical benchmark, which is
also used for comparing AsBeC with some effective ABC variants and other
derivative-free algorithms. In addition, the presented algorithm is validated
on two recent benchmarks adopted for competitions in international conferences.
Results show remarkable competitiveness and robustness for AsBeC.Comment: 19 pages, 4 figures, Springer Swarm Intelligenc
Training a Feed-forward Neural Network with Artificial Bee Colony Based Backpropagation Method
Back-propagation algorithm is one of the most widely used and popular
techniques to optimize the feed forward neural network training. Nature
inspired meta-heuristic algorithms also provide derivative-free solution to
optimize complex problem. Artificial bee colony algorithm is a nature inspired
meta-heuristic algorithm, mimicking the foraging or food source searching
behaviour of bees in a bee colony and this algorithm is implemented in several
applications for an improved optimized outcome. The proposed method in this
paper includes an improved artificial bee colony algorithm based
back-propagation neural network training method for fast and improved
convergence rate of the hybrid neural network learning method. The result is
analysed with the genetic algorithm based back-propagation method, and it is
another hybridized procedure of its kind. Analysis is performed over standard
data sets, reflecting the light of efficiency of proposed method in terms of
convergence speed and rate.Comment: 14 Pages, 11 figure
Multivariate time series analysis for short-term forecasting of ground level ozone (O3) in Malaysia
The declining of air quality mostly affects the elderly, children, people with asthma,
as well as a restriction on outdoor activities. Therefore, there is an importance to
provide a statistical modelling to forecast the future values of surface layer ozone (O3)
concentration. The objectives of this study are to obtain the best multivariate time
series (MTS) model and develop an online air quality forecasting system for O3
concentration in Malaysia. The implementations of MTS model improve the recent
statistical model on air quality for short-term prediction. Ten air quality monitoring
stations situated at four (4) different types of location were selected in this study. The
first type is industrial represent by Pasir Gudang, Perai, and Nilai, second type is urban
represent by Kuala Terengganu, Kota Bharu, and Alor Setar. The third is suburban
located in Banting, Kangar, and Tanjung Malim, also the only background station at
Jerantut. The hourly record data from 2010 to 2017 were used to assess the
characteristics and behaviour of O3 concentration. Meanwhile, the monthly record data
of O3, particulate matter (PM10), nitrogen dioxide (NO2), sulphur dioxide (SO2),
carbon monoxide (CO), temperature (T), wind speed (WS), and relative humidity (RH)
were used to examine the best MTS models. Three methods of MTS namely vector
autoregressive (VAR), vector moving average (VMA), and vector autoregressive
moving average (VARMA), has been applied in this study. Based on the performance
error, the most appropriate MTS model located in Pasir Gudang, Kota Bharu and
Kangar is VAR(1), Kuala Terengganu and Alor Setar for VAR(2), Perai and Nilai for
VAR(3), Tanjung Malim for VAR(4) and Banting for VAR(5). Only Jerantut obtained
the VMA(2) as the best model. The lowest root mean square error (RMSE) and
normalized absolute error is 0.0053 and <0.0001 which is for MTS model in Perai and
Kuala Terengganu, respectively. Meanwhile, for mean absolute error (MAE), the
lowest is in Banting and Jerantut at 0.0013. The online air quality forecasting system
for O3 was successfully developed based on the best MTS models to represent each
monitoring station
Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization
Memetic computation (MC) has emerged recently as a new paradigm of efficient
algorithms for solving the hardest optimization problems. On the other hand,
artificial bees colony (ABC) algorithms demonstrate good performances when
solving continuous and combinatorial optimization problems. This study tries to
use these technologies under the same roof. As a result, a memetic ABC (MABC)
algorithm has been developed that is hybridized with two local search
heuristics: the Nelder-Mead algorithm (NMA) and the random walk with direction
exploitation (RWDE). The former is attended more towards exploration, while the
latter more towards exploitation of the search space. The stochastic adaptation
rule was employed in order to control the balancing between exploration and
exploitation. This MABC algorithm was applied to a Special suite on Large Scale
Continuous Global Optimization at the 2012 IEEE Congress on Evolutionary
Computation. The obtained results the MABC are comparable with the results of
DECC-G, DECC-G*, and MLCC.Comment: CONFERENCE: IEEE Congress on Evolutionary Computation, Brisbane,
Australia, 201
A Comparison of Nature Inspired Algorithms for Multi-threshold Image Segmentation
In the field of image analysis, segmentation is one of the most important
preprocessing steps. One way to achieve segmentation is by mean of threshold
selection, where each pixel that belongs to a determined class islabeled
according to the selected threshold, giving as a result pixel groups that share
visual characteristics in the image. Several methods have been proposed in
order to solve threshold selectionproblems; in this work, it is used the method
based on the mixture of Gaussian functions to approximate the 1D histogram of a
gray level image and whose parameters are calculated using three nature
inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony
Optimization and Differential Evolution). Each Gaussian function approximates
thehistogram, representing a pixel class and therefore a threshold point.
Experimental results are shown, comparing in quantitative and qualitative
fashion as well as the main advantages and drawbacks of each algorithm, applied
to multi-threshold problem.Comment: 16 pages, this is a draft of the final version of the article sent to
the Journa
- …