• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

基于改进蚁群算法的物流配送路径问题研究

展开
  • (1.新疆农业大学计算机与信息工程学院,新疆 乌鲁木齐 830052;2.新疆农业大学数理学院,新疆 乌鲁木齐 830052;
    3.泉州师范学院理工学院,福建 泉州 362000)
张建民(1975),男,河南郑州人,硕士生,研究方向为智能计算及最优化理论;恰汗·合孜尔,博士,教授,研究方向为计算机应用;高大利,硕士,讲师,研究方向为模式识别和人工智能。

收稿日期: 2009-05-27

  修回日期: 2009-09-24

  网络出版日期: 2010-06-25

A Study of the Logistic Distribution Routing Problem Based on the Improved Ant Colony Algorithm

Expand
  • (1.School of Computer and Information Engineering,Xinjiang Agricultural University,Urumqi 830052;2.School of Mathematics
    and Physics,Xinjiang Agricultural University,Urumqi 830052;3.Quanzhou Normal University,Quanzhou 362000,China)

Received date: 2009-05-27

  Revised date: 2009-09-24

  Online published: 2010-06-25

摘要

针对蚁群算法求解物流配送路径问题易陷入早熟、停滞、局部最优的缺点,提出了混沌、变异与最大最小蚂蚁算法相融合的改进蚁群算法。在仿真实验中,分别采用最大最小蚂蚁算法、加入混沌的最大最小蚂蚁算法、加入变异的最大最小蚂蚁算法、加入混沌和变异的最大最小蚂蚁算法对物流配送路径问题进行求解。实验结果表明,加入混沌和变异的最大最小蚂蚁算法能够有效提高蚁群算法的全局寻优能力,对物流配送路径问题的求解能够得出比较好的结果。

本文引用格式

张建民1,恰汗·合孜尔2,高大利3 . 基于改进蚁群算法的物流配送路径问题研究[J]. 计算机工程与科学, 2010 , 32(7) : 117 -119 . DOI: 10.3969/j.issn.1007130X.2010.

Abstract

The ant colony algorithm solving the logistic distribution routing problem is prone to prematurity,stagnation and local optimum.In order to overcome this defect,a mixed algorithm of the MAXMIN ant system,chaos and mutation is proposed.In the simulation experiments,the maxmin ant algorithm,the mixed algorithm of the MAXMIN ant system and chaos,the mixed algorithm of the MAXMIN ant system and mutation,the mixed algorithm of the MAXMIN ant system,chaos and mutation are respectively adopted to solve the logistic distribution routing problem.Experiments show that the mixed algorithm of the MAXMIN ant system,chaos and mutation is better to enhance the global optimization capacity of the ant colony algorithm,as well as to achieve better results for the logistic distribution routing problem.

文章导航

/