Enhanced Heap-Based Optimizer Algorithm for Solving Team Formation Problem

Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many real-world problems,such as task assignment,vehicle routing,nurse scheduling,resource allocation,and airline crew scheduling,are based on the TF problem.TF has been shown to be a Nondeterministic Polynomial time(NP)problem,and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms.This paper proposes two improved swarm-based algorithms for solving team formation problem.The first algorithm,entitled Hybrid Heap-Based Optimizer with Simulated Annealing Algorithm(HBOSA),uses a single crossover operator to improve the performance of a standard heap-based optimizer(HBO)algorithm.It also employs the simulated annealing(SA)approach to improve model convergence and avoid local minima trapping.The second algorithm is the Chaotic Heap-based Optimizer Algorithm(CHBO).CHBO aids in the discovery of new solutions in the search space by directing particles to different regions of the search space.During HBO’s optimization process,a logistic chaotic map is used.The performance of the two proposed algorithms(HBOSA)and(CHBO)is evaluated using thirteen benchmark functions and tested in solving the TF problem with varying number of experts and skills.Furthermore,the proposed algorithms were compared to well-known optimization algorithms such as the Heap-Based Optimizer(HBO),Developed Simulated Annealing(DSA),Particle SwarmOptimization(PSO),GreyWolfOptimization(GWO),and Genetic Algorithm(GA).Finally,the proposed algorithms were applied to a real-world benchmark dataset known as the Internet Movie Database(IMDB).The simulation results revealed that the proposed algorithms outperformed the compared algorithms in terms of efficiency and performance,with fast convergence to the global minimum.

Heap Based Optimization with Deep Quantum Neural Network Based Decision Making on Smart Healthcare Applications

The concept of smart healthcare has seen a gradual increase with the expansion of information technology.Smart healthcare will use a new generation of information technologies,like artificial intelligence,the Internet of Things(IoT),cloud computing,and big data,to transformthe conventional medical system in an all-around way,making healthcare highly effective,more personalized,and more convenient.This work designs a new Heap Based Optimization with Deep Quantum Neural Network(HBO-DQNN)model for decision-making in smart healthcare applications.The presented HBO-DQNN modelmajorly focuses on identifying and classifying healthcare data.In the presented HBO-DQNN model,three stages of operations were performed.Data normalization is applied to pre-process the input data at the initial stage.Next,the HBO algorithm is used in the second stage to choose an optimal set of features from the healthcare data.At last,the DQNN model is exploited for healthcare data classification.A series of experiments were carried out to portray the promising classifier results of the HBO-DQNN model.The extensive comparative study reported the improvements of the HBO-DQNN method over other existing models with maximum accuracy of 97.05%and 95.72%under the colon cancer and lymphoma dataset.

基于改进堆优化算法求解电动汽车并网动态经济调度

针对堆优化算法HBO处理含电动汽车的动态经济调度问题时存在收敛慢和精度低等问题,提出一种改进的堆优化算法RDHBO。首先,在RDHBO中引入了最优成员区域搜索和双种群交互策略。前者引导最优成员移动到更有希望的区域,提升了算法的收敛精度和收敛速度;后者充分利用被淘汰的劣势个体,丰富了种群的多样性,避免了算法陷入局部最优。然后,将RDHBO应用于四种充电场景的10机组电动汽车动态经济调度问题。仿真结果表明,与已有的代表性方法相比,RDHBO在产生低燃料成本和稳定性方面具有很强的竞争力。最后,对RDHBO的两种改进策略进行了消融实验,验证了两种改进策略的有效性。

改进的堆优化算法及其宫颈细胞数据聚类优化

常见的聚类方法存在对初始点敏感和易陷入局部最优的不足,为此提出了一种改进HBO的聚类方法。首先,提出一种改进的HBO,即扰动替换的HBO(disturbance and replacement HBO,DRHBO)克服其不足,即采用一种随机维度值替换策略和高斯扰动机制用于HBO中最优个体的状态更新,解决HBO搜索效率低的问题;提出一种正弦差分扰动策略,以突破当前个体仅与直接领导和同事进行交流的限制,从而增强搜索能力;将随机维度值替换和随机差分扰动策略融合,用于HBO中前期个体状态更新以避免其产生无效解。其次,提出一种DRHBO聚类方法,并运用到宫颈细胞数据集上以获得更好的聚类效果。大量、不同类别和不同样本的宫颈细胞数据集实验结果表明,与HBO及其改进算法和其他最先进算法相比,DRHBO的优化性能更好、稳定性更强且效率更高。DRHBO聚类方法更适应于宫颈细胞数据集。

差分扰动的堆优化算法

针对堆优化算法(HBO)在解决复杂问题时存在搜索能力不足和搜索效率低等缺陷,提出一种差分扰动的HBO--DDHBO。首先,提出一种随机差分扰动策略更新最优个体的位置,以解决HBO没有对其更新从而导致的搜索效率低的问题;其次,使用一种最优最差差分扰动策略更新最差个体的位置,以强化其搜索能力;然后,采用一种多层差分扰动策略更新一般个体的位置,以强化多层个体之间的信息交流,并提高搜索能力;最后,针对原更新模型在搜索初期获得有效解概率低的问题,提出一种基于维的差分扰动策略更新其他个体的位置。在大量CEC2017复杂函数上的实验结果表明,与HBO相比,DDHBO在96.67%的函数上具有更好的优化性能,更少的平均运行时间(3.4450s);与WRBBO(Worst opposition learning and Random-scaled differential mutation Biogeography-Based Optimization)、DEBBO(Differential Evolution and Biogeography-Based Optimization)和HGWOP(Hybrid PSO and Grey Wolf Optimizer)等先进算法相比,DDHBO也具有显著的优势。

强化信息交流的堆优化算法及其机器人路径规划

堆优化算法(HBO)是最近提出的一种新型和优秀的智能优化算法,但需完善并拓展其应用领域。针对HBO信息交流不足导致其搜索能力不强的缺陷,提出了一种改进的HBO,即强化信息交流的HBO(information interchange strengthened HBO,ISHBO)。首先,采用一种自身交流机制用于HBO中最高领导者的状态更新,解决因它无直接领导和同事无法参与搜索过程从而导致搜索效率低下的问题;其次,提出了一种精英反向交流策略和一种精英引导的自由交流策略,以突破当前个体仅与直接领导及同事交流的限制;最后,将以上两种交流策略有机融合用于HBO随机选择的三个个体的状态更新上以提高其搜索能力。大量的、不同类型的和不同维度的函数优化实验结果表明,与HBO以及其他先进算法相比,ISHBO的搜索能力更强。另外,智能优化算法用于机器人路径规划的仿真结果也表明,ISHBO在解决实际优化问题上具有更强的竞争性。

求解工程约束问题的新型智能优化算法及展望

为了研究新型智能优化算法的性能和应用前景,选择了近几年提出的6种仿生智能优化算法:哈里斯鹰优化(HHO)算法、平衡优化(EO)算法、海洋捕食者算法(MPA)、政治优化(PO)算法、黏液霉菌算法(SMA)和堆阵优化(HBO)算法,对其性能和在不同带约束的工程优化问题上的应用进行对比分析。首先,对6种优化算法的基本原理进行介绍;然后,用6种优化算法对10个基准测试函数进行寻优测试;接着,将6种优化算法用于求解3种带约束的工程优化问题。实验结果表明,对于单峰和多峰测试函数的寻优,PO的收敛精度最佳,能够多次达到理论最优值0,且收敛速度较快;对于求解工程约束问题,EO和MPA较好,因为的标准差的数量级较小,且寻优速度较快,稳定性高。最后,分析了6种优化算法的改进方法及其发展潜力。