基于蚁群算法的燃油运输问题.PDF

第8 卷 第13期 Vol.8 No.13 2015 年 7 月 July 2015 基于蚁群算法的燃油运输问题 崔雪源，马英钧，赵东方* （华中师范大学数学与统计学学院，武汉 430079 ） 摘要：首先，介绍了蚁群算法的基本内容，包括主要特点、基本原理和基本步骤；然后，建立了燃油运输问题 的数学模型；最后，利用蚁群算法，建立蚁群算法模型，研究一种带容量限制的燃油运输数学模型的优化计 算，并对其进行仿真分析。仿真结果显示：蚁群算法能有效减少运输路线的总长度，证明了蚁群算法的有效 性。而且考虑城市规模分别为50 ，100，150 个的情况，发现算法效能不会因城市规模的变大而降低，证明了 蚁群算法的高性能。 关键词：运筹学；旅行商问题；燃油运输；蚁群算法 中图分类号：O221 文献标识码：A 文章编号：1674-2850(2015)13-1390-05 Fuel transportation problem based on ant colony algorithm CUI Xueyuan, MA Yingjun, ZHAO Dongfang (School of Mathematics and Statistics, Central China Normal University, Wuhan 430079, China) Abstract: This paper firstly introduces the basic content of ant colony algorithm, including the main characteristics, basic principle and basic steps. Secondly, the mathematical model of fuel transportation problem is established. At last, by making use of ant colony algorithm, ant colony algorithm model is set up which researches the optimization mathematical model with limited capacity of the fuel transportation problem and makes simulation analysis. The simulation results show that the ant colony algorithm can effectively reduce the total length of transport routes, proving the effectiveness of ant colony algorithm. Furthermore, considering the size of cities, which are 50, 100, 150 respectively, the efficiency of the algorithm is not reduced with the increase of the city’s scale, proving the high performance of ant colony algorithm. Key words: operational research; traveling salesman problem; fuel transportation; ant colony algorithm 0 引言 [1] 油料运输的优化决策问题 就是从物流系统的总目标出发，运用系统学的理论和系统工程