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.

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.

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.

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.

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.

Study of Direction Probability and Algorithm of Improved Marriage in Honey Bees Optimization for Weapon Network System

To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.

A Review on Representative Swarm Intelligence Algorithms for Solving Optimization Problems:Applications and Trends

Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

On the application of artificial bee colony (ABC) algorithm for optimization of well placements in fractured reservoirs;efficiency comparison with the particle swarm optimization (PSO) methodology

The application of a recent optimization technique,the artificial bee colony(ABC),was investigated in the context of finding the optimal well locations.The ABC performance was compared with the corresponding results from the particle swarm optimization(PSO)algorithm,under essentially similar conditions.Treatment of out-of-boundary solution vectors was accomplished via the Periodic boundary condition(PBC),which presumably accelerates convergence towards the global optimum.Stochastic searches were initiated from several random staring points,to minimize starting-point dependency in the established results.The optimizations were aimed at maximizing the Net Present Value(NPV)objective function over the considered oilfield production durations.To deal with the issue of reservoir heterogeneity,random permeability was applied via normal/uniform distribution functions.In addition,the issue of increased number of optimization parameters was address,by considering scenarios with multiple injector and producer wells,and cases with deviated wells in a real reservoir model.The typical results prove ABC to excel PSO(in the cases studied)after relatively short optimization cycles,indicating the great premise of ABC methodology to be used for well-optimization purposes.

An Improved Lung Cancer Segmentation Based on Nature-Inspired Optimization Approaches

The distinction and precise identification of tumor nodules are crucial for timely lung cancer diagnosis andplanning intervention. This research work addresses the major issues pertaining to the field of medical imageprocessing while focusing on lung cancer Computed Tomography (CT) images. In this context, the paper proposesan improved lung cancer segmentation technique based on the strengths of nature-inspired approaches. Thebetter resolution of CT is exploited to distinguish healthy subjects from those who have lung cancer. In thisprocess, the visual challenges of the K-means are addressed with the integration of four nature-inspired swarmintelligent techniques. The techniques experimented in this paper are K-means with Artificial Bee Colony (ABC),K-means with Cuckoo Search Algorithm (CSA), K-means with Particle Swarm Optimization (PSO), and Kmeanswith Firefly Algorithm (FFA). The testing and evaluation are performed on Early Lung Cancer ActionProgram (ELCAP) database. The simulation analysis is performed using lung cancer images set against metrics:precision, sensitivity, specificity, f-measure, accuracy,Matthews Correlation Coefficient (MCC), Jaccard, and Dice.The detailed evaluation shows that the K-means with Cuckoo Search Algorithm (CSA) significantly improved thequality of lung cancer segmentation in comparison to the other optimization approaches utilized for lung cancerimages. The results exhibit that the proposed approach (K-means with CSA) achieves precision, sensitivity, and Fmeasureof 0.942, 0.964, and 0.953, respectively, and an average accuracy of 93%. The experimental results prove thatK-meanswithABC,K-meanswith PSO,K-meanswith FFA, andK-meanswithCSAhave achieved an improvementof 10.8%, 13.38%, 13.93%, and 15.7%, respectively, for accuracy measure in comparison to K-means segmentationfor lung cancer images. Further, it is highlighted that the proposed K-means with CSA have achieved a significantimprovement in accuracy, hence can be utilized by researchers for improved segmentation processes of medicalimage datasets for identifying the targeted region of interest.

An improved artificial bee colony-random forest(IABC-RF)model for predicting the tunnel deformation due to an adjacent foundation pit excavation

An improved artificial bee colony-random forest(IABC-RF)model is proposed for predicting the tunnel deformation due to the excavation of an adjacent foundation pit.A new search strategy of the artificial bee colony(ABC)algorithm is herein developed and incorporated,with the results showing that a much higher computational efficiency can be achieved with the new model,while high computational accuracy can also be maintained.The improved ABC algorithm is thereafter utilised and combined with the random forest(RF)model,where four important hyper-parameters are optimized,for a tunnel deformation prediction.Results are thoroughly compared with those of other prediction methods based on machine learning(ML),as well as the monitored data on the site.Via the comparisons,the validity and effectiveness of the proposed model are fully demonstrated,and a more promising perspective can be seen of the method for its potential wide applications in geotechnical engineering.

Optimization and Parameters Estimation in Ultrasonic Echo Problems Using Modified Artificial Bee Colony Algorithm

The patterns of ultrasonic backscattered echoes represent valuable information pertaining to the geometric shape, size, and orientation of the reflectors as well as the microstructure of the propagation path. Accurate estimation of the ultrasonic echo pattern is essential in determining the object or propagation path properties. This paper proposes a parameter estimation method for ultrasonic echoes based on Artificial Bee Colony （ABC） algorithm which is one of the most recent swarm intelligence based algorithms. A modified ABC （MABC） algorithm is given by adding an adjusting factor to the neighborhood search formula of traditional ABC algorithm in order to enhance its performance. The algorithm could overcome the impact of different search range on estimation accuracy to solve the multi-dimensional parameter optimization problems. The performance of the MABC algorithm is demonstrated by numerical simulation and ultrasonic detection experiments. Results show that MABC not only can accurately estimate various parameters of the ultrasonic echoes, but also can achieve the optimal solution in the global scope. The proposed algorithm also has the advantages of fast convergence speed, short running time and real-time parameters esti- mation.

Algorithms for the Optimization of Well Placements—A Comparative Study

The Artificial Bee Colony (ABC) is one of the numerous stochastic algorithms for optimization that has been written for solving constrained and unconstrained optimization problems. This novel optimization algorithm is very efficient and as promising as it is;it can be favourably compared to other optimization algorithms and in some cases, it has been proven to be better than some known algorithms (like Particle Swarm Optimization (PSO)), especially when used in Well placement optimization problems that can be encountered in the Petroleum industry. In this paper, the ABC algorithm has been modified to improve its speed and convergence in finding the optimum solution to a well placement optimization problem. The effects of variations of the control parameters for both algorithms were studied, as well as the algorithms’ performances in the cases studied. The modified ABC (MABC) algorithm gave better results than the Artificial Bee Colony algorithm. It was noticed that the performance of the ABC algorithm increased with increase in the number of its optimization agents for both algorithms studied. The modified ABC algorithm overcame the challenge posed by the use of uniformly generated random numbers with very rough NPV surface. This new modified ABC algorithm proposed in this work will be a great tool in optimization for the Petroleum industry as it involves Well placements for optimum oil production.

数控压机伺服控制系统复合控制器I-ABC与PID优化

为了提高数控压机伺服控制系统的控制精度,针对伺服控制系统运行控制过程构建数学模型,在人工蜂群算法基础上融入了云分析模型,之后采用改进人工蜂群算法(Improved Artificial Bee Colony,I-ABC)调节比例-积分-微分(Proportional Integral Differential,PID)参数,建立了一种复合控制方法。研究结果表明:以I-ABC进行PID控制时,可以使幅度差降低到0.4%,相位差基本在-0.54°之内,系统加载精度也获得了明显提升,表现出了更优的跟踪性能。以I-ABC进行PID控制时,能够对多余力起到明显抑制作用,响应速度也获得明显提升,可以有效满足系统的准确控制要求。在系统内加入干扰信号,引入I-ABC实施PID调节可以减小系统超调量,还可以获得更短调节时间,使系统获得更强抗干扰性能。

基于AIS轨迹和改进蚁群算法的船舶航线规划方法

在保证船舶航线安全的前提下,以最短航程为目标,提出基于AIS轨迹和改进蚁群算法的船舶航线规划方法。对船舶AIS数据进行预处理,去除船舶AIS数据中的冗余数据,完成船舶AIS数据提纯;采用基于粒子群与K均值混合聚类算法的核心转向点筛选与识别方法,筛选并识别船舶AIS数据中船舶航线核心转向点数据;通过基于改进蚁群算法的航线规划方法,以核心转向点数据为基础,构建航线网络,在此网络中,通过人工势场法对蚁群算法进行改进,对船舶航线进行寻优,实现船舶航线规划。经实验验证,本文方法能够规划出安全合理的船舶航线。

深中大桥东锚碇筑岛围堰基于淤泥强度动态增长的设计方法

深中通道深中大桥为主跨1 666 m的三跨钢箱梁悬索桥,其东锚碇为海中重力式锚碇,采用筑岛围堰方案施工。原筑岛围堰方案采用静态设计方法设计,采用“锁口钢管桩+工字型板桩+钢箱围箍”的组合式筑岛围堰方案。针对原方案存在的材料利用率低、结构设计尺寸偏大、结构之间受力不协调等缺点,在分析淤泥强度增长规律的基础上,提出基于淤泥强度动态增长的筑岛围堰设计方法(动态设计方法)。该方法首先确定不同施工阶段围堰支撑处土体弹簧刚度和平行钢丝索围箍等效弹性支撑刚度,然后利用响应面法建立各施工阶段自变量参数(钢管桩壁厚、钢管桩直径、围箍数量)与控制指标(钢管桩最大应力、桩顶最大位移、围箍最大应力)之间的映射关系;最后利用改进粒子群算法进行围堰结构设计参数优化。采用该动态设计方法进行设计,确定采用锁口钢管桩(直径2 000 mm、壁厚18 mm)+工字型板桩+平行钢丝索(7根,单根为184股?5 mm钢丝)柔性组合式筑岛围堰方案。采用有限元法计算静、动态设计方法下钢管桩最大应力,并与现场实测值比较。结果表明:动态设计方法下,围堰结构受力更合理,各构件应力水平更协调。

油田注水系统仿真模型参数修正方法研究

油田注水管网经过多年运行后,管道内壁由于腐蚀、结垢等原因致使其摩阻系数与原始数据不一致,导致管网平差计算和系统仿真模拟结果超出工程允许范围。由于经济原因和施工难度,不可能对整个管网节点进行压力和流量测试从而反演求解出各管段真实的摩阻系数。为此,以管网各管段摩阻系数为研究对象,以管网有限个压力测试点为已知参量,建立管网摩阻系数反演模型和测压点分布模型,利用改进的人工蜂群算法对反演模型进行最优化求解,计算结果在工程误差允许范围。

基于改进人工蜂群算法的绿色冷链物流优化

针对目前冷链物流存在的运输成本高、腐败率高以及污染物排放量高等问题,建立了考虑冷链配送过程中所产生的车辆运营成本以及碳排放的绿色冷链配送路径的优化模型。为了避免求解过程陷入局部最优,在人工蜂群算法的基础上,加入细菌觅食行为和烟花爆炸算子对其进行改进,以加快算法收敛速度和提高计算精度;将改进算法应用于生鲜产品冷链物流配送路径优化模型中,并进行实验仿真。结果显示,与传统人工蜂群算法、蚁群算法等相比较,改进后的人工蜂群算法所得的配送路径规划方案更优,可以更好地平衡配送及污染物排放等成本。

多策略遗传算法求解多机器人任务分配问题

针对遗传算法(genetic algorithm,GA)求解多机器人任务分配(multi-robot task allocation,MRTA)时容易陷入局部最优以及效率不高的问题,提出一种多策略遗传算法(简称DIHA-GA)实现对多个任务的合理分配。首先,采用双染色体编码策略来简化编码方式;其次,将种群分成3个部分来使种群在保持随机性的同时增强染色体的质量;再次,采用启发式交叉算子来拓展解的搜索范围,加大算法跳出局部最优的能力;最后,使用自适应交叉概率和变异概率来使算法更快找到最优解。结果表明:在任务数为20和40这2种情况下,DIHA-GA相比于混合粒子群算法(hybrid particle swarm optimization,HPSO)距离平均值分别减少了14.46 m和17.36 m,距离最小值分别减少了14.89 m和20.86 m,这说明DIHA-GA所得解更接近最优解;DIHA-GA比改进蚁群算法(improved ant colony optimization,IACO)所得距离平均值分别减少了21.32 m和18.73 m,距离最小值分别减少了23.43 m和22.32 m,这是由于IACO过早收敛并且难以跳出局部最优导致的。通过比较,验证了DIHA-GA在求解MRTA问题上的有效性。

IACO-GA-IPSO融合算法AUV三维全局路径规划

为了解决传统蚁群算法收敛速度慢,易陷入局部最优,传统粒子群算法搜索精度差,初始路径不规则等问题,提出一种融合了改进蚁群算法(IACO)、改进粒子群算法(IPSO)和遗传算法(GA)的IACO-GA-IPSO路径规划算法。首先定义三维海洋环境模型,将工作空间沿Z轴方向划分成水平的栅格平面;其次建立多标准的路径优劣评价模型;最后由融合算法规划路径:IACO算法生成次优种群,GA算法优化种群多样性,IPSO算法快速收敛到全局最优。实验结果表明,融合算法能充分发挥每种算法的优点,克服种群规模和收敛速度的矛盾,优化初始种群,提高全局搜索能力、局部搜索精度和算法运行效率,加快收敛速度并避免陷入局部最优路径。