689 research outputs found
Bat Algorithm: Literature Review and Applications
Bat algorithm (BA) is a bio-inspired algorithm developed by Yang in 2010 and
BA has been found to be very efficient. As a result, the literature has
expanded significantly in the last 3 years. This paper provides a timely review
of the bat algorithm and its new variants. A wide range of diverse applications
and case studies are also reviewed and summarized briefly here. Further
research topics are also discussed.Comment: 10 page
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
A Literature Review of Cuckoo Search Algorithm
Optimization techniques play key role in real world problems. In many situations where decisions are taken based on random search they are used. But choosing optimal Optimization algorithm is a major challenge to the user. This paper presents a review on Cuckoo Search Algorithm which can replace many traditionally used techniques. Cuckoo search uses Levi flight strategy based on Egg laying Radius in deriving the solution specific to problem. CS optimization algorithm increases the efficiency, accuracy, and convergence rate. Different categories of the cuckoo search and several applications of the cuckoo search are reviewed. Keywords: Cuckoo Search Optimization, Applications , Levy Flight DOI: 10.7176/JEP/11-8-01 Publication date:March 31st 202
A Brief Review of Cuckoo Search Algorithm (CSA) Research Progression from 2010 to 2013
Cuckoo Search Algorithm is a new swarm intelligence algorithm which based on
breeding behavior of the Cuckoo bird. This paper gives a brief insight of the advancement of the
Cuckoo Search Algorithm from 2010 to 2013.
The first half of this paper presents the publication trend of Cuckoo Search Algorithm. The
remaining of this paper briefly explains the contribution of the individual publication related to
Cuckoo Search Algorithm. It is believed that this paper will greatly benefit the reader who needs a
bird-eyes view of the Cuckoo Search Algorithm’s publications trend
Cloud Service Selection System Approach based on QoS Model: A Systematic Review
The Internet of Things (IoT) has received a lot of interest from researchers recently. IoT is seen as a component of the Internet of Things, which will include billions of intelligent, talkative "things" in the coming decades. IoT is a diverse, multi-layer, wide-area network composed of a number of network links. The detection of services and on-demand supply are difficult in such networks, which are comprised of a variety of resource-limited devices. The growth of service computing-related fields will be aided by the development of new IoT services. Therefore, Cloud service composition provides significant services by integrating the single services. Because of the fast spread of cloud services and their different Quality of Service (QoS), identifying necessary tasks and putting together a service model that includes specific performance assurances has become a major technological problem that has caused widespread concern. Various strategies are used in the composition of services i.e., Clustering, Fuzzy, Deep Learning, Particle Swarm Optimization, Cuckoo Search Algorithm and so on. Researchers have made significant efforts in this field, and computational intelligence approaches are thought to be useful in tackling such challenges. Even though, no systematic research on this topic has been done with specific attention to computational intelligence. Therefore, this publication provides a thorough overview of QoS-aware web service composition, with QoS models and approaches to finding future aspects
A Hybrid Chimp Optimization Algorithm and Generalized Normal Distribution Algorithm with Opposition-Based Learning Strategy for Solving Data Clustering Problems
This paper is concerned with data clustering to separate clusters based on
the connectivity principle for categorizing similar and dissimilar data into
different groups. Although classical clustering algorithms such as K-means are
efficient techniques, they often trap in local optima and have a slow
convergence rate in solving high-dimensional problems. To address these issues,
many successful meta-heuristic optimization algorithms and intelligence-based
methods have been introduced to attain the optimal solution in a reasonable
time. They are designed to escape from a local optimum problem by allowing
flexible movements or random behaviors. In this study, we attempt to
conceptualize a powerful approach using the three main components: Chimp
Optimization Algorithm (ChOA), Generalized Normal Distribution Algorithm
(GNDA), and Opposition-Based Learning (OBL) method. Firstly, two versions of
ChOA with two different independent groups' strategies and seven chaotic maps,
entitled ChOA(I) and ChOA(II), are presented to achieve the best possible
result for data clustering purposes. Secondly, a novel combination of ChOA and
GNDA algorithms with the OBL strategy is devised to solve the major
shortcomings of the original algorithms. Lastly, the proposed ChOAGNDA method
is a Selective Opposition (SO) algorithm based on ChOA and GNDA, which can be
used to tackle large and complex real-world optimization problems, particularly
data clustering applications. The results are evaluated against seven popular
meta-heuristic optimization algorithms and eight recent state-of-the-art
clustering techniques. Experimental results illustrate that the proposed work
significantly outperforms other existing methods in terms of the achievement in
minimizing the Sum of Intra-Cluster Distances (SICD), obtaining the lowest
Error Rate (ER), accelerating the convergence speed, and finding the optimal
cluster centers.Comment: 48 pages, 14 Tables, 12 Figure
- …