应用改进蚁群算法求解柔性作业车间调度问题

将蚁群算法信息素更新规则进行改进,规定只有产生至今最优解的蚂蚁才能释放信息素,且只更新全局信息素,减少了传统蚁群算法的时间复杂度,提高了问题的求解效率。分析了柔性作业车间调度的特点,选取三个性能指标作为求解目标,设定其求解优先级,并建立相应的调度模型。将改进蚁群算法应用于柔性作业车间调度算例的求解,与其它算法比较,平均解有很大提高,表明了该算法求解柔性作业车间调度问题的有效性。     

DNA-蚁群算法在车辆路径优化问题中的应用

随着我国经济和科技的发展,物流配送已经成为促进经济发展的重要环节,在物流的配送过程中如何使用车辆路径的优化问题是长期困扰人们的难题,随着群智能算法发展的今天,已经有多种算法能够应用到车辆路径的最优化模拟的建立和计算中。本文通过对蚁群算法在路径最优模型的过程中的优缺点进行介绍。     

蚁群算法在广域保护分区中的应用

本文提出了一种适用于广域保护分区的蚁群算法模型,并以站闯通信可靠性以及厂站的关联度为目标函数进行计算寻解,将寻找中心站作为蚁群的聚类问题,并利用蚁群信息素寻找最优路径的过程中,以通信可靠性和节点关联度为依据来模拟蚂蚁的禁忌表和信息素更新方式,结合已经分区的中心站的影响。通过模拟子站的蚂蚁的全部遍历而对预设中心站的选择。在中心站确定后保护区域确定,并验证交叉和完整性,本文还指出了当电网系统厂站退出或进入以及运行方式改变后,系统拓扑的更新。并进行了仿真实验。结果表明,该算法能获得较为理想的保护分区,并且符合工程实际情况。     

蚁群算法的研究现状及其展望

蚁群算法是近几年优化领域中新出现的一种启发式仿生类并行智能进化系统，该算法采用分布式并行计算和正反馈机制，易于与其他方法结合，目前已经在众多组合优化领域中得到广泛应用。在介绍基本蚁群算法数学模型的基础上，列举了进入21世纪以来部分具有代表性的蚁群算法改进模型及其应用情况，然后重点从算法的模型改进、理论分析、并行实现、应用领域、硬件实现、智能融合等角度对蚁群算法在今后的研究方向作了系统分析与展望。     

基于参数动态调整策略的蚁群算法优化及应用研究

物流配送路径问题已成为现在关注的热点,寻找一种有效全局优化的算法对研究该问题起着至关重要的作用。本文提出了一种改进的蚁群算法,通过适当调整相关参数和信息素规则,试图提高算法的运算性能。并结合Matlab7.0编写程序进行仿真,基于实验结果验证了改进后的蚁群算法的高效性,为研究物流配送路径算法提供了一种新思路。     

蚁群算法在城市配送中的应用研究

蚁群算法是受自然界中真实蚁群的集体行为的启发而提出的一种基于群体的模拟进化算法,最早成功应用于解决著名的TSP问题。本文针对实际城市配送调度中的配送线路优化问题进行了分析,将蚁群算法引入配送调度管理,并对蚁群算法在城市配送管理中的应用前景进行了研究。     

改进蚁群算法在物流配送路径中的应用

针对物流配送路径优化问题的特点,分析了基本蚁群算法的不足之处,并对原有蚁群算法进行改进.同时引入"扰动因子"和"奖惩"机制,建立数学模型,进而对物流配送车辆路径问题进行了实验仿真.结果表明,改进后的蚁群算法提高了全局寻优能力与收敛速度,取得了较好的效果.     

贪婪遗传蚁群算法在沼气发电配电网中的应用

介绍传统的优化算法用于求解配电网络规划问题时的不足,深入介绍蚁群优化算法在生物质发电配网中的优点及不足。将遗传算法和蚁群算法相结合,用于沼气发电配电网的规划中,经实验结果验证,该方法有效可行。     

贪婪遗传蚁群算法在沼气发电配电网中的应用

介绍传统的优化算法用于求解配电网络规划问题时的不足,深入介绍蚁群优化算法在生物质发电配网中的优点及不足。将遗传算法和蚁群算法相结合,用于沼气发电配电网的规划中,经实验结果验证,该方法有效可行。     

一种基于改进蚁群优化算法的WSNs路由协议

面对无线传感网络(wireless sensor network,WSN)路由问题,提出新颖生物激励-自我组织的安全自适应路由协议(biological inspired self-organized secure autonomous routing protocol,BIOSARP)。BIOSARP采用改进蚁群优化算法(improved ant colony optimization,IACO),利用端到端传输时延、剩余电量和链路质量计算信息素,并据此信息决策最优转发节点,从而减小广播次数和数据包负担,降低时延、数据包丢失率和功率消耗。仿真结果表明:提出的BIOSARP在数据包传递率、能量消耗优于安全实时负荷分配协议(secure real-time load distribution,SRTLD),数据包传递率提高24.75%,能量消耗降低31.8%。     

Ant algorithm for single and multiobjective reliability optimization problems

The paper illustrates the application of the ant colony optimization algorithm to solve both continuous function and combinatorial optimization problems in reliability engineering. The ant algorithm is combined with the strength Pareto fitness assignment procedure to handle multiobjective problems. Further, a clustering procedure has been applied to prune the Pareto set and to maintain diversity. Benchmark case examples show the superiority of the ant algorithm to such problems. Copyright © 2002 John Wiley & Sons, Ltd.     

Aircraft technology portfolio optimization using ant colony optimization

Technology portfolio selection is a combinatorial optimization problem often faced with a large number of combinations and technology incompatibilities. The main research question addressed in this article is to determine if Ant Colony Optimization (ACO) is better suited than Genetic Algorithms (GAs) and Simulated Annealing (SA) for technology portfolio optimization when incompatibility constraints between technologies are present. Convergence rate, capability to find optima, and efficiency in handling of incompatibilities are the three criteria of comparison. The application problem consists of finding the best technology portfolio from 29 aircraft technologies. The results show that ACO and GAs converge faster and find optima more easily than SA, and that ACO can optimize portfolios with technology incompatibilities without using penalty functions. This latter finding paves the way for more use of ACO when the number of constraints increases, such as in the technology and concept selection for complex engineering systems.     

基于蚁群算法的试验流程优化研究

水中兵器的海上试验涉及许多人员、兵力、被试产品、测量设备等，试验周期长、消耗大，因此如何缩短试验周期是亟待研究解决的问题．文中首先将试验流程优化问题转化为车间调度问题，建立了相应的数学模型，再应用蚁群算法转移规则得到中间结果并进行排队以对各种资源约束进行处理．最后将结果利用局部搜索算法优化后作为蚁群算法信息素更新的基础．实例计算结果表明，该方法优化效果良好．     

Reliability optimization using multiobjective ant colony system approaches

The multiobjective ant colony system (ACS) meta-heuristic has been developed to provide solutions for the reliability optimization problem of series-parallel systems. This type of problems involves selection of components with multiple choices and redundancy levels that produce maximum benefits, and is subject to the cost and weight constraints at the system level. These are very common and realistic problems encountered in conceptual design of many engineering systems. It is becoming increasingly important to develop efficient solutions to these problems because many mechanical and electrical systems are becoming more complex, even as development schedules get shorter and reliability requirements become very stringent. The multiobjective ACS algorithm offers distinct advantages to these problems compared with alternative optimization methods, and can be applied to a more diverse problem domain with respect to the type or size of the problems. Through the combination of probabilistic search, multiobjective formulation of local moves and the dynamic penalty method, the multiobjective ACSRAP, allows us to obtain an optimal design solution very frequently and more quickly than with some other heuristic approaches. The proposed algorithm was successfully applied to an engineering design problem of gearbox with multiple stages.     

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

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

Applying ant colony optimization for load balancing on grid

Grid computing is comprised of many distributed nodes in order to compute and analyze a set of distributed data. To improve the processing performance, an appropriate load-balancing algorithm is required to equally distribute loads among the grid’s nodes. In this article, an algorithm based on ant colony optimization is proposed to deal with load-balancing problems. In this approach, when an ant reaches a node, the ant’s table and the node’s table exchange their information and update each other. In order to move to the most appropriate node, the ant selects the next node from the current node’s table according to the nodes’ loads and their CPU rates. This process is continued until the ant passes the predefined steps. The experimental results show that while implementing the proposed algorithm to the grid environment, increasing the number of jobs and their length has insignificant impact on the system response time.     

改进蚁群算法设计拉式膜片弹簧

 通过对拉式膜片弹簧载荷-变形特性的综合分析,考虑各种约束条件,提出了一种新的多目标优化设计数学模型．该模型以在摩擦片磨损极限范围内,弹簧压紧力变化的平均值最小及驾驶员作用在分离轴承装置上的分离操纵力的平均值最小为共同优化目标,使离合器后备系数稳定,离合器分离力的平均作用力较小．蚁群算法是一种新型的元启发式优化算法,该算法具有较强的发现较好解的能力,但同时也存在一些缺点,如容易出现停滞现象、收敛速度慢等．将遗传算法和蚁群算法结合起来,在蚁群算法的每一次迭代中,首先根据信息量选择解分量的初值,然后使用变异操作来确定解的值．最后,通过实例与其他优化方法的结果进行比较．结果表明,该算法有较好的收敛速度及稳定性．     

改进的蚁群算法及其在卫星网络路由计算中的应用

介绍了蚁群算法的原理，然后对现有蚁群算法进行了一些改进，使它能够快速地收敛以满足高速变化的卫星网络拓扑结构．采用改进的虚拟拓扑策略解决了卫星网络拓扑高速变换的问题．将改进的蚁群算法应用于其上，并给出了相应的性能评估．所提出的改进的虚拟拓扑策略，能够大大减少一个系统周期内卫星网的时间片个数．应用于此基础上的改进的蚁群算法也体现了较好的性能．     

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.