共查询到17条相似文献,搜索用时 78 毫秒
1.
移动通信网络中频率资源是有限的,为了提高无线资源的利用率,将改进的人工蜂群算法用于解决无线信道分配问题。提出的算法用逐步减小邻域搜索范围的动态步长来均衡局部与全局搜索能力;对单个体引入选择性变异技术,增加了种群的多样性,加快了算法的收敛速度。仿真结果表明,改进后的算法能较好地解决无线信道分配问题,提高了算法的收敛率和收敛速度。 相似文献
2.
标准人工蜂群算法由于局部搜索能力差,收敛精度低,容易陷入早熟收敛等缺陷,从而求解最小值函数优化问题的能力受到限制。为了解决标准人工蜂群算法的以上问题,提出了一种改进的人工蜂群算法。该算法将混沌算子引入雇佣蜂和跟随蜂基于当前最优解的局部搜索策略中,并赋予跟随蜂细菌的趋药性,从而
提高了人工蜂群算法的局部搜索能力。在6个测试函数上的仿真结果表明,该算法能有效地避免陷入局部最优,并使收敛精度得到显著提高。 相似文献
提高了人工蜂群算法的局部搜索能力。在6个测试函数上的仿真结果表明,该算法能有效地避免陷入局部最优,并使收敛精度得到显著提高。 相似文献
3.
平面p-center问题是经典的NP难题,所以寻找高效的近似求解算法是解决实际应用问题时的基本需求。在人工蜂群算法的基础上,通过引入遗传算法的交叉和变异算子,改进局部解的搜索策略与搜索能力,即根据给定概率对当前解做交叉或变异运算,以获得更好的局部解,进而提出BeeGenP启发式求解算法,用于求解平面离散型p-center问题。通过构造测试数据,对所设计的算法进行了有效性验证,实验结果表明,BeeGenP算法与现有的M-ABC算法相比,算法的局部解搜索能力得到了提升,增加了搜索空间的多样性,在相同迭代次数约束下所得到的解的质量更高,而趋近收敛于最优解时的迭代次数则有较大幅度的降低。 相似文献
4.
针对分布式柔性作业车间调度问题的特点,提出一种改进人工蜂群算法.首先,建立以最小化最大完工时间为优化目标的分布式柔性作业车间调度优化模型;然后,改进基本人工蜂群算法以使其适用于求解分布式柔性作业车间调度问题,具体的改进包括设计一种包含三维向量的编码方案,结合问题特点针对性地设计多种策略用于种群初始化,在雇佣蜂改良搜索操作中设计多种有效的进化操作算子,并在跟随蜂搜索操作中引入基于关键路径的局部搜索算子以提升算法的局部搜索能力;最后,利用扩展柔性作业车间通用测试集得到的测试数据设计实验验证算法性能,使用正交试验法优化算法参数设置.仿真实验结果表明,改进后的人工蜂群算法能有效求解分布式柔性作业车间调度问题. 相似文献
5.
求解函数优化问题的改进的人工蜂群算法 总被引:1,自引:0,他引:1
为提高人工蜂群算法求解复杂函数优化问题的性能,分析了算法中侦察蜂逃逸行为的不足,并对其进行改进:定义了逃逸指标,使其能准确地反映个体状态对算法早熟的影响;重新设计选择机制,让侦察蜂不需要参数控制,能自适应地选择可能导致算法早熟收敛的个体执行逃逸操作;改进了逃逸算子,降低了逃逸操作的盲目性。通过9个典型测试问题的实验结果表明:在指定误差精度下,本改进算法均能有效收敛;同时与基本人工蜂群算法和已有的典型改进相比,本改进算法在收敛精度和速度上均有明显提高。说明提出的改进策略能有效提高算法求解复杂函数优化问题的能力。 相似文献
6.
针对多目标连续优化问题,依据人工蜂群算法原理给出其求解流程,并指出算法中更新策略存在盲目搜索和丢失优秀个体的不足,随后提出改进方案。改进方案包含两部分:首先,设计一种自适应搜索算子,使算法在运行过程中能根据个体质量自动调节搜索范围,让算法搜索行为准确高效;其次,利用外部集合记录下新产生的个体,一次迭代完成后结合外部集合重新构造种群,让算法能有效地保存进化过程中产生的优秀个体。实验中将改进人工蜂群算法与NSGA2算法、改进前算法以及文献报道的同类优秀算法进行了比较,结果说明:改进人工蜂群算法在求解多目标连续优化问题中具有良好的收敛性和均匀性。 相似文献
7.
摘要:针对指路标志指引路径规划问题,提出了一种基于改进人工蜂群算法的求解方法。首先,基于路网拓扑表达,对指路标志指引路径规划问题进行论述;其次,考虑指路标志指引路径规划问题的离散型特点,设计了人工蜂群算法求解的具体的方法和步骤;为了提高人工蜂群算法求解指路标志指引路径规划问题的收敛速度和寻优性能,引入遗传交叉因子、精英保留策略和动态侦查蜂机制对传统人工蜂群算法进行改进;最后,选取广州市大学城作为试验区域,将改进的人工蜂群算法用于求解指路标志指引路径规划问题,试验结果表明:改进后的算法有效的解决了传统人工蜂群算法在求解指路标志指引路径规划问题时收敛速度慢、易早熟等的缺陷,更具可行性。 相似文献
8.
针对人工蜂群算法有时收敛速度较慢和探索能力较强而开发能力不足等问题,提出一种改进的人工蜂群(IABC)算法。该算法在跟随蜂阶段采用一种基于当前局部最优解(pbest)的搜索策略,能提高算法的局部搜索能力。为了加快算法的收敛速度,采用基于一般的反向学习的策略进行种群初始化,而且采蜜蜂和跟随蜂进行邻域搜索时,邻域搜索的维数根据循环代数动态调整。基于十个标准测试函数的仿真结果表明,该算法能有效加快收敛速度,局部优化能力有显著提高。 相似文献
9.
模糊柔性作业车间调度问题(FFJSP)是柔性作业车间调度问题(FJSP)的拓展,具有很强的现实意义.针对FFJSP,本文提出了一种基于领域搜索的改进人工蜂群算法.该算法以最小化最大模糊完工时间为目标.首先,为了提高初始种群的多样性,引入混沌理论来初始化种群.其次,为了提高算法的局部搜索能力,采用4种邻域结构对蜜源进行邻域搜索.为了进一步优化蜜源和加快种群的收敛速度,采用了一种新颖的交叉操作.并且在解码的过程中采用左移策略,从而很好地利用机器的空闲时间.最后,选取了3组通用数据集来测试算法的性能,并与代表性算法进行比较.结果表明,对于大部分实例,本文所提出的的算法的结果要优于与之对比的算法. 相似文献
10.
针对传统人工智能算法早熟收敛问题, 基于模糊化处理和蜂群寻优的特点, 提出一种模糊人工蜂群算法, 将模糊输入/输出机制引入到算法中来保持蜜源访问概率的动态更新。根据算法计算过程中的不同阶段对蜜源访问概率有效调整, 避免算法陷入局部极值。通过对旅行商问题的仿真实验和与其他算法的比较来验证算法的性能。计算结果表明, 该算法有良好的鲁棒性和有效性。 相似文献
11.
12.
Xiaolong LIU Jinchao LIANG De-Yu LIU Riqing CHEN Shyan-Ming YUAN 《Frontiers of Computer Science》2022,16(1):161103
It is of great significance for headquarters in warfare to address the weapon-target assignment(WTA)problem with distributed computing nodes to attack targets simultaneously from different weapon units.However,the computing nodes on the battlefield are vulnerable to be attacked and the communication environment is usually unreliable.To solve the WTA problems in unreliable environments,this paper proposes a scheme based on decentralized peer-to-peer architecture and adapted artificial bee colony(ABC)optimization algorithm.In the decentralized architecture,the peer computing node is distributed to each weapon units and the packet loss rate is used to simulate the unreliable communication environment.The decisions made in each peer node will be merged into the decision set to carry out the optimal decision in the decentralized system by adapted ABC algorithm.The experimental results demonstrate that the decentralized peer-to-peer architecture perform an extraordinary role in the unreliable communication environment.The proposed scheme preforms outstanding results of enemy residual value(ERV)with the packet loss rate in the range from 0 to 0.9. 相似文献
13.
14.
This paper proposed a penalty guided artificial bee colony algorithm (ABC) to solve the reliability redundancy allocation problem (RAP). The redundancy allocation problem involves setting reliability objectives for components or subsystems in order to meet the resource consumption constraint, e.g. the total cost. RAP has been an active area of research for the past four decades. The difficulty that one is confronted with the RAP is the maintenance of feasibility with respect to three nonlinear constraints, namely, cost, weight and volume related constraints. In this paper nonlinearly mixed-integer reliability design problems are investigated where both the number of redundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously so as to maximize the reliability of the system. The reliability design problems have been studied in the literature for decades, usually using mathematical programming or heuristic optimization approaches. To the best of our knowledge the ABC algorithm can search over promising feasible and infeasible regions to find the feasible optimal/near-optimal solution effectively and efficiently; numerical examples indicate that the proposed approach performs well with the reliability redundant allocation design problems considered in this paper and computational results compare favorably with previously-developed algorithms in the literature. 相似文献
15.
在蜂窝移动通信网络中,为了应用有限的可用频谱来满足不断增长的客户需求,运用一定的优化算法合理规划频率资源显得尤为重要。针对这一问题,提出了一种改进的人工鱼群算法。算法引入了变异算子,来增强种群的多样性;采用动态调整步长,较好地平衡了全局和局部搜索能力;用整个人工鱼群的中心位置和全局极值位置代替人工鱼邻域中心位置和邻域极值位置,从而减少了算法的计算量,提高了运算精度。仿真结果表明,改进后的算法能够很好地解决频率分配问题,提高了算法的收敛率和收敛速度。 相似文献
16.
Multi-objective optimization has been a difficult problem and a research focus in the field of science and engineering. This paper presents a novel multi-objective optimization algorithm called elite-guided multi-objective artificial bee colony (EMOABC) algorithm. In our proposal, the fast non-dominated sorting and population selection strategy are applied to measure the quality of the solution and select the better ones. The elite-guided solution generation strategy is designed to exploit the neighborhood of the existing solutions based on the guidance of the elite. Furthermore, a novel fitness calculation method is presented to calculate the selecting probability for onlookers. The proposed algorithm is validated on benchmark functions in terms of four indicators: GD, ER, SPR, and TI. The experimental results show that the proposed approach can find solutions with competitive convergence and diversity within a shorter period of time, compared with the traditional multi-objective algorithms. Consequently, it can be considered as a viable alternative to solve the multi-objective optimization problems. 相似文献
17.
One of the most well-known binary (discrete) versions of the artificial bee colony algorithm is the similarity measure based discrete artificial bee colony, which was first proposed to deal with the uncapacited facility location (UFLP) problem. The discrete artificial bee colony simply depends on measuring the similarity between the binary vectors through Jaccard coefficient. Although it is accepted as one of the simple, novel and efficient binary variant of the artificial bee colony, the applied mechanism for generating new solutions concerning to the information of similarity between the solutions only consider one similarity case i.e. it does not handle all similarity cases. To cover this issue, new solution generation mechanism of the discrete artificial bee colony is enhanced using all similarity cases through the genetically inspired components. Furthermore, the superiority of the proposed algorithm is demonstrated by comparing it with the basic discrete artificial bee colony, binary particle swarm optimization, genetic algorithm in dynamic (automatic) clustering, in which the number of clusters is determined automatically i.e. it does not need to be specified in contrast to the classical techniques. Not only evolutionary computation based algorithms, but also classical approaches such as fuzzy C-means and K-means are employed to put forward the effectiveness of the proposed approach in clustering. The obtained results indicate that the discrete artificial bee colony with the enhanced solution generator component is able to reach more valuable solutions than the other algorithms in dynamic clustering, which is strongly accepted as one of the most difficult NP-hard problem by researchers. 相似文献