Journal of Guangdong University of Technology ›› 2006, Vol. 23 ›› Issue (1): 71-76.

• Comprehensive Studies • Previous Articles     Next Articles

Application of Subsection Ant Colony Algorithm to Vehicle Routing Problems

  

  1. (Faculty of Automation,Guangdong University of Technology,Guangzhou 510090,China)
  • Online:2006-02-02 Published:2006-02-02

HTML

PDF (PC)

2363

Abstract: A subsection ant colony algorithm on the base of the original ant colony algorithm is put forward to solve a kind of VRP.And it is improved in two parts of selection strategy and information update.The result of some experiments is encouraging.

Key words: heuristic algorithm； ant colony system； vehicle routing problems；

[1] 刘云忠,宣慧玉.  蚂蚁算法在车辆路径问题中的应用研究[J]. 信息与控制. 2004(02)

[2] 蔡延光,钱积新,孙优贤.  带时间窗的多重运输调度问题的自适应Tabu Search算法[J]. 系统工程理论与实践. 2000(12)

[3] 姜大立,杨西龙,杜文,周贤伟.  车辆路径问题的遗传算法研究[J]. 系统工程理论与实践. 1999(06)

[4] 蔡延光,钱积新,孙优贤.  多重运输调度问题基于双表的并行表搜索算法[J]. 系统工程理论与实践. 1998(11)

[5] 蔡延光,钱积新,孙优贤.  多重运输调度问题的模拟退火算法[J]. 系统工程理论与实践. 1998(10)

[1] Leo Breiman.  Bagging predictors[J] ,1996

[1] Christofides N,Mingozzi A,Toth P.The Vehicle Routing Problem Combinational Optimization. . 1979
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech