Search

Optimization of scheduling problems that involve single or multiple machines with a multimodal objective function and linear or non-linear constraints are generally NP-Hard. The Artificial Bee Colony (ABC) algorithm is a metaheuristic proposed about eighteen years ago and has gained popularity in the swarm intelligence-based evolutionary computation approaches. Various scheduling requirements in diverse domains viz. Electric Vehicle charging, Operating Room, Nurse, Automatic Guided Vehicle (AGV), production, manufacturing, hydrothermal, Printed Circuit Board (PCB), and call centre scheduling are studied. The NP-Hard nature of these scheduling problems render exact methods incompetent for large problem instances thus requiring meta-heuristics such as ABC to produce feasible solutions in a reasonable computation time. The adaptation of ABC in these domains and the outcomes and performance of ABC are highlighted. Based on the case studies, it is found that the requirements of scheduling problems that would benefit from ABC are those that have a planning horizon requiring a near-optimal solution in a reasonably fast time when run on minimal computing capacity. Future works that would merit the application and enhancement of existing ABC techniques are proposed. The case studies presented in this paper motivate R&D Engineers and young researchers to apply ABC techniques of optimization and scheduling in different research topics for achieving energy and cost efficiency. [ABSTRACT FROM AUTHOR]

Recently, Drones and UAV research were becoming one of the interest topics for academia and industry, where it has been extensively addressed in the literature back the few years. Path planning of drones in an area with complex terrain or unknown environment and restricted by some obstacles is one of the most problems facing the operation of drones. The problem of path planning is not only limited to searching for an appropriate path from the starting point to the destination but also related to how to choose an ideal path among all available paths and provide a mechanism for collision avoidance. By considering how to construct the best path, several related issues need to be taken into account, that relate to safety, obstacle avoidance, response speed to overtake obstacles, etc. Swarm optimization algorithms have been used to provide intelligent modeling for drone path planning and enable to build the best path for each drone. This is done according to the planning and coordination dimensions among the swarm members. In this paper, we have discussed the features and characteristics of different swarm optimization algorithms such as ant colony optimization (ACO), fruit fly optimization algorithm (FOA), artificial bee colony (ABC), and particle swarm optimization (PSO). In addition, the paper provides a comprehensive summary related to the most important studies on drone path planning algorithms. We focused on analyzing the impact of the swarm algorithm and its performance in drone path planning. For that, the paper presented one of the most used algorithms and its models employed to improve the trajectory of drones that rely on swarm intelligence and its impact on the optimal path cost of drones. The results of performance analysis for the ACO algorithm in a 3D and 2D-dimensional environment are illustrated and discussed, and then the performance evaluation of the ACO is compared to the enhanced ACO algorithm. The proposed algorithm achieves fast convergence, accelerating the process of path planning. [ABSTRACT FROM AUTHOR]

The replacement of sensor node battery in wireless sensor network (WSN) is considered to be the highly crucial task in hostile environments. The process of partitioning the region of sensing in WSNs into clusters is determined to be the ultimate solution for attaining maximized network lifetime and gaining high energy efficiency. However, proper selection of CHs plays an anchor role in enhancing the network lifetime, since they need to utilize addition energy to handle the task of data gathering and data aggregation from the sensor member nodes of clusters and finally disseminate them to the base station.In this paper, a Hybrid Artificial Bee Colony (ABC) and Harmony Search Algorithm-based Metaheuristic Approach (HABC-HSA-MA) is proposed for attaining efficient CH selection with the view to sustain stable energy utilization with enhanced network lifetime. This HABC-HSA-MA includes the global optimization potential of Harmony Search Algorithm (HSA) and local exploitation potential of the classical ABC algorithm for achieving significant CH selection for stabilizing energy and extending network lifetime. It also incorporated the benefits of harmony adjusting factor for inducing the process of improving the dynamic search efficiency during the process of CH selection in order to prevent worst candidates from being selected as CHs. The simulation results of the proposed HABC-HSA-MA confirms an enhancement in mean network lifetime of 23.64% and balanced average energy consumption rate of 20.28% compared to the benchmarked hybrid meta-heuristic CH selection schemes. [ABSTRACT FROM AUTHOR]

The artificial bee colony (ABC) is a population-based optimization algorithm that mimics the foraging behavior of honeybees. Here, we focus on the parameter setting that ensures the ABC algorithm stability. Therefore, this paper introduces a matrix-iterative model, taking into account the coupling within bees. Moreover, the model considered the difference between update modes, i.e., synchronous or sequential. The necessary conditions for absolute stability were derived under the quasi-deterministic assumption. We further investigated the criteria for first and second-order stochastic stability. These criteria report on the ranges for setting the uniform distributions of the ABC algorithm. Finally, some supporting simulations were carried out on CEC 2017 benchmark functions in different search space dimensions (10, 30, and 50) and on twenty real-world problems (CEC 2011). Six considered ABC variants tested the derived and state-of-the-art criteria in different update modes. Moreover, ABC algorithms were compared with some state-of-the-art metaheuristics (Particle Swarm Optimization, Gravitational Search Algorithm, and Grey Wolf Optimizer). The overall results show that stochastic stability proffers ABC competitiveness. The two update modes may alter the ABC performance only slightly or drastically, depending on the problem, with no evidence on the supremacy of one of them. [ABSTRACT FROM AUTHOR]

The artificial bee colony (ABC) algorithm is well known and widely used optimization method based on swarm intelligence, and it is inspired by the behavior of honeybees searching for a high amount of nectar from the flower. However, this algorithm has not been exploited sufficiently. This research paper proposes a novel method to analyze the exploration and exploitation of ABC. In ABC, the scout bee searches for a source of random food for exploitation. Along with random search, the scout bee is guided by a modified genetic algorithm approach to locate a food source with a high nectar value. The proposed algorithm is applied for the design of a nonlinear controller for a continuously stirred tank reactor (CSTR). The statistical analysis of the results confirms that the proposed modified hybrid artificial bee colony (HMABC) achieves consistently better performance than the traditional ABC algorithm. The results are compared with conventional ABC and nonlinear PID (NLPID) to show the superiority of the proposed algorithm. The performance of the HMABC algorithm-based controller is competitive with other state-of-the-art meta-heuristic algorithm-based controllers in the literature. [ABSTRACT FROM AUTHOR]

A swarm-based metaheuristic algorithm, like artificial bee colony (ABC), embraces four key elements of collective intelligence: positive feedback, negative feedback, multiple interactions, and fluctuation. Fluctuation refers to population diversity which can be measured using dimension-wise diversity. This paper performed component-wise analysis of ABC algorithm using diversity measurement. The analysis revealed scout bees component as counterproductive and onlooker bees component with poor global search ability. Subsequently, an ABC algorithm without scout bees component and modified onlooker bees component is proposed in this paper. The effectiveness and efficiency of the proposed ScoutlessABC is validated on test suite of a dozen of benchmark functions. To further evaluate the performance, ScoutlessABC is employed on the parameter training problem of fuzzy neural network for solving eight classification problems. The experimental results show that ScoutlessABC maintains strong convergence ability than the original ABC algorithm. Overall, this study has two major contributions: (a) an effective component-wise analysis approach using diversity measurement and (b) a simplified and modified ABC variant with enhanced search efficiency. [ABSTRACT FROM AUTHOR]

At present, artificial bee colony algorithm (ABC) is one of the hot issues in swarm intelligence algorithm. Since it was proposed, people have done a lot of improvement work for ABC algorithm. To address the shortcomings of ABC, an improved ABC guided by experience (named as EABC) is proposed in this paper. In EABC, it collects the experience of individual improvement caused by dimension change in the iterative process, and selects the dimensions to change according to a ratio when a new position needs to be generated. In this way, the individual can choose a good direction to improve its quality. Numerical experiments show that EABC has a better performance. [ABSTRACT FROM AUTHOR]

Artificial Bee Colony (ABC) algorithm is a meta-heuristic algorithm, is inspired by the bee's food search behaviour based on swarm intelligence. Successful applications were performed on many optimization problems using this algorithm rising in popularity over the past few years. The update mechanism of the ABC algorithm, despite the fact that its exploration is good, faces the problem of convergence performance. For solving convergence problem of ABC Algorithm An Artificial Bee Colony Algorithm Based Fitness Weighted Search (ABCFWS) algorithm proposed in this paper. In this approach, an intelligent search space is proposed instead of the random search space of the ABC algorithm. In this method, the fitness values of the food source and the selected neighbour food source are taken as weights and a more balanced search space was found in the direction of the food source with better fitness value. The proposed method has been applied to 28 unconstrained numerical optimization test problems with different characteristics and the results were compared with the ABC algorithm variations. The results show that the proposed method is successful and competitive. [ABSTRACT FROM AUTHOR]

The artificial bee colony (ABC) algorithm is a prominent swarm intelligence technique due to its simple structure and effective performance. However, the ABC algorithm has a slow convergence rate when it is used to solve complex optimization problems since its solution search equation is more of an exploration than exploitation operator. This paper presents an improved ABC algorithm for solving integer programming and minimax problems. The proposed approach employs a modified ABC search operator, which exploits the useful information of the current best solution in the onlooker phase with the intention of improving its exploitation tendency. Furthermore, the shuffle mutation operator is applied to the created solutions in both bee phases to help the search achieve a better balance between the global exploration and local exploitation abilities and to provide a valuable convergence speed. The experimental results, obtained by testing on seven integer programming problems and ten minimax problems, show that the overall performance of the proposed approach is superior to the ABC. Additionally, it obtains competitive results compared with other state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Swarm intelligence has appeared as an active field for solving numerous machine-learning tasks. In this paper, we address the problem of clustering data with missing values, where the patterns are described by mixed (or hybrid) features. We introduce a generic modification to three swarm intelligence algorithms (Artificial Bee Colony, Firefly Algorithm, and Novel Bat Algorithm). We experimentally obtain the adequate values of the parameters for these three modified algorithms, with the purpose of applying them in the clustering task. We also provide an unbiased comparison among several metaheuristics based clustering algorithms, concluding that the clusters obtained by our proposals are highly representative of the "natural structure" of data. [ABSTRACT FROM AUTHOR]

Hydrological models are widely used tools in water resources management. Their successful application requires an efficient calibration of the model parameters. Nowadays, there are very powerful global search methods applied to this end, but they have the disadvantage of presenting a high computational cost, because the numerical model to be calibrated needs to be evaluated a large number of times with different parameter sets. In this context, surrogate models can reduce significantly the run time of hydrological models, easing the total computational burden of global search methods. In the present work, we propose and explore the combination of a swarm intelligence-based optimization method, the artificial bee colony algorithm, with a surrogate model based on artificial neural networks in order to calibrate hydrological models. The proposed approach (ABC-ANN) is applied to the calibration and validation of a nine-parameter continuous hydrological model in two basins located in the northwest of Spain. Several aspects of the algorithm are evaluated, including its capability to calibrate the model parameters and its efficiency in terms of CPU time compared to a standard implementation of the ABC algorithm. Results show that the ABC-ANN algorithm is able to identify the location of suitable parameter sets with an accuracy rate within 89 and 99 %, and a reduction in CPU time of more than three orders of magnitude when compared to a sequential implementation. In addition, the frequency distribution of the parameter sets identified gives valuable information about the sensitivity of model output to the input parameters. [ABSTRACT FROM AUTHOR]

This paper presents an Artificial Bee Colony (ABC) optimization based algorithm for co-clustering of high-dimensional data. The ABC algorithm is used for optimization problems including data clustering. We incorporate aspects of co-clustering by embedding it into the objective function used for clustering by the ABC algorithm. Instead of a linear metric, such as the Euclidean distance, we propose the use of higher order correlations to build similarity between rows and columns, each based on the other. This measure uses co-evolving similarities which when embedded into the objective function results in optimizing the co-clusters. The search space is also explored in the vicinity of the solutions produced by the ABC algorithm using three local search methods — the first is a heuristic based on computing the cluster means; the second uses the analytical gradient of the objective with respect to a centroid to find lower cost solutions in the vicinity; and, the third is a hybrid of the first two methods. Numerical experiments show significant improvement in the search for optimal clustering by incorporating new similarity metric and optimized local search method. Finally, the algorithm is shown to be highly scalable for parallel architectures for both distributed and shared memory systems. Theoretically, the best iso-efficiency function of Θ (p log p) for fully connected network with p processors is also computed for the parallel algorithm. • We incorporate co-clustering into the objective function of the ABC using co-similarity matrices to achieve co-clustering. • We enhance the ABC approach using a neighborhood-search-space-aware local search method to guide the solution. • We discuss ways to parallelize the algorithm and provide a scalability analysis. • Experiments show much better results as compared to other clustering and co-clustering methods. [ABSTRACT FROM AUTHOR]

This work proposed a memetic version of Artificial Bee Colony algorithm, or called LSABC, which employed a "shrinking" local search strategy. By gradually shrinking the local search space along with the optimization process, the proposed LSABC algorithm randomly explores a large space in the early run time. This helps to avoid premature convergence. Then in the later evolution process, the LSABC finely exploits a small region around the current best solution to achieve a more accurate output value. The optimization behavior of the LSABC algorithm was studied and analyzed in the work. Compared with the classic ABC and several other state-of-the-art optimization algorithms, the LSABC shows a better performance in terms of convergence rate and quality of results for high-dimensional problems. [ABSTRACT FROM AUTHOR]

The intellects-masses optimizer (IMO) is a new variant of cultural algorithm, which is used to solve continuous numerical optimization problems. The proposed method divides its population into two sub-populations, one that contains the fittest individuals (called theintellects) and the other sub-population, which includes the rest of the individuals in the population (called themasses). The two sub-populations evolve in parallel and influence each other. IMO is a simple, easy to code approach that has few, easy to tune parameters. The performance of IMO is investigated on 25 problems; five of them are real-world engineering problems and six high-dimensional problems. IMO is compared with 6 otherstate-of-the-artswarm intelligence approaches on the 25 problems. The results show that IMO generally outperforms the other approaches. [ABSTRACT FROM AUTHOR]

Artificial Bee Colony (ABC) is a Swarm Intelligence optimization algorithm well known for its versatility. The selection of decision variables to update is purely stochastic, incurring several issues to the local search capability of the ABC. To address these issues, a self-adaptive decision variable selection mechanism is proposed with the goal of balancing the degree of exploration and exploitation throughout the execution of the algorithm. This selection, named Adaptive Decision Variable Matrix (A-DVM), represents both stochastic and deterministic parameter selection in a binary matrix and regulates the extent of how much each selection is employed based on the estimation of the sparsity of the solutions in the search space. The influence of the proposed approach to performance and robustness of the original algorithm is validated by experimenting on 15 highly multimodal benchmark optimization problems. Numerical comparison on those problems is made against the ABC and their variants and prominent population-based algorithms (e.g., Particle Swarm Optimization and Differential Evolution). Results show an improvement in the performance of the algorithms with the A-DVM in the most challenging instances. [ABSTRACT FROM AUTHOR]