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.

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.

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.

Threshold Selection Method Based on Reciprocal Gray Entropy and Artificial Bee Colony Optimization

Since the logarithmic form of Shannon entropy has the drawback of undefined value at zero points,and most existing threshold selection methods only depend on the probability information,ignoring the within-class uniformity of gray level,a method of reciprocal gray entropy threshold selection is proposed based on two-dimensional(2-D)histogram region oblique division and artificial bee colony(ABC)optimization.Firstly,the definition of reciprocal gray entropy is introduced.Then on the basis of one-dimensional(1-D)method,2-D threshold selection criterion function based on reciprocal gray entropy with histogram oblique division is derived.To accelerate the progress of searching the optimal threshold,the recently proposed ABC optimization algorithm is adopted.The proposed method not only avoids the undefined value points in Shannon entropy,but also achieves high accuracy and anti-noise performance due to reasonable 2-D histogram region division and the consideration of within-class uniformity of gray level.A large number of experimental results show that,compared with the maximum Shannon entropy method with 2-D histogram oblique division and the reciprocal entropy method with 2-D histogram oblique division based on niche chaotic mutation particle swarm optimization(NCPSO),the proposed method can achieve better segmentation results and can satisfy the requirement of real-time processing.

A Discrete Multi‑Objective Artificial Bee Colony Algorithm for a Real‑World Electronic Device Testing Machine Allocation Problem

With the continuous development of science and technology,electronic devices have begun to enter all aspects of human life,becoming increasingly closely related to human life.Users have higher quality requirements for electronic devices.Electronic device testing has gradually become an irreplaceable engineering process in modern manufacturing enterprises to guarantee the quality of products while preventing inferior products from entering the market.Considering the large output of electronic devices,improving the testing efficiency while reducing the testing cost has become an urgent problem to be solved.This study investigates the electronic device testing machine allocation problem(EDTMAP),aiming to improve the production of electronic devices and reduce the scheduling distance among testing machines through reasonable machine allocation.First,a mathematical model was formulated for the EDTMAP to maximize both production and the scheduling distance among testing machines.Second,we developed a discrete multi-objective artificial bee colony(DMOABC)algorithm to solve EDTMAP.A crossover operator and local search operator were designed to improve the exploration and exploitation of the algorithm,respectively.Numerical experiments were conducted to evaluate the performance of the proposed algorithm.The experimental results demonstrate the superiority of the proposed algorithm compared with the non-dominated sorting genetic algorithm II(NSGA-II)and strength Pareto evolutionary algorithm 2(SPEA2).Finally,the mathematical model and DMOABC algorithm were applied to a real-world factory that tests radio-frequency modules.The results verify that our method can significantly improve production and reduce the scheduling distance among testing machines.

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.

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.

Quantum-Inspired Bee Colony Algorithm

To enhance the performance of the artificial bee colony optimization by integrating the quantum computing model into bee colony optimization, we present a quantum-inspired bee colony optimization algorithm. In our method, the bees are encoded with the qubits described on the Bloch sphere. The classical bee colony algorithm is used to compute the rotation axes and rotation angles. The Pauli matrices are used to construct the rotation matrices. The evolutionary search is achieved by rotating the qubit about the rotation axis to the target qubit on the Bloch sphere. By measuring with the Pauli matrices, the Bloch coordinates of qubit can be obtained, and the optimization solutions can be presented through the solution space transformation. The proposed method can simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method is obviously superior to the classical one for some benchmark functions.

Optimal Placement and Sizing of Distributed Energy Generation in an Electrical Network Using the Hybrid Algorithm of Bee Colonies and Newton Raphson

Distributed generation (DG) is gaining in importance due to the growing demand for electrical energy and the key role it plays in reducing actual energy losses, lowering operating costs and improving voltage stability. In this paper, we propose to inject distributed power generation into a distribution system while minimizing active energy losses. This injection should be done at a grid node (which is a point where energy can be injected into or recovered from the grid) that will be considered the optimal node when total active losses in the radial distribution system are minimal. The focus is on meeting energy demand using renewable energy sources. The main criterion is the minimization of active energy losses during injection. The method used is the algorithm of bee colony (ABC) associated with Newtonian energy flow transfer equations. The method has been implemented in MATLAB for optimal node search in IEEE 14, 33 and 57 nodes networks. The active energy loss results of this hybrid algorithm were compared with the results of previous searches. This comparison shows that the proposed algorithm allows to have reduced losses with the power injected that we have found.

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.

Hybrid Power Bank Deployment Model for Energy Supply Coverage Optimization in Industrial Wireless Sensor Network

Energy supply is one of the most critical challenges of wireless sensor networks(WSNs)and industrial wireless sensor networks(IWSNs).While research on coverage optimization problem(COP)centers on the network’s monitoring coverage,this research focuses on the power banks’energy supply coverage.The study of 2-D and 3-D spaces is typical in IWSN,with the realistic environment being more complex with obstacles(i.e.,machines).A 3-D surface is the field of interest(FOI)in this work with the established hybrid power bank deployment model for the energy supply COP optimization of IWSN.The hybrid power bank deployment model is highly adaptive and flexible for new or existing plants already using the IWSN system.The model improves the power supply to a more considerable extent with the least number of power bank deployments.The main innovation in this work is the utilization of a more practical surface model with obstacles and training while improving the convergence speed and quality of the heuristic algorithm.An overall probabilistic coverage rate analysis of every point on the FOI is provided,not limiting the scope to target points or areas.Bresenham’s algorithm is extended from 2-D to 3-D surface to enhance the probabilistic covering model for coverage measurement.A dynamic search strategy(DSS)is proposed to modify the artificial bee colony(ABC)and balance the exploration and exploitation ability for better convergence toward eliminating NP-hard deployment problems.Further,the cellular automata(CA)is utilized to enhance the convergence speed.The case study based on two typical FOI in the IWSN shows that the CA scheme effectively speeds up the optimization process.Comparative experiments are conducted on four benchmark functions to validate the effectiveness of the proposed method.The experimental results show that the proposed algorithm outperforms the ABC and gbest-guided ABC(GABC)algorithms.The results show that the proposed energy coverage optimization method based on the hybrid power bank deployment model generates more accurate results than the results obtained by similar algorithms(i.e.,ABC,GABC).The proposed model is,therefore,effective and efficient for optimization in the IWSN.

改进多目标蜂群算法优化洗出运动及仿真实验

针对经典洗出算法参数选择不当导致信号缺失,引起失真,影响洗出效果等问题,提出一种改进的多目标人工蜂群算法,利用该算法对经典洗出算法中的滤波器参数进行优化来改善洗出算法的洗出效果。针对传统蜂群算法初始化和局部优化中存在的问题,引入Circle映射和Pareto局部优化算法;建立人体感知误差模型、加速度差值模型、位移模型,将模型函数作为目标函数,用改进后的多目标人工蜂群算法对经典洗出算法进行参数优化;建立仿真模型对优化后的洗出算法进行仿真验证,应用飞行模拟器运动实验平台进行实验验证。结果表明:经优化后的洗出算法,洗出逼真度得到有效提升,降低了误差峰值,改善了相位延迟,节省了运动空间。

基于改进人工蜂群算法的边缘服务器部署策略

作为移动边缘计算架构部署的第一步,边缘服务器的部署是基础和关键,其部署位置与用户体验和系统性能密切相关,但是目前较少有研究关注该问题。研究无线城域网中移动边缘计算环境下的边缘服务器部署问题,以最小化响应时间为目标,将边缘服务器部署问题定义为一个优化问题,并提出基于交叉的全局人工蜂群算法求解边缘服务器部署的最优解以降低系统的平均响应时间。充分的实验结果表明,所提算法能够有效降低系统响应时间,算法性能优于其他代表性部署算法。

轨道交通单线接运电动公交调度优化模型

针对乘客由轨道交通换乘接运电动公交过程中等待时间长、候车成本高等问题,提出一种面向高峰时段乘客换乘情况的轨道交通接运电动公交的时刻表优化方法。通过分析换乘过程,以换乘乘客等候时间成本、换乘失败成本、电动公交使用成本和充电成本共4项成本之和最小为目标函数,以电动公交的发车顺序、换乘乘客的等待意愿、电动公交充放电特性对行驶里程产生的影响等作为约束条件,构建混合整数非线性规划模型。在接运公交的运输需求方面,考虑了除换乘乘客外本地乘客出行需求变化对接运电动公交时刻表的影响。最后提出一种混合人工蜂群算法求解模型,通过与遗传算法、粒子群算法的对比,进行了算法的敏感性分析。结果表明:目标函数总成本为1355.32元,相比原成本降低了23.56%,其中,换乘乘客等候时间成本为298.17元,换乘失败成本为84.03元,公交公司运营成本为867.40元,电动公交充电成本为105.71元,验证了构建的模型对时刻表优化问题的有效性。

基于分级思想的多级蚁态蚁群改进算法

广泛应用于经典NP难问题即旅行商问题(Traveling Salesman Problem,TSP)的蚁群优化(Ant Colony Optimization,ACO)算法存在容易陷入局部最优、收敛速度慢等问题,但其采用正反馈机制并具备较强的鲁棒性,适合与其他算法相融合从而改进优化。基于此,引入人工蜂群的分级思想,提出了一种多级蚁态的蚁群改进(Multistage State Ant Colony Optimization,MSACO)算法。通过引入适应度算子将传统单蚁态蚁群划分为王蚁、被雇佣蚁和非雇佣蚁,并且在每次迭代后重新分配身份以动态维持多级蚁态。王蚁寻找最优路径即最优食物源,被雇佣蚁负责路径构建,非雇佣蚁进行局部优化。为了使非雇佣蚁更有效地获得优质解,提出了一种固定邻域优化算法。实验结果表明,在TSPLIB库的7个数据集中,MSACO均可以达到理论最优解程度,较其他改进算法的最优解迭代次数与运行时间可以减少约40%与50%。

基于改进人工蜂群算法的人机协作装配线平衡优化

随着员工成本的增加,协作机器人逐步应用于装配线以独立完成或者协助员工完成装配操作。针对人机协作装配线平衡问题,构建了混合整数规划模型以优化生产节拍,该模型可精确求解小规模案例,同时提出改进人工蜂群算法求解大规模问题。该算法采用操作排序向量和装配模式向量双层编码方式以及有效的解码获得可行的调度方案,并在改进的观察蜂阶段保留较优的种群,在改进的侦察蜂阶段提升新解的性能,在局部搜索阶段提高算法的局部搜索能力。最后,通过与已有算法对比,表明改进人工蜂群算法具有优越性,可以高效求解人机协作装配线平衡问题。

液体火箭发动机涡轮泵多维度传感器优化布置

针对液体火箭发动机涡轮泵健康监测时存在的结构重要模态信息遗漏、故障敏感信息提取不全等问题,提出了一种涡轮泵传感器多维度优化布置方法,并采用故障模拟实验台进行了实验验证。首先,建立了涡轮泵待优化区域的有限元模型并开展了结构约束模态分析以及轴承故障仿真瞬态动力学分析;其次,基于离散人工蜂群算法及瞬态分析结果得出传感器布置候选点集;再次,综合传感器多维度评估方法得出最终的传感器布置方法;最后,通过实验对比分析了传感器布置方法与传统方法的综合指标。计算结果表明:相对于有效独立法,布置测点优化后,传感器监测信号的模态振型符合率提高了20.1%,对轴承故障检测的准确率提高了27.5%,验证了多维度优化布置方法具有良好的故障诊断综合性能。

分布式异构混合流水车间生产与运输集成调度

为了优化多车间协同的生产与物流集成调度问题,提出一种多目标人工蜂群算法和优化策略。优化算法采用三层编码表示车间序列、工件序列及机器档位,结合车间分配规则、机器选择策略及自动导引运输车分配规则获得问题可行解。雇佣蜂阶段设计一种基于距离选择的聚类交叉操作,保证种群多样性和解的质量;观察蜂阶段采用了基于关键车间的邻域搜索方法,在庞大解空间中实现高效搜索。侦查蜂阶段基于机器档位和工件运输顺序构建了节能调度策略,丰富非支配解集合。对比经典多目标进化算法,数值实验结果显示所提算法的有效性与优越性。