932 research outputs found
A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring
The Artificial Bee Colony (ABC) is the name of an optimization algorithm that
was inspired by the intelligent behavior of a honey bee swarm. It is widely
recognized as a quick, reliable, and efficient methods for solving optimization
problems. This paper proposes a hybrid ABC (HABC) algorithm for graph
3-coloring, which is a well-known discrete optimization problem. The results of
HABC are compared with results of the well-known graph coloring algorithms of
today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of
the traditional evolutionary algorithm with SAW method (EA-SAW). Extensive
experimentations has shown that the HABC matched the competitive results of the
best graph coloring algorithms, and did better than the traditional heuristics
EA-SAW when solving equi-partite, flat, and random generated medium-sized
graphs
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
Hybrid Artificial Bee Colony and Improved Simulated Annealing for the Capacitated Vehicle Routing Problem
Capacitated Vehicle Routing Problem (CVRP) is a type of NP-Hard combinatorial problem that requires a high computational process. In the case of CVRP, there is an additional constraint in the form of a capacity limit owned by the vehicle, so the complexity of the problem from CVRP is to find the optimum route pattern for minimizing travel costs which are also adjusted to customer demand and vehicle capacity for distribution. One method of solving CVRP can be done by implementing a meta-heuristic algorithm. In this research, two meta-heuristic algorithms have been hybridized: Artificial Bee Colony (ABC) with Improved Simulated Annealing (SA). The motivation behind this idea is to complete the excess and the lack of two algorithms when exploring and exploiting the optimal solution. Hybridization is done by running the ABC algorithm, and then the output solution at this stage will be used as an initial solution for the Improved SA method. Parameter testing for both methods has been carried out to produce an optimal solution. In this study, the test was carried out using the CVRP benchmark dataset generated by Augerat (Dataset 1) and the recent CVRP dataset from Uchoa (Dataset 2). The result shows that hybridizing the ABC algorithm and Improved SA could provide a better solution than the basic ABC without hybridization
Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing
Grid computing is a distributed system with heterogeneous infrastructures. Resource
management system (RMS) is one of the most important components which has great influence on the grid computing performance. The main part of RMS is the scheduler algorithm which has the responsibility to map submitted tasks to available resources. The complexity of scheduling problem is considered as a nondeterministic polynomial complete (NP-complete) problem and therefore, an intelligent algorithm is required to achieve better scheduling solution. One of the prominent intelligent algorithms is ant colony system (ACS) which is implemented widely to solve various types of scheduling problems. However, ACS suffers from stagnation problem in medium and large size grid computing system. ACS is based on exploitation and exploration
mechanisms where the exploitation is sufficient but the exploration has a deficiency. The exploration in ACS is based on a random approach without any strategy. This study proposed four hybrid algorithms between ACS, Genetic Algorithm (GA), and Tabu Search (TS) algorithms to enhance the ACS performance. The algorithms are ACS(GA), ACS+GA, ACS(TS), and ACS+TS. These proposed hybrid algorithms
will enhance ACS in terms of exploration mechanism and solution refinement by
implementing low and high levels hybridization of ACS, GA, and TS algorithms. The proposed algorithms were evaluated against twelve metaheuristic algorithms in static (expected time to compute model) and dynamic (distribution pattern) grid computing
environments. A simulator called ExSim was developed to mimic the static and dynamic nature of the grid computing. Experimental results show that the proposed algorithms outperform ACS in terms of best makespan values. Performance of ACS(GA), ACS+GA, ACS(TS), and ACS+TS are better than ACS by 0.35%, 2.03%, 4.65% and 6.99% respectively for static environment. For dynamic environment,
performance of ACS(GA), ACS+GA, ACS+TS, and ACS(TS) are better than ACS by 0.01%, 0.56%, 1.16%, and 1.26% respectively. The proposed algorithms can be used to schedule tasks in grid computing with better performance in terms of makespan
Recommended from our members
A comparison of general-purpose optimization algorithms forfinding optimal approximate experimental designs
Several common general purpose optimization algorithms are compared for findingA- and D-optimal designs for different types of statistical models of varying complexity,including high dimensional models with five and more factors. The algorithms of interestinclude exact methods, such as the interior point method, the Nelder–Mead method, theactive set method, the sequential quadratic programming, and metaheuristic algorithms,such as particle swarm optimization, simulated annealing and genetic algorithms.Several simulations are performed, which provide general recommendations on theutility and performance of each method, including hybridized versions of metaheuristicalgorithms for finding optimal experimental designs. A key result is that general-purposeoptimization algorithms, both exact methods and metaheuristic algorithms, perform wellfor finding optimal approximate experimental designs
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
Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction
Over the past decades, the Least Squares Support Vector Machines (LSSVM) has been widely utilized in prediction task of various application domains. Nevertheless, existing literature showed that the capability of LSSVM is highly dependent on the value of its hyper-parameters, namely regularization parameter and kernel parameter, where this would greatly affect the generalization of LSSVM in prediction task. This study proposed a hybrid algorithm, based on Artificial Bee Colony (ABC) and LSSVM, that consists of three algorithms; ABC-LSSVM, lvABC-LSSVM and cmABC-LSSVM. The lvABC algorithm is introduced to overcome the local optima problem by enriching the searching behaviour using Levy mutation. On the other
hand, the cmABC algorithm that incorporates conventional mutation addresses the over-
fitting or under-fitting problem. The combination of lvABC and cmABC algorithm, which is later introduced as Enhanced Artificial Bee Colony–Least Squares Support Vector Machine (eABC-LSSVM), is realized in prediction of non
renewable natural resources commodity price. Upon the completion of data collection and data pre processing, the eABC-LSSVM algorithm is designed and developed. The predictability of eABC-LSSVM is measured based on five statistical
metrics which include Mean Absolute Percentage Error (MAPE), prediction accuracy, symmetric MAPE (sMAPE), Root Mean Square Percentage Error
(RMSPE) and Theils’ U. Results showed that the eABC-LSSVM possess lower prediction error rate as compared to eight hybridization models of LSSVM and Evolutionary Computation (EC) algorithms. In addition, the proposed algorithm is compared to single prediction techniques, namely, Support Vector Machines (SVM) and Back Propagation Neural Network (BPNN). In general, the eABC-LSSVM produced more than 90% prediction accuracy. This indicates that the proposed eABC-LSSVM is capable of solving optimization problem, specifically in the
prediction task. The eABC-LSSVM is hoped to be useful to investors and commodities traders in planning their investment and projecting their profit
- …