Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (24): 28-31.

Previous Articles     Next Articles

Research of grain emergency path optimization based on adaptive chaos-based Ant Colonies Optimization algorithm

XIAO Le1,2, WU Xianglin1, ZHEN Tong2   

  1. 1.Department of Control Engineering, Huazhong University of Science & Technology, Wuhan 430074, China
    2.School of Information Science & Engineering, Henan University of Technology, Zhengzhou 450001, China
  • Online:2012-08-21 Published:2012-08-21

自适应混沌蚁群算法的粮食应急路径优化研究

肖  乐1,2,吴相林1,甄  彤2   

  1. 1.华中科技大学 控制系,武汉 430074
    2.河南工业大学 信息科学与工程学院,郑州 450001

Abstract: According to the problem of grain emergency path optimization of risk management, a multi-objective optimization model, which treats the least transportation time and risk as the optimization target is established. To avoid the remaining local optima of the MAX-MIN Ant System(MMAS), an adaptive chaos-based ACO is introduced. In order to achieve the objective of improving the precision of the optimal solution, this algorithm utilizes the efficient solution similarity degree to judge ant colonies current quality so that a chaotic disturbance of pheromone update is realized according to changed conditions. The experiment shows that the algorithm is superior to conventional evolutionary algorithm and can better solve the problem of grain emergency path optimization.

Key words: grain emergency, risk management, path optimization, adaptive chaos-based Ant Colonies Optimization(ACO) algorithm, efficient solution similarity degree

摘要: 针对风险管理下的粮食应急路径优化问题,将“运输风险最小”和“运输时间最小”作为目标,建立相应的优化模型。利用“最大最小蚂蚁系统”进行求解,为避免过早陷入局部最优,提出自适应混沌蚁群优化算法。该算法利用有效解相似度来判断蚁群当前状态,根据情况对信息素进行全局更新和混沌扰动,可以有效地提高最优解的精度。实验表明该算法优于传统的演化算法,较好地解决了粮食应急运输路径优化问题。

关键词: 粮食应急, 风险管理, 路径优化, 自适应混沌蚁群算法, 有效解相似度