Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (25): 231-233.

• 工程与应用 • Previous Articles     Next Articles

Utilization of ant colony algorithms in shipping arrangement

JIN Yan1,2,ZHAO Yao1   

  1. 1.School of Transportation,Huazhong University of Science and Technology,Wuhan 430074,China
    2.School of Transportation,Wuhan University of Technology,Wuhan 430063,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-01 Published:2007-09-01
  • Contact: JIN Yan

基于蚁群算法的航线配船

金 雁1,2,赵 耀1   

  1. 1.华中科技大学 交通学院,武汉 430074
    2.武汉理工大学 交通学院,武汉 430063
  • 通讯作者: 金 雁

Abstract: Comparing shipping arrangement with symmetric traveling salesman problem,an ant colony algorithms is used to solve the shipping arrangement successfully,which is a new way to deal with the complicated nonlinear integer problem.

Key words: ant colony algorithms, shipping arrangement, optimization

摘要: 通过对比航线配船问题与TSP问题的异同,成功将蚁群算法(ACA)用于航线配船,为求解大规模非线性整数规划问题提供了一条新的途径。

关键词: 蚁群算法, 航线配船, 优化