• Advances in Energy Research
• /
• 제7권1호
• /
• pp.35-52
• /
• 2020

The paper proposes a hybrid approach of artificial bee colony (ABC) and grey wolf optimizer (GWO) algorithm for multi-objective and multidimensional engine optimization of a converted plug-in hybrid electric vehicle. The proposed strategy is used to optimize all emissions along with brake specific fuel consumption (FC) for converted parallel operated diesel plug-in hybrid electric vehicle (PHEV). All emissions particulate matter (PM), nitrogen oxide (NOx), carbon monoxide (CO) and hydrocarbon (HC) are considered as optimization parameters with weighted factors. 70 hp engine data of NOx, PM, HC, CO and FC obtained from Oak Ridge National Laboratory is used for the study. The algorithm is initialized with feasible solutions followed by the employee bee phase of artificial bee colony algorithm to provide exploitation. Onlooker and scout bee phase is replaced by GWO algorithm to provide exploration. MATLAB program is used for simulation. Hybrid ABC-GWO algorithm developed is tested extensively for various values of speeds and torque. The optimization performance and its environmental impact are discussed in detail. The optimization results obtained are verified by real data engine maps. It is also compared with modified ABC and GWO algorithm for checking the effectiveness of proposed algorithm. Hybrid ABC-GWO offers combine benefits of ABC and GWO by reducing computational load and complexity with less computation time providing a balance of exploitation and exploration and passes repeatability towards use for real-time optimization.

• Steel and Composite Structures
• /
• 제12권6호
• /
• pp.505-522
• /
• 2012

An artificial bee colony (ABC) algorithm is developed for the optimum design of geometrically non-linear steel frames. The ABC is a new swarm intelligence method which simulates the intelligent foraging behaviour of honeybee swarm for solving the optimization problems. Minimum weight design of steel frames is aimed under the strength, displacement and size constraints. The geometric non-linearity of the frame members is taken into account in the optimum design algorithm. The performance of the ABC algorithm is tested on three steel frames taken from literature. The results obtained from the design examples demonstrate that the ABC algorithm could find better designs than other meta-heuristic optimization algorithms in shorter time.

• 경영과학
• /
• 제28권1호
• /
• pp.43-52
• /
• 2011

The basic objective of broadcast scheduling is to get the smallest length TDMA frame, where many nodes are allowed to transmit simultaneously in a single time slot in a conflict-free manner. The secondary objective is to maximize the number of such transmissions for maximum use of the channel. An Artificial Bee Colony (ABC) with ranking strategy is proposed in this paper for the broadcast scheduling problem. Our proposed method is very efficient for generating initial and neighbor feasible solutions. We can get the best number of time slots and transmission utilization comparing to previous researches.

• Journal of Information Processing Systems
• /
• 제14권2호
• /
• pp.448-454
• /
• 2018

Artificial bee colony (ABC) algorithm has attracted significant interests recently for solving the multivariate optimization problem. However, it still faces insufficiency of slow convergence speed and poor local search ability. Therefore, in this paper, a modified ABC algorithm with bees' number reallocation and new search equation is proposed to tackle this drawback. In particular, to enhance solution accuracy, more bees in the population are assigned to execute local searches around food sources. Moreover, elite vectors are adopted to guide the bees, with which the algorithm could converge to the potential global optimal position rapidly. A series of classical benchmark functions for frequency-modulated sound waves are adopted to validate the performance of the modified ABC algorithm. Experimental results are provided to show the significant performance improvement of our proposed algorithm over the traditional version.

• Structural Engineering and Mechanics
• /
• 제52권6호
• /
• pp.1209-1224
• /
• 2014

In Current paper, the voltages of patches optimization are carried out for minimizing the power consumption of piezoelectric patches and maximum vertical displacement of symmetrically FML panels using the modified multi-objective Elitist-Artificial Bee Colony (E-ABC) algorithm. The voltages of patches, panel length/width ratios, ply angles, thickness of metal sheets and edge conditions are chosen as design variables. The classical laminated plate theory (CLPT) is considered to model the transient response of the panel, and numerical results are obtained by the finite element method. The performance of the E-ABC is also compared with the PSO algorithm and shows the good efficiency of the E-ABC algorithm. To check the validity, the transient responses of isotropic and orthotropic panels are compared with those available in the literature and show a good agreement.

• Structural Engineering and Mechanics
• /
• 제55권6호
• /
• pp.1223-1239
• /
• 2015

A method for structural damage identification based on Chaotic Artificial Bee Colony (CABC) algorithm is presented. ABC is a heuristic algorithm with simple structure, ease of implementation, good robustness but with slow convergence rate. To overcome the shortcoming, the tournament selection mechanism is chosen instead of the roulette mechanism and chaotic search mechanism is also introduced. Residuals of natural frequencies and modal assurance criteria (MAC) are used to establish the objective function, ABC and CABC are utilized to solve the optimization problem. Two numerical examples are studied to investigate the efficiency and correctness of the proposed method. The simulation results show that the CABC algorithm can identify the local damage better compared with ABC and other evolutionary algorithms, even with noise corruption.

• International Journal of Computer Science & Network Security
• /
• 제21권11호
• /
• pp.312-320
• /
• 2021

Increase in computational cost and exhaustive search can lead to more complexity and computational energy. Thus, there is need for effective and efficient scheme to reduce the complexity to achieve optimal energy utilization. This will improve the energy efficiency and enhance the proficiency in terms of the resources needed to achieve convergence. This paper primarily focuses on the development of hybrid swarm intelligence scheme for reducing the computational complexity in binary optimization. In order to reduce the complexity, both artificial bee colony (ABC) and particle swarm optimization (PSO) have been employed to effectively minimize the exhaustive search and increase convergence. First, a new approach using ABC and PSO has been proposed and developed to solve the binary optimization problem. Second, the scout for good quality food sources is accomplished through the deployment of PSO in order to optimally search and explore the best source. Extensive experimental simulations conducted have demonstrate that the proposed scheme outperforms the ABC approaches for reducing complexity and energy consumption in terms of convergence, search and error minimization performance measures.

• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• 산업경영시스템학회지
• /
• 제40권4호
• /
• pp.203-210
• /
• 2017

Data clustering is one of the most difficult and challenging problems and can be formally considered as a particular kind of NP-hard grouping problems. The K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, it has high possibility to trap in local optimum and high variation of solutions with different initials for the large data set. Therefore, we need study efficient computational intelligence method to find the global optimal solution in data clustering problem within limited computational time. The objective of this paper is to propose a combined artificial bee colony (CABC) with K-means for initialization and finalization to find optimal solution that is effective on data clustering optimization problem. The artificial bee colony (ABC) is an algorithm motivated by the intelligent behavior exhibited by honeybees when searching for food. The performance of ABC is better than or similar to other population-based algorithms with the added advantage of employing fewer control parameters. Our proposed CABC method is able to provide near optimal solution within reasonable time to balance the converged and diversified searches. In this paper, the experiment and analysis of clustering problems demonstrate that CABC is a competitive approach comparing to previous partitioning approaches in satisfactory results with respect to solution quality. We validate the performance of CABC using Iris, Wine, Glass, Vowel, and Cloud UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KABCK (K-means+ABC+K-means) is better than ABCK (ABC+K-means), KABC (K-means+ABC), ABC, and K-means in our simulations.

• Membrane and Water Treatment
• /
• 제9권5호
• /
• pp.363-371
• /
• 2018

In this work, it was investigated the usability of artificial bee colony (ABC) and genetic algorithm (GA) in modeling adsorption of Co(II) onto drinking water treatment sludge (DWTS). DWTS, obtained as inevitable byproduct at the end of drinking water treatment stages, was used as an adsorbent without any physical or chemical pre-treatment in the adsorption experiments. Firstly, DWTS was characterized employing various analytical procedures such as elemental, FT-IR, SEM-EDS, XRD, XRF and TGA/DTA analysis. Then, adsorption experiments were carried out in a batch system and DWTS's Co(II) removal potential was modelled via ABC and GA methods considering the effects of certain experimental parameters (initial pH, contact time, initial Co(II) concentration, DWTS dosage) called as the input parameters. The accuracy of ABC and GA method was determined and these methods were applied to four different functions: quadratic, exponential, linear and power. Some statistical indices (sum square error, root mean square error, mean absolute error, average relative error, and determination coefficient) were used to evaluate the performance of these models. The ABC and GA method with quadratic forms obtained better prediction. As a result, it was shown ABC and GA can be used optimization of the regression function coefficients in modeling adsorption experiments.