您的位置:首页  > 论文页面

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

发表时间:2015-07-15  浏览量:1609  下载量:662
全部作者: 崔雪源,马英钧,赵东方
作者单位: 华中师范大学数学与统计学学院
摘 要: 首先,介绍了蚁群算法的基本内容,包括主要特点、基本原理和基本步骤;然后,建立了燃油运输问题的数学模型;最后,利用蚁群算法,建立蚁群算法模型,研究一种带容量限制的燃油运输数学模型的优化计算,并对其进行仿真分析。仿真结果显示:蚁群算法能有效减少运输路线的总长度,证明了蚁群算法的有效性。而且考虑城市规模分别为50,100,150个的情况,发现算法效能不会因城市规模的变大而降低,证明了蚁群算法的高性能。
关 键 词: 运筹学;旅行商问题;燃油运输;蚁群算法
Title: Fuel transportation problem based on ant colony algorithm
Author: CUI Xueyuan, MA Yingjun, ZHAO Dongfan
Organization: School of Mathematics and Statistics, Central China Normal University
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
发表期数: 2015年7月第13期
引用格式: 崔雪源,马英钧,赵东方. 基于蚁群算法的燃油运输问题[J]. 中国科技论文在线精品论文,2015,8(13):1390-1394.
 
1 评论数 0
暂无评论
友情链接