基于智能混合策略的测试集优化

利用基于粒子群和蚁群算法的智能混合优化策略,删除冗余测试向量以解决测试集的优化问题. 利用蚁群算法的并行搜索能力构造初始解集,通过粒子群优化算法将解集维数降低,确定每次迭代的个体最优解和全局最优解,并利用新粒子信息更新信息素,最终通过多次迭代找到一个或多个最优测试集. 通过多组数据实例分析可知: 该智能混合优化策略与蚁群算法等其他测试集优化算法相比,可得到多个可行性最优测试集;与蚁群算法相比可提高收敛速度,并降低蚁群算法参数选取对收敛结果的影响,从而避免次优解的出现.     

蚁群算法在复杂系统可靠性优化中的应用

复杂系统可靠性优化问题为典型的NP-难问题.不考虑系统的具体连接形式,将每个部件视为一级,产生随机数作为网络节点, 把蚁群优化算法成功应用到复杂系统可靠性优化中,搜索到其他算法未能得到的最优解.仿真结果表明,蚁群优化算法可以在相对短的时间内较快地找到问题的最优解.蚁群优化算法与其他元启发式算法一样,可以有效克服求解组合优化的计算复杂度问题.     

求解连续空间优化问题的扩展粒子蚁群算法

扩展蚁群算法是蚁群算法创始人Dorigo提出的一种用于求解连续空间优化问题的最新蚁群算法,但该算法的收敛速度参数和局部搜索参数取值缺乏理论指导,因此其性能受算法参数影响较大.本文提出一种求解连续空间优化的扩展粒子蚁群算法,将粒子群算法嵌入到扩展蚁群算法中用于在线优化扩展蚁群算法参数,减少了参数人为调整的盲目性.从而改善扩展蚁群算法的寻径行为.通过将本文提出的算法与遗传算法、克隆选择算法、蚁群算法、扩展蚁群算法对5种典型测试函数优化的结果对比表明,本文算法在搜索速度和全局搜索能力方面均优于其它算法.     

改进蚁群算法在云环境下路径优化设计

云环境作为一种新的网络服务环境,提供大量的网络资源服务,云环境中的资源分配问题受带宽、负载以及响应时间的影响。蚁群算法是一种自适应搜索算法,对组合优化问题的解决发挥了重大的作用,但是其缺陷是容易陷入局部最优以及搜索速度慢。本文提出的蚁群优化算法,将蚁群算法和遗传算法结合起来,能够加快蚁群算法的收敛速度,提高搜索速度,降低云环境下的网络负载,使得云环境下的任务运行时间有效缩短,网络利用率明显提高。     

蚁群算法在智能LED路灯控制中的应用研究

为了优化LED路灯控制并达到有效监控,减少节点能量消耗,提升LED路灯控制中网络节点处理和传播数据的效率,本文使用蚁群算法研发一种可用在LED路灯低压配电网寻址法,能改善最优路径搜索的力度.针对计算精度低和能耗高现象,设计了蚁群算法的一种改进措施更好地免除算法陷进局部最优.算法根据PLC管理路灯性能特点构建网络拓扑结构...     

一种改进的蚁群算法求解TSP问题及实验结果分析

首先对蚁群算法的基本模型进行介绍,其次针对算法容易陷入局部最优解,在算法中加入扰动量,扩大搜索范围,从而有效控制算法陷入局部最优解。针对蚁群算法收敛速度慢,利用蚁群在最差路径上的信息,对蚁群算法信息素更新规则上进行改进。实验结果表明,提出的改进蚁群算法有效的避免程序过早的陷入局部最优解,同时提高蚁群算法的速度。     

基于粒子群-蚁群混合算法的软件测试数据生成方法研究

在用于面向路径测试用例自动生成的智能优化算法中,由于各种参数设置的数学理论基础薄弱,算法普遍存在搜索效率较低的问题。在分析粒子群算法和蚁群算法的基础上,提出的粒子群-蚁群混合算法将粒子群优化算法和蚁群信息素选择方法有机地结合起来。通过经典的路径测试实验,实验结果表明,算法在自动生成软件测试用例的搜索过程中,充分发挥了粒子群算法较强的全局搜索能力和蚁群算法的区域搜索能力,提高了软件测试用例自动生成的效率。     

基于支持向量机和改进蚁群算法的移动机器人路径规划

针对传统蚁群算法(ACO)收敛速度慢、全局搜索能力不佳、易陷入局部最优、路径不光滑及不安全等缺点,本文提出一种将改进的蚁群算法和非线性支持向量机(SVM)结合的移动机器人路径规划算法.对传统蚁群算法引入两个角度信息,增加算法的朝向性,克服局部最优问题;信息素挥发因子随迭代次数自适应调整,加快全局搜索能力和收敛速度.在此...     

基于遗传蚁群算法的测试用例集约简

为提高软件测试效率,节省回归测试成本,本文提出了一种新的约简测试用例集的算法.该算法是遗传算法和蚁群算法两种算法的结合,首先利用遗传算法的快速随机全局搜索能力,生成蚁群算法的初始信息素,然后利用蚁群算法的正反馈性,快速得到约简测试用例集的近似最优解.最后通过仿真实验验证了该算法的有效性.     

基于Dijkstra-蚁群算法的泊车系统路径规划研究

针对智能停车库中自动导引运输车(automated guided vehicle,AGV)存取车路径规划问题,提出了一种基于Dijkstra-蚁群算法(Dijkstra-ACO)的泊车系统路径规划方法.首先利用链接可视图法建立环境模型,并在此环境模型下,采用Dijkstra算法规划出AGV的初始路径;其次,通过引入节点随机选择机制、调整信息素更新方式和限定信息素阈值策略等对基本蚁群算法进行优化改进;最后,选用改进的蚁群算法对初始路径进行优化.结果显示:Dijkstra算法和混合算法均能使AGV有效避开障碍物,然后搜索到一条从起点到终点的无碰优化路径;与Dijkstra算法相比,混合算法能有效提高路径搜索效率,缩短搜索路径长度,改善搜索路径质量,表明该算法正确、可行及有效,且具有较强的全局搜索能力和较好的收敛性能,能够满足AGV存取车路径规划的要求.     

基于自适应蚁群优化的Volterra核辨识算法研究

提出了一种基于自适应蚁群优化(AACO)的Volterra核辨识方法。该方法将蚁群算法应用于Volterra时域核的辨识,并能够随着进化次数的增加,自适应调整基本蚁群算法的参数。同时,与相应的基于蚁群优化(ACO)的Volterra核辨识方法进行了对比分析。仿真结果表明,本文提出的方法与蚁群优化辨识方法不论在无噪声环境下,还是在有噪声干扰下,都能得到很好的辨识精度、收敛稳定性和较强的鲁棒抗噪性能,然而,在收敛速度方面,本文提出的方法优于蚁群优化辨识方法。     

基于改进免疫遗传优化蚁群算法的移动机器人路径寻优研究

针对移动机器人路径规划中使用蚁群算法(ACO)易陷入局部最优和收敛速度慢的问题,提出了一种适用于机器人静态路径寻优的改进免疫遗传优化蚁群算法(IMGAC)。该算法可以根据实际情况自动调整变异概率和变异方式,以及自动调节个体免疫位的长度,将通过改进的变异算子和免疫算子嵌入蚁群算法来提高全局寻优能力与收敛速度。仿真及实验表明:相比于经典ACO算法以及最大最小蚂蚁系统,IMGAC算法收敛速度更快,全局寻优能力更强。利用该算法寻找移动机器人最优路径,提高了静态路径寻优的效果和效率。     

Multiple colony ant algorithm for job-shop scheduling problem

Ant colony optimization (ACO) is a metaheuristic that takes inspiration from the foraging behaviour of a real ant colony to solve the optimization problem. This paper presents a multiple colony ant algorithm to solve the Job-shop Scheduling Problem with the objective that minimizes the makespan. In a multiple colony ant algorithm, ants cooperate to find good solutions by exchanging information among colonies which are stored in a master pheromone matrix that serves the role of global memory. The exploration of the search space in each colony is guided by different heuristic information. Several specific features are introduced in the algorithm in order to improve the efficiency of the search. Among others is the local search method by which the ant can fine-tune their neighbourhood solutions. The proposed algorithm is tested over set of benchmark problems and the computational results demonstrate that the multiple colony ant algorithm performs well on the benchmark problems.     

Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem

This article uses a hybrid optimization approach to solve the discrete facility layout problem (FLP), modelled as a quadratic assignment problem (QAP). The idea of this approach design is inspired by the ant colony meta-heuristic optimization method, combined with the extended great deluge (EGD) local search technique. Comparative computational experiments are carried out on benchmarks taken from the QAP-library and from real life problems. The performance of the proposed algorithm is compared to construction and improvement heuristics such as H63, HC63-66, CRAFT and Bubble Search, as well as other existing meta-heuristics developed in the literature based on simulated annealing (SA), tabu search and genetic algorithms (GAs). This algorithm is compared also to other ant colony implementations for QAP. The experimental results show that the proposed ant colony optimization/extended great deluge (ACO/EGD) performs significantly better than the existing construction and improvement algorithms. The experimental results indicate also that the ACO/EGD heuristic methodology offers advantages over other algorithms based on meta-heuristics in terms of solution quality.     

Optimal design of skeletal structures using ant colony optimization

In this article, the ant colony optimization (ACO) algorithm is employed for optimal design of skeletal structures. The advantage of using ACO lies in the fact that the discrete spaces can be optimized in a simple manner. The results of the present method are compared to those of the other optimization algorithms for some classic examples from the literature. Copyright © 2006 John Wiley & Sons, Ltd.     

A hybrid evolutionary algorithm for distribution feeder reconfiguration

Distribution feeder reconfiguration (DFR) is formulated as a multi-objective optimization problem which minimizes real power losses, deviation of the node voltages and the number of switching operations and also balances the loads on the feeders. In the proposed method, the distance (λ ₂ norm) between the vector-valued objective function and the worst-case vector-valued objective function in the feasible set is maximized. In the algorithm, the status of tie and sectionalizing switches are considered as the control variables. The proposed DFR problem is a non-differentiable optimization problem. Therefore, a new hybrid evolutionary algorithm based on combination of fuzzy adaptive particle swarm optimization (FAPSO) and ant colony optimization (ACO), called HFAPSO, is proposed to solve it. The performance of HFAPSO is evaluated and compared with other methods such as genetic algorithm (GA), ACO, the original PSO, Hybrid PSO and ACO (HPSO) considering different distribution test systems.     

基于ACO的瓦楞纸高浓磨浆过程多目标优化

目的在确保磨浆质量的前提下,提高磨浆产量、降低磨浆能耗,进而提高瓦楞纸的产量,降低生产能耗。方法在分析并建立高浓磨浆过程数学模型的基础上,针对该数学模型多目标、非线性的特点,提出一种采用编程简单、鲁棒性强的ACO(蚁群算法)对该多目标优化问题进行求解的新方法。结果 Matlab仿真结果表明,ACO在求解高浓磨浆过程多目标优化问题时,能够快速地找到符合生产工艺要求的最优解。结论基于ACO的多目标优化不仅提高了瓦楞纸制浆产量,而且降低了生产能耗。同罚函数相比,更好地实现了优质、高产、低能耗的生产目标。     

Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimization

A machine that performs both punching and laser-cutting operations is referred as combined punch-and-laser machine. Such a machine has been in the market for about two decades. Although process-planning tools have been used on such a combined machine, the optimization of process planning dedicated to combined machines, based on our literature search results, has never been directly studied. This work addresses the process-planning problem for the combined punch-and-laser machine by integrating knowledge, quantitative analysis, and numerical optimization approaches. The proposed methodology helps making decisions on following issues: (i) which type of operation should be applied to each feature, and (ii) what is the optimal operation sequence (tool path) to achieve the maximum manufacturing efficiency. The ant colony optimization (ACO) algorithms are employed in searching the optimal tool path. Sensitivities of control parameters of ACO are also analysed. Through applications, the proposed method can significantly improve the operation efficiency for the combined punch-and-laser machine. The method can also be easily automated and integrated with the nesting and G-code generation processes. Some issues and possible future research topics have also been discussed.