Abstract: This study presents a modified version of the artificial bee colony (ABC) algorithm by including a local search technique for solving the non-convex economic power dispatch problem. The local search step is incorporated at the end of each iteration. Total system losses, valve-point loading effects and prohibited operating zones have been incorporated in the problem formulation. Thus, the problem becomes highly nonlinear and with discontinuous objective function. The proposed technique is validated using an IEEE benchmark system with ten thermal units. Simulation results demonstrate that the proposed optimization algorithm has better convergence characteristics in comparison with the original ABC algorithm.
Abstract: Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem and it is quite difficult to find an optimal solution consisting of a set of routes for vehicles whose total cost is minimum. Evolutionary and swarm intelligent (SI) algorithms play a vital role in solving optimization problems. While the SI algorithms perform search, the diversity between the solutions they exploit is very important. This is because of the need to avoid early convergence and to get an appropriate balance between the exploration and exploitation. Therefore, it is important to check how far the solutions are diverse. In this paper, we measure the similarity between solutions, which ABC exploits while optimizing VRP. The similar solutions found are discarded at the end of the iteration and only unique solutions are passed on to the next iteration. The bees of discarded solutions become scouts and they start searching for new solutions. This process is continued and results show that the solution is optimized at lesser number of iterations but with the overhead of computing similarity in all the iterations. The problem instance from Solomon benchmarked dataset has been used for evaluating the presented methodology.
Abstract: This paper presents the three optimization models, namely New Binary Artificial Bee Colony (NBABC) algorithm, NBABC with Local Search (NBABC-LS), and NBABC with Genetic Crossover (NBABC-GC) for solving the Wind-Thermal Unit Commitment (WTUC) problem. The uncertain nature of the wind power is incorporated using the Weibull probability density function, which is used to calculate the overestimation and underestimation costs associated with the wind power fluctuation. The NBABC algorithm utilizes a mechanism based on the dissimilarity measure between binary strings for generating the binary solutions in WTUC problem. In NBABC algorithm, an intelligent scout bee phase is proposed that replaces the abandoned solution with the global best solution. The local search operator exploits the neighboring region of the current solutions, whereas the integration of genetic crossover with the NBABC algorithm increases the diversity in the search space and thus avoids the problem of local trappings encountered with the NBABC algorithm. These models are then used to decide the units on/off status, whereas the lambda iteration method is used to dispatch the hourly load demand among the committed units. The effectiveness of the proposed models is validated on an IEEE 10-unit thermal system combined with a wind farm over the planning period of 24 hours.
Abstract: Image segmentation is the concept of splitting the images into several images. Image Segmentation algorithm is used to manipulate the process of image segmentation. The advantage of ABC is that it conducts every worldwide exploration and inhabitant exploration for iteration. Particle Swarm Optimization (PSO) and Evolutionary Particle Swarm Optimization (EPSO) encompass a number of search problems. Cleverness Artificial Bee Colony algorithm has been imposed to increase the performance of a neighborhood search. The simulation results clearly show that the presented ABC methods outperform the existing methods. The result shows that the algorithms can be used to implement the manipulator for grasping of colored objects. The efficiency of the presented method is improved a lot by comparing to other methods.
Abstract: This paper presents the three optimization models, namely New Binary Artificial Bee Colony (NBABC) algorithm, NBABC with Local Search (NBABC-LS), and NBABC with Genetic Crossover (NBABC-GC) for solving the Wind-Thermal Unit Commitment (WTUC) problem. The uncertain nature of the wind power is incorporated using the Weibull probability density function, which is used to calculate the overestimation and underestimation costs associated with the wind power fluctuation. The NBABC algorithm utilizes a mechanism based on the dissimilarity measure between binary strings for generating the binary solutions in WTUC problem. In NBABC algorithm, an intelligent scout bee phase is proposed that replaces the abandoned solution with the global best solution. The local search operator exploits the neighboring region of the current solutions, whereas the integration of genetic crossover with the NBABC algorithm increases the diversity in the search space and thus avoids the problem of local trappings encountered with the NBABC algorithm. These models are then used to decide the units on/off status, whereas the lambda iteration method is used to dispatch the hourly load demand among the committed units. The effectiveness of the proposed models is validated on an IEEE 10-unit thermal system combined with a wind farm over the planning period of 24 hours.
Abstract: Voting algorithms are extensively used to make
decisions in fault tolerant systems where each redundant module
gives inconsistent outputs. Popular voting algorithms include
majority voting, weighted voting, and inexact majority voters. Each
of these techniques suffers from scenarios where agreements do not
exist for the given voter inputs. This has been successfully overcome
in literature using fuzzy theory. Our previous work concentrated on a
neuro-fuzzy algorithm where training using the neuro system
substantially improved the prediction result of the voting system.
Weight training of Neural Network is sub-optimal. This study
proposes to optimize the weights of the Neural Network using
Artificial Bee Colony algorithm. Experimental results show the
proposed system improves the decision making of the voting
algorithms.
Abstract: Nature is the immense gifted source for solving
complex problems. It always helps to find the optimal solution to
solve the problem. Mobile Ad Hoc NETwork (MANET) is a wide
research area of networks which has set of independent nodes. The
characteristics involved in MANET’s are Dynamic, does not depend
on any fixed infrastructure or centralized networks, High mobility.
The Bio-Inspired algorithms are mimics the nature for solving
optimization problems opening a new era in MANET. The typical
Swarm Intelligence (SI) algorithms are Ant Colony Optimization
(ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization
(PSO), Modified Termite Algorithm, Bat Algorithm (BA), Wolf
Search Algorithm (WSA) and so on. This work mainly concentrated
on nature of MANET and behavior of nodes. Also it analyses various
performance metrics such as throughput, QoS and End-to-End delay
etc.
Abstract: Job Scheduling plays an important role for efficient
utilization of grid resources available across different domains and
geographical zones. Scheduling of jobs is challenging and NPcomplete.
Evolutionary / Swarm Intelligence algorithms have been
extensively used to address the NP problem in grid scheduling.
Artificial Bee Colony (ABC) has been proposed for optimization
problems based on foraging behaviour of bees. This work proposes a
modified ABC algorithm, Cluster Heterogeneous Earliest First Min-
Min Artificial Bee Colony (CHMM-ABC), to optimally schedule
jobs for the available resources. The proposed model utilizes a novel
Heterogeneous Earliest Finish Time (HEFT) Heuristic Algorithm
along with Min-Min algorithm to identify the initial food source.
Simulation results show the performance improvement of the
proposed algorithm over other swarm intelligence techniques.
Abstract: In previous study, technique to estimate a self-location by using a lunar image is proposed.We consider the improvement of the conventional method in consideration of FPGA implementationin this paper. Specifically, we introduce Artificial Bee Colony algorithm for reduction of search time.In addition, we use fixed point arithmetic to enable high-speed operation on FPGA.
Abstract: Tumor is an uncontrolled growth of tissues in any part
of the body. Tumors are of different types and they have different
characteristics and treatments. Brain tumor is inherently serious and
life-threatening because of its character in the limited space of the
intracranial cavity (space formed inside the skull). Locating the tumor
within MR (magnetic resonance) image of brain is integral part of the
treatment of brain tumor. This segmentation task requires
classification of each voxel as either tumor or non-tumor, based on
the description of the voxel under consideration. Many studies are
going on in the medical field using Markov Random Fields (MRF) in
segmentation of MR images. Even though the segmentation process
is better, computing the probability and estimation of parameters is
difficult. In order to overcome the aforementioned issues, Conditional
Random Field (CRF) is used in this paper for segmentation, along
with the modified artificial bee colony optimization and modified
fuzzy possibility c-means (MFPCM) algorithm. This work is mainly
focused to reduce the computational complexities, which are found in
existing methods and aimed at getting higher accuracy. The
efficiency of this work is evaluated using the parameters such as
region non-uniformity, correlation and computation time. The
experimental results are compared with the existing methods such as
MRF with improved Genetic Algorithm (GA) and MRF-Artificial
Bee Colony (MRF-ABC) algorithm.
Abstract: In this work, a Multi-Level Artificial Bee Colony
(called MLABC) for optimizing numerical test functions is presented.
In MLABC, two species are used. The first species employs n
colonies where each of them optimizes the complete solution vector.
The cooperation between these colonies is carried out by exchanging
information through a leader colony, which contains a set of elite
bees. The second species uses a cooperative approach in which the
complete solution vector is divided to k sub-vectors, and each of
these sub-vectors is optimized by a colony. The cooperation between
these colonies is carried out by compiling sub-vectors into the
complete solution vector. Finally, the cooperation between two
species is obtained by exchanging information. The proposed
algorithm is tested on a set of well-known test functions. The results
show that MLABC algorithm provides efficiency and robustness to
solve numerical functions.
Abstract: This paper deals with the problem of automatic rule
generation for fuzzy systems design. The proposed approach is based
on hybrid artificial bee colony (ABC) optimization and weighted least
squares (LS) method and aims to find the structure and parameters of
fuzzy systems simultaneously. More precisely, two ABC based fuzzy
modeling strategies are presented and compared. The first strategy
uses global optimization to learn fuzzy models, the second one
hybridizes ABC and weighted least squares estimate method. The
performances of the proposed ABC and ABC-LS fuzzy modeling
strategies are evaluated on complex modeling problems and compared
to other advanced modeling methods.
Abstract: Segmentation is one of the essential tasks in image
processing. Thresholding is one of the simplest techniques for
performing image segmentation. Multilevel thresholding is a simple
and effective technique. The primary objective of bi-level or
multilevel thresholding for image segmentation is to determine a best
thresholding value. To achieve multilevel thresholding various
techniques has been proposed. A study of some nature inspired
metaheuristic algorithms for multilevel thresholding for image
segmentation is conducted. Here, we study about Particle swarm
optimization (PSO) algorithm, artificial bee colony optimization
(ABC), Ant colony optimization (ACO) algorithm and Cuckoo
search (CS) algorithm.
Abstract: This paper presents the performance state analysis of
Self-Excited Induction Generator (SEIG) using Artificial Bee Colony
(ABC) optimization technique. The total admittance of the induction
machine is minimized to calculate the frequency and magnetizing
reactance corresponding to any rotor speed, load impedance and
excitation capacitance. The performance of SEIG is calculated using
the optimized parameter found. The results obtained by ABC
algorithm are compared with results from numerical method. The
results obtained coincide with the numerical method results. This
technique proves to be efficient in solving nonlinear constrained
optimization problems and analyzing the performance of SEIG.
Abstract: This paper presents a nonparametric identification of
continuous-time nonlinear systems by using a Gaussian process
(GP) model. The GP prior model is trained by artificial bee colony
algorithm. The nonlinear function of the objective system is estimated
as the predictive mean function of the GP, and the confidence
measure of the estimated nonlinear function is given by the predictive
covariance of the GP. The proposed identification method is applied
to modeling of a simplified electric power system. Simulation results
are shown to demonstrate the effectiveness of the proposed method.
Abstract: Power distribution systems typically have tie and sectionalizing switches whose states determine the topological configuration of the network. The aim of network reconfiguration of the distribution network is to minimize the losses for a load arrangement at a particular time. Thus the objective function is to minimize the losses of the network by satisfying the distribution network constraints. The various constraints are radiality, voltage limits and the power balance condition. In this paper the status of the switches is obtained by using Artificial Bee Colony (ABC) algorithm. ABC is based on a particular intelligent behavior of honeybee swarms. ABC is developed based on inspecting the behaviors of real bees to find nectar and sharing the information of food sources to the bees in the hive. The proposed methodology has three stages. In stage one ABC is used to find the tie switches, in stage two the identified tie switches are checked for radiality constraint and if the radilaity constraint is satisfied then the procedure is proceeded to stage three otherwise the process is repeated. In stage three load flow analysis is performed. The process is repeated till the losses are minimized. The ABC is implemented to find the power flow path and the Forward Sweeper algorithm is used to calculate the power flow parameters. The proposed methodology is applied for a 33–bus single feeder distribution network using MATLAB.
Abstract: Distributed Generation (DG) systems are considered an integral part in future distribution system planning. Appropriate size and location of distributed generation plays a significant role in minimizing power losses in distribution systems. Among the benefits of distributed generation is the reduction in active power losses, which can improve the system performance, reliability and power quality. In this paper, Artificial Bee Colony (ABC) algorithm is proposed to determine the optimal DG-unit size and location by loss sensitivity index in order to minimize the real power loss, total harmonic distortion (THD) and voltage sag index improvement. Simulation study is conducted on 69-bus radial test system to verify the efficacy of the proposed method.
Abstract: This paper presents a new method which applies an
artificial bee colony algorithm (ABC) for capacitor placement in
distribution systems with an objective of improving the voltage profile
and reduction of power loss. The ABC algorithm is a new population
based meta heuristic approach inspired by intelligent foraging behavior
of honeybee swarm. The advantage of ABC algorithm is that
it does not require external parameters such as cross over rate and
mutation rate as in case of genetic algorithm and differential evolution
and it is hard to determine these parameters in prior. The other
advantage is that the global search ability in the algorithm is implemented
by introducing neighborhood source production mechanism
which is a similar to mutation process. To demonstrate the validity
of the proposed algorithm, computer simulations are carried out on
69-bus system and compared the results with the other approach
available in the literature. The proposed method has outperformed the
other methods in terms of the quality of solution and computational
efficiency.
Abstract: Artificial Bee Colony (ABC) algorithm is a relatively new swarm intelligence technique for clustering. It produces higher
quality clusters compared to other population-based algorithms but with poor energy efficiency, cluster quality consistency and typically slower in convergence speed. Inspired by energy saving foraging behavior of natural honey bees this paper presents a Quality and Quantity Aware Artificial Bee Colony (Q2ABC) algorithm to improve quality of cluster identification, energy efficiency and convergence speed of the original ABC. To evaluate the performance of Q2ABC algorithm, experiments were conducted on a suite of ten benchmark UCI datasets. The results demonstrate Q2ABC outperformed ABC and K-means algorithm in the quality of clusters delivered.
Abstract: Previous studies mass evacuation route network does
not fully reflect the step-by-step behavior and evacuees make routing
decisions. Therefore, they do not work as expected when applied to the
evacuation route planning is valid. This article describes where
evacuees may have to make a direction to select all areas were
identified as guiding points to improve evacuation routes network.
This improved route network can be used as a basis for the layout can
be used to guide the signs indicate that provides the required
evacuation direction. This article also describes that combines
simulation and artificial bee colony algorithm to provide the proposed
routing solutions, to plan an integrated routing mode. The improved
network and the model used is the cinema as a case study to assess the
floor. The effectiveness of guidance solution in the total evacuation
time is significant by verification.