Improved artificial bee colony algorithm based on escaped foraging strategy

This paper presents an improved artificial bee colony algorithm. Under the framework of the basic artificial bee colony algorithm, this paper redefines the artificial bee colony and introduces search strategies for group escape and foraging based on Levy flight. The proposed algorithm is named artificial bee colony algorithm based on escaped foraging strategy (EFSABC).There are different strategies for scout bees, onlookers, and free bees searching for honey sources in the EFSABC: all working bees relinquish old honey sources due to disturbance, and select different routines to seek new honey sources. Sixteen typical high-dimensional standard functions are used to verify the effectiveness of the proposed algorithm. The EFSABC algorithm outperforms the traditional artificial bee colony algorithm in all aspects.     

A new improved artificial bee colony algorithm for ship hull form optimization

The artificial bee colony (ABC) algorithm is a relatively new swarm intelligence-based optimization algorithm. Its simplicity of implementation, relatively few parameter settings and promising optimization capability make it widely used in different fields. However, it has problems of slow convergence due to its solution search equation. Here, a new solution search equation based on a combination of the elite solution pool and the block perturbation scheme is proposed to improve the performance of the algorithm. In addition, two different solution search equations are used by employed bees and onlooker bees to balance the exploration and exploitation of the algorithm. The developed algorithm is validated by a set of well-known numerical benchmark functions. It is then applied to optimize two ship hull forms with minimum resistance. The tested results show that the proposed new improved ABC algorithm can outperform the ABC algorithm in most of the tested problems.     

Transmitter-Receiver Path Selection for Cell Range Extension Using Multi-Hop D2D

Conventional approach of dealing with more users per coverage area in cellular networks implies densifying the amount of (Access Point) AP which will eventually result in a larger carbon footprint. In this paper, we propose a base station off-loading and cell range extension (CRE) scheme based on multi-hop device-to-device (MHD2D) path selection between transmitter and receiver node. The paper also provides derivations of upper and lower bounds for energy efficiency, capacity, and transmit power. The proposed path selection scheme is inspired by the foraging behavior of honey bees. We present the algorithm as a modified variant of the artificial bee colony algorithm (MVABC). The proposed optimization problem is modeled as a minimization problem where we optimize the Energy Efficiency (EE). The proposed path selection MVABC is compared with the Genetic Algorithm (GA) and also with classical artificial bee colony (ABC) through simulations and statistical analysis. The student’s t-test, p-value, and standard error of means (SEM) clearly show that MVABC based path selection out-performs the GA and classical ABC schemes. MVABC based approach is 66% more efficient when compared with classic ABC and about 62% efficient when compared with GA based scheme.     

Performance improvement of an active vibration absorber subsystem for an aircraft model using a bees algorithm based on multi-objective intelligent optimization

This study develops a mathematical model to investigate the behaviour of adaptable shock absorber dynamics for the six-degree-of-freedom aircraft model in the taxiing phase. The purpose of this research is to design a proportional-integral-derivative technique for control of an active vibration absorber system using a hydraulic nonlinear actuator based on the bees algorithm. This optimization algorithm is inspired by the natural intelligent foraging behaviour of honey bees. The neighbourhood search strategy is used to find better solutions around the previous one. The parameters of the controller are adjusted by minimizing the aircraft’s acceleration and impact force as the multi-objective function. The major advantages of this algorithm over other optimization algorithms are its simplicity, flexibility and robustness. The results of the numerical simulation indicate that the active suspension increases the comfort of the ride for passengers and the fatigue life of the structure. This is achieved by decreasing the impact force, displacement and acceleration significantly.     

Hybridization of ABC and PSO algorithms for improved solutions of RCPSP

A resource-constrained project scheduling problem (RCPSP) is one of the most famous intractable NP-hard problems in the operational research area in terms of its practical value and research significance. To effectively solve the RCPSP, we propose a hybrid approach by integrating artificial bee colony (ABC) and particle swarm optimization (PSO) algorithms. Moreover, a novel structure of ABC-PSO is devised based on embedded ABC-PSO (EABC-PSO) and sequential ABC-PSO (SABC-PSO) strategies. The EABC-PSO strategy mainly applies the PSO algorithm to update the process of the ABC algorithm while the SABC-PSO strategy demonstrates an approach in which computational results obtained from the ABC algorithm are further improved based on the PSO algorithm. In both strategies, bees in the ABC process are entitled to learning capacity from the best local and global solutions in terms of the PSO concept. Subsequently, the updates of solutions are premeditated with crossover and insert operators together with double justification methods. Computational results obtained from the tests on benchmark sets show that the proposed ABC-PSO algorithm is efficient in solving RCPSP problems, demonstrating clear advantages over the pure ABC algorithm, the PSO algorithm, and a number of listed heuristics.     

Chemical characterization of honey bees by curie-point pyrolysis-gas chromatography-pattern recognition

Valcarce, R. and Smith, G.G., 1989. Chemical characterization of honey bees by Curie-point pyrolysis-gas chromatography-pattern recognition. Chemometrics and Intelligent Laboratory Systems, 6: 157-166.Curie-point pyrolysis-gas chromatography coupled with the application of three different multivariate pattern recognition programs [SPSS-X (hierarchical cluster analysis), MVSP (principal component analysis) and FCVPC-87 (fuzzy c-varieties pattern recognition)] was used to develop an alternative technique for discriminating European, African, Africanized, and F₁, hybrid honey bees based on non-morphological characteristics. FCVPC-87 was also employed to evaluate the pyrograms for the discriminating chemical features responsible for differentiating these bees. The chemical identities of the discriminating peaks were determined by pyrolysis-gas chromatography-mass spectrometry.     

A discrete artificial bee colony algorithm for single machine scheduling problems

This paper presents a discrete artificial bee colony algorithm for a single machine earliness–tardiness scheduling problem. The objective of single machine earliness–tardiness scheduling problems is to find a job sequence that minimises the total sum of earliness–tardiness penalties. Artificial bee colony (ABC) algorithm is a swarm-based meta-heuristic, which mimics the foraging behaviour of honey bee swarms. In this study, several modifications to the original ABC algorithm are proposed for adapting the algorithm to efficiently solve combinatorial optimisation problems like single machine scheduling. In proposed study, instead of using a single search operator to generate neighbour solutions, random selection from an operator pool is employed. Moreover, novel crossover operators are presented and employed with several parent sets with different characteristics to enhance both exploration and exploitation behaviour of the proposed algorithm. The performance of the presented meta-heuristic is evaluated on several benchmark problems in detail and compared with the state-of-the-art algorithms. Computational results indicate that the algorithm can produce better solutions in terms of solution quality, robustness and computational time when compared to other algorithms.     

基于自由振动响应识别桥梁断面颤振导数的人工蜂群算法

基于桥梁节段模型风洞试验自由振动衰减时程信号,提出了桥梁断面颤振导数识别的人工蜂群算法。基于最小二乘原理,将竖弯和扭转信号的整体残差平方和作为目标函数,使用人工蜂群算法对相关参数进行寻优搜索,识别出桥梁断面的颤振导数。与其他迭代算法相比,人工蜂群算法是受生物启发产生的寻优算法,对初值没有要求,从而避免了迭代初值对识别精度的影响。为考察人工蜂群算法在桥梁断面颤振导数识别中的有效性,进行了理想平板模型仿真以及某大桥节段模型风洞试验,结果表明,桥梁断面颤振导数识别的人工蜂群算法具有较好的稳定性和可靠性。     

Modified artificial bee colony optimization with block perturbation strategy

As a newly emerged swarm intelligence-based optimizer, the artificial bee colony (ABC) algorithm has attracted the interest of researchers in recent years owing to its ease of use and efficiency. In this article, a modified ABC algorithm with block perturbation strategy (BABC) is proposed. Unlike basic ABC, in the BABC algorithm, not one element but a block of elements from the parent solutions is changed while producing a new solution. The performance of the BABC algorithm is investigated and compared with that of the basic ABC, modified ABC, Brest's differential evolution, self-adaptive differential evolution and restart covariance matrix adaptation evolution strategy (IPOP-CMA-ES) over a set of widely used benchmark functions. The obtained results show that the performance of BABC is better than, or at least comparable to, that of the basic ABC, improved differential evolution variants and IPOP-CMA-ES in terms of convergence speed and final solution accuracy.     

维修备件基于AHP的ABC分类模型

针对ABC分类在设备维修备件管理中不足以区分重点备件的缺陷,将层次分析法与ABC分类相结合应用于设备维修备件的分类。将维修备件的易得性、关键性和经济性作为分类准则,通过ABC分类来求解备件对分类准则的权重,然后运用层次分析法计算备件的组合权重,再根据组合权重对备件进行ABC分类。该方法用于设备维修备件的分类可以快速有效地找出重点备件．提高备件管理工作的针对性和有效性。     

Distance-based consensus method for ABC analysis

A distance-based multi-criteria consensus framework on the concepts of ideal and negative-ideal solutions is presented for the ABC analysis of inventory items. This article demonstrates a way of classifying inventory items using the TOPSIS (‘Technique for Order Preference by Similarity to Ideal Solution’) model. The methodology has been applied in a pharmaceutical company located in the heart of Kolkata, India. The technique takes into account various conflicting criteria having incommensurable units of measurement. Unit cost, lead time, consumption rate, perishability of items and cost of storing of raw materials have been considered for the case study. By using TOPSIS, the items are ranked in categories A, B and C. The suitability, practicability and effectiveness of the TOPSIS method used in ABC classification have been judged using the analysis of variance (ANOVA) technique. A simulation model has been used to compare the proposed model with that of the traditional ABC classification technique.     

An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system

This paper proposes an improved artificial bee colony (IABC) algorithm for addressing the distributed flow shop considering the distance coefficient found in precast concrete production system, with the minimisation of the makespan. In the proposed algorithm, each solution is first represented by a two-dimensional vector, where the first dimensional vector is the factory and the second dimensional vector lists the operation scheduling sequence of each factory. Second, considering the distributed problem feature, a distributed iterated greedy heuristic (DIG) is developed where destruction and construction processes are designed in detail while considering the distributed structures. Third, an efficient population initialisation method that considers the factory workload balance is presented. Then, a local search approach that randomly replaces two factories with two randomly selected jobs and that finds an optimal position for the two inserted operations via the DIG method is proposed. For the canonical ABC algorithm, using the DIG approach, the main three parts are improved, namely, the employee, onlooker, and scout bees. Finally, the proposed algorithm is tested on sets of extended instances based on the well-known benchmarks. Through an analysis of the experimental results, the highly effective proposed IABC algorithm is compared to several efficient algorithms drawn from the literature.     

Optimal Machine Learning Driven Sentiment Analysis on COVID-19 Twitter Data

The outbreak of the pandemic, caused by Coronavirus Disease 2019 (COVID-19), has affected the daily activities of people across the globe. During COVID-19 outbreak and the successive lockdowns, Twitter was heavily used and the number of tweets regarding COVID-19 increased tremendously. Several studies used Sentiment Analysis (SA) to analyze the emotions expressed through tweets upon COVID-19. Therefore, in current study, a new Artificial Bee Colony (ABC) with Machine Learning-driven SA (ABCML-SA) model is developed for conducting Sentiment Analysis of COVID-19 Twitter data. The prime focus of the presented ABCML-SA model is to recognize the sentiments expressed in tweets made upon COVID-19. It involves data pre-processing at the initial stage followed by n-gram based feature extraction to derive the feature vectors. For identification and classification of the sentiments, the Support Vector Machine (SVM) model is exploited. At last, the ABC algorithm is applied to fine tune the parameters involved in SVM. To demonstrate the improved performance of the proposed ABCML-SA model, a sequence of simulations was conducted. The comparative assessment results confirmed the effectual performance of the proposed ABCML-SA model over other approaches.     

An artificial bee colony algorithm for the economic lot scheduling problem

In this study, we present an artificial bee colony (ABC) algorithm for the economic lot scheduling problem modelled through the extended basic period (EBP) approach. We allow both power-of-two (PoT) and non-power-of-two multipliers in the solution representation. We develop mutation strategies to generate neighbouring food sources for the ABC algorithm and these strategies are also used to develop two different variable neighbourhood search algorithms to further enhance the solution quality. Our algorithm maintains both feasible and infeasible solutions in the population through the use of some sophisticated constraint handling methods. Experimental results show that the proposed algorithm succeeds to find the all the best-known EBP solutions for the high utilisation 10-item benchmark problems and improves the best known solutions for two of the six low utilisation 10-item benchmark problems. In addition, we develop a new problem instance with 50 items and run it at different utilisation levels ranging from 50 to 99% to see the effectiveness of the proposed algorithm on large instances. We show that the proposed ABC algorithm with mixed solution representation outperforms the ABC that is restricted only to PoT multipliers at almost all utilisation levels of the large instance.     

Biomechanics of pollen pellet removal by the honey bee

Honey bees (Apis mellifera) carry pollen back to their hive by mixing it with nectar and forming it into a pellet. The pellet must be firmly attached to their legs during flight, but also easily removable when deposited in the hive. How does the honey bee achieve these contrary aims? In this experimental study, we film honey bees removing pollen pellets and find they peel them off at speeds 2–10 times slower than their typical grooming speeds. Using a self-built pollen scraper, we find that slow removal speeds reduce the force and work required to remove the pellet under shear stress. Creep tests on individual pollen pellets revealed that pollen pellets are viscoelastic materials characterized by a Maxwell model with long relaxation times. The relaxation time enables the pellet to remain a solid during both transport and removal. We hope that this work inspires further research into viscoelastic materials in nature.     

Automatic Data Clustering Based Mean Best Artificial Bee Colony Algorithm

Fuzzy C-means (FCM) is a clustering method that falls under unsupervised machine learning. The main issues plaguing this clustering algorithm are the number of the unknown clusters within a particular dataset and initialization sensitivity of cluster centres. Artificial Bee Colony (ABC) is a type of swarm algorithm that strives to improve the members’ solution quality as an iterative process with the utilization of particular kinds of randomness. However, ABC has some weaknesses, such as balancing exploration and exploitation. To improve the exploration process within the ABC algorithm, the mean artificial bee colony (MeanABC) by its modified search equation that depends on solutions of mean previous and global best is used. Furthermore, to solve the main issues of FCM, Automatic clustering algorithm was proposed based on the mean artificial bee colony called (AC-MeanABC). It uses the MeanABC capability of balancing between exploration and exploitation and its capacity to explore the positive and negative directions in search space to find the best value of clusters number and centroids value. A few benchmark datasets and a set of natural images were used to evaluate the effectiveness of AC-MeanABC. The experimental findings are encouraging and indicate considerable improvements compared to other state-of-the-art approaches in the same domain.     

Improved artificial bee colony algorithm for crack identification in beam using natural frequencies only

An improved artificial bee colony algorithm (I-ABC) is proposed for crack identification in beam structures. ABC is a heuristic algorithm and swarm technique with simple structure, which is easy to implement but with slow convergence rate. In the I-ABC, the differential evolution (DE) mechanism is introduced to employed bee phase, roulette selection strategy is replaced by tournament selection strategy and a new formula is used to simulate onlooker bee’s behaviour. A discrete open crack is used for vibration analysis of the cracked beam and only the changes in the first few natural frequencies are utilized to establish the objective function of the optimization problem for crack identification. A numerical simulation and an experimental work are studied to illustrate the efficiency of the proposed method. Studies show that the present techniques can produce more accurate damage identification results when compared with original ABC, DE algorithm, particle swarm optimization and genetic algorithm.     

Automatic text classification using BPLion-neural network and semantic word processing

Text mining has become a major research topic in which text classification is the important task for finding the relevant information from the new document. Accordingly, this paper presents a semantic word processing technique for text categorization that utilizes semantic keywords, instead of using independent features of the keywords in the documents. Hence, the dimensionality of the search space can be reduced. Here, the Back Propagation Lion algorithm (BP Lion algorithm) is also proposed to overcome the problem in updating the neuron weight. The proposed text classification methodology is experimented over two data sets, namely, 20 Newsgroup and Reuter. The performance of the proposed BPLion is analysed, in terms of sensitivity, specificity, and accuracy, and compared with the performance of the existing works. The result shows that the proposed BPLion algorithm and semantic processing methodology classifies the documents with less training time and more classification accuracy of 90.9%.     

Feed‐forward neural network optimized by hybridization of PSO and ABC for abnormal brain detection

Automated and accurate classification of MR brain images is of crucially importance for medical analysis and interpretation. We proposed a novel automatic classification system based on particle swarm optimization (PSO) and artificial bee colony (ABC), with the aim of distinguishing abnormal brains from normal brains in MRI scanning. The proposed method used stationary wavelet transform (SWT) to extract features from MR brain images. SWT is translation‐invariant and performed well even the image suffered from slight translation. Next, principal component analysis (PCA) was harnessed to reduce the SWT coefficients. Based on three different hybridization methods of PSO and ABC, we proposed three new variants of feed‐forward neural network (FNN), consisting of IABAP‐FNN, ABC‐SPSO‐FNN, and HPA‐FNN. The 10 runs of K‐fold cross validation result showed the proposed HPA‐FNN was superior to not only other two proposed classifiers but also existing state‐of‐the‐art methods in terms of classification accuracy. In addition, the method achieved perfect classification on Dataset‐66 and Dataset‐160. For Dataset‐255, the 10 repetition achieved average sensitivity of 99.37%, average specificity of 100.00%, average precision of 100.00%, and average accuracy of 99.45%. The offline learning cost 219.077 s for Dataset‐255, and merely 0.016 s for online prediction. Thus, the proposed SWT + PCA + HPA‐FNN method excelled existing methods. It can be applied to practical use.     

一种高阶精度人工边界条件:出平面外域波动问题

针对无限外域中的出平面波动问题,提出一种用于近场波动有限元分析的高阶精度人工边界条件。首先,采用变量分离法求解远场初边值问题,建立了时空全局的精确动力刚度人工边界条件;然后,发展了一种由有理函数近似和辅助变量实现构成的时间局部化方法,并将其应用于动力刚度人工边界条件,得到时间局部的高阶精度人工边界条件;最后,沿人工边界离散高阶精度人工边界条件,并将其与近场集中质量有限元方程耦合,形成对称的时间二阶常微分方程组,采用一种新的显式时间积分方法进行求解。数值算例表明:提出的高阶精度人工边界条件精确、高效、稳定并且容易在现有的有限元代码中实现。