Hybrid Hierarchical Particle Swarm Optimization with Evolutionary Artificial Bee Colony Algorithm for Task Scheduling in Cloud Computing

Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.

Optimal Location and Sizing ofMulti-Resource Distributed Generator Based onMulti-Objective Artificial Bee Colony Algorithm

Distribution generation(DG)technology based on a variety of renewable energy technologies has developed rapidly.A large number of multi-type DG are connected to the distribution network(DN),resulting in a decline in the stability of DN operation.It is urgent to find a method that can effectively connect multi-energy DG to DN.photovoltaic(PV),wind power generation(WPG),fuel cell(FC),and micro gas turbine(MGT)are considered in this paper.A multi-objective optimization model was established based on the life cycle cost(LCC)of DG,voltage quality,voltage fluctuation,system network loss,power deviation of the tie-line,DG pollution emission index,and meteorological index weight of DN.Multi-objective artificial bee colony algorithm(MOABC)was used to determine the optimal location and capacity of the four kinds of DG access DN,and compared with the other three heuristic algorithms.Simulation tests based on IEEE 33 test node and IEEE 69 test node show that in IEEE 33 test node,the total voltage deviation,voltage fluctuation,and system network loss of DN decreased by 49.67%,7.47%and 48.12%,respectively,compared with that without DG configuration.In the IEEE 69 test node,the total voltage deviation,voltage fluctuation and system network loss of DN in the MOABC configuration scheme decreased by 54.98%,35.93%and 75.17%,respectively,compared with that without DG configuration,indicating that MOABC can reasonably plan the capacity and location of DG.Achieve the maximum trade-off between DG economy and DN operation stability.

The improved artificial bee colony algorithm for mixed additive and multiplicative random error model and the bootstrap method for its precision estimation

To solve the complex weight matrix derivative problem when using the weighted least squares method to estimate the parameters of the mixed additive and multiplicative random error model(MAM error model),we use an improved artificial bee colony algorithm without derivative and the bootstrap method to estimate the parameters and evaluate the accuracy of MAM error model.The improved artificial bee colony algorithm can update individuals in multiple dimensions and improve the cooperation ability between individuals by constructing a new search equation based on the idea of quasi-affine transformation.The experimental results show that based on the weighted least squares criterion,the algorithm can get the results consistent with the weighted least squares method without multiple formula derivation.The parameter estimation and accuracy evaluation method based on the bootstrap method can get better parameter estimation and more reasonable accuracy information than existing methods,which provides a new idea for the theory of parameter estimation and accuracy evaluation of the MAM error model.

Hybridizing Artificial Bee Colony with Bat Algorithm for Web Service Composition

In the Internet of Things(IoT),the users have complex needs,and the Web Service Composition(WSC)was introduced to address these needs.The WSC’s main objective is to search for the optimal combination of web services in response to the user needs and the level of Quality of Services(QoS)constraints.The challenge of this problem is the huge number of web services that achieve similar functionality with different levels of QoS constraints.In this paper,we introduce an extension of our previous works on the Artificial Bee Colony(ABC)and Bat Algorithm(BA).A new hybrid algorithm was proposed between the ABC and BA to achieve a better tradeoff between local exploitation and global search.The bat agent is used to improve the solution of exhausted bees after a threshold(limits),and also an Elitist Strategy(ES)is added to BA to increase the convergence rate.The performance and convergence behavior of the proposed hybrid algorithm was tested using extensive comparative experiments with current state-ofthe-art nature-inspired algorithms on 12 benchmark datasets using three evaluation criteria(average fitness values,best fitness values,and execution time)that were measured for 30 different runs.These datasets are created from real-world datasets and artificially to form different scale sizes of WSC datasets.The results show that the proposed algorithm enhances the search performance and convergence rate on finding the near-optimal web services combination compared to competitors.TheWilcoxon signed-rank significant test is usedwhere the proposed algorithm results significantly differ fromother algorithms on 100%of datasets.

Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization

Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony （DABC） algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.

Improved artificial bee colony algorithm with mutual learning

The recently invented artificial bee colony （ABC） al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs well in most cases, however, there still exists an insufficiency in the ABC algorithm that ignores the fitness of related pairs of individuals in the mechanism of find- ing a neighboring food source. This paper presents an improved ABC algorithm with mutual learning （MutualABC） that adjusts the produced candidate food source with the higher fitness between two individuals selected by a mutual learning factor. The perfor- mance of the improved MutualABC algorithm is tested on a set of benchmark functions and compared with the basic ABC algo- rithm and some classical versions of improved ABC algorithms. The experimental results show that the MutualABC algorithm with appropriate parameters outperforms other ABC algorithms in most experiments.

Archimedean copula estimation of distribution algorithm based on artificial bee colony algorithm

The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.

A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling

A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.

Codebook design using improved particle swarm optimization based on selection probability of artificial bee colony algorithm

In the paper, a new selection probability inspired by artificial bee colony algorithm is introduced into standard particle swarm optimization by improving the global extremum updating condition to enhance the capability of its overall situation search. The experiment result shows that the new scheme is more valuable and effective than other schemes in the convergence of codebook design and the performance of codebook, and it can avoid the premature phenomenon of the particles.

A blockchain bee colony double inhibition labor division algorithm for spatio-temporal coupling task with application to UAV swarm task allocation

It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.

Selective Harmonics Elimination Technique for Artificial Bee Colony Implementation

In this research,an Artificial Bee Colony(ABC)algorithm based Selective Harmonics Elimination(SHE)technique is used as a pulse generator in a reduced switch fifteen level inverter that receives input from a PV system.Pulse width modulation based on Selective Harmonics Elimination is mostly used to suppress lower-order harmonics.A high gain DC-DC-SEPIC converter keeps the photovoltaic(PV)panel’s output voltage constant.The Grey Wolf Optimization(GWO)filter removes far more Photovoltaic panel energy from the sunlight frame.To eliminate voltage harmonics,this unique inverter architecture employs a multi-carrier duty cycle,a high-frequency modulation approach.The proposed ABC harmonics elimination approach is compared to SHE strategies based on Particle Swarm Optimization(PSO)and Flower Pollination Algorithm(FPA).The suggested system’s performance is simulated and measured using the MATLAB simulation tool.The proposed ABC approach has a THD level of 4.86%,which is better than the PSO and FPA methods.

An improved bearing fault detection strategy based on artificial bee colony algorithm

The operating state of bearing affects the performance of rotating machinery;thus,how to accurately extract features from the original vibration signals and recognise the faulty parts as early as possible is very critical.In this study,the one‐dimensional ternary model which has been proved to be an effective statistical method in feature selection is introduced and shapelet transformation is proposed to calculate the parameter of one‐dimensional ternary model that is usually selected by trial and error.Then XGBoost is used to recognise the faults from the obtained features,and artificial bee colony algorithm(ABC)is introduced to optimise the parameters of XGBoost.Moreover,for improving the performance of intelligent algorithm,an improved strategy where the evolution is guided by the probability that the optimal solution appears in certain solution space is proposed.The experimental results based on the failure vibration signal samples show that the average accuracy of fault signal recognition can reach 97%,which is much higher than the ones corresponding to traditional extraction strategies.And with the help of improved ABC algorithm,the performance of XGBoost classifier could be optimised;the accuracy could be improved from 97.02%to 98.60%compared with the traditional classification strategy.

An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers

An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.

Artificial Bee Colony Algorithm-based Parameter Estimation of Fractional-order Chaotic System with Time Delay

It is an important issue to estimate parameters of fractional-order chaotic systems in nonlinear science, which has received increasing interest in recent years. In this paper, time delay and fractional order as well as system's parameters are concerned by treating the time delay and fractional order as additional parameters. The parameter estimation is converted into a multi-dimensional optimization problem. A new scheme based on artificial bee colony ABC algorithm is proposed to solve the optimization problem. Numerical experiments are performed on two typical time-delay fractional-order chaotic systems to verify the effectiveness of the proposed method. © 2014 Chinese Association of Automation.

Aeroengine Nonlinear Sliding Mode Control Based on Artificial Bee Colony Algorithm

For a class of aeroengine nonlinear systems,a novel nonlinear sliding mode controller(SMC)design method based on artificial bee colony(ABC)algorithm is proposed.In view of the strong nonlinearity and uncertainty of aeroengines,sliding mode control strategy is adopted to design controller for the aeroengine.On basis of exact linearization approach,the nonlinear sliding mode controller is obtained conveniently.By using ABC algorithm,the parameters in the designed controller can be tuned to achieve optimal performance,resulting in a closedloop system with satisfactory dynamic performance and high steady accuracy.Simulation on an aeroengine verifies the effectiveness of the presented method.

Application of Improved Artificial Bee Colony Algorithm in Urban Vegetable Distribution Route Optimization

According to the characteristics and requirements of urban vegetable logistics and distribution, the optimization model is established to achieve the minimum distribution cost of distribution center. The algorithm of artificial bee colony is improved, and the algorithm based on MATLAB software is designed to solve the model successfully. At the same time, combined with the actual case, the two algorithms are compared to verify the effectiveness of the improved artificial bee colony algorithm in the optimization of urban vegetable distribution path.

S-box:six-dimensional compound hyperchaotic map and artificial bee colony algorithm

Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.

Structural Damage Detection Using a Modified Artificial Bee Colony Algorithm

An optimization approach based on Artificial Bee Colony(ABC)algorithm is proposed for structural local damage detection in this study.The objective function for the damage identification problem is established by structural parameters and modal assurance criteria(MAC).The ABC algorithm is presented to solve the certain objective function.Then the Tournament Selection Strategy and chaotic search mechanism is adopted to enhance global search ability of the certain algorithm.A coupled double-beam system is studied as numerical example to illustrate the correctness and efficiency of the propose method.The simulation results show that the modified ABC algorithm can identify the local damage of the structural system efficiently even under measurement noise,which demonstrates the proposed algorithm has a higher damage diagnosis precision.

Service Composition Instantiation Based on Cross-Modified Artificial Bee Colony Algorithm

Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Artificial Bee Colony Algorithm(CMABC) is proposed to achieve the optimal solution services in an acceptable time and high accuracy. Firstly, web service instantiation model was established. What is more, to overcome the problem of discrete and chaotic solution space, the global optimal solution was used to accelerate convergence rate by imitating the cross operation of Genetic algorithm(GA). The simulation experiment result shows that CMABC exhibited faster convergence speed and better convergence accuracy than some other intelligent optimization algorithms.