基于遗传算法的烟草配送车路径优化问题  

Optimal Routing of Cigarette Delivery Vehicle Based on Genetic Algorithm

作　　者：叶安新[1] 

机构地区：[1]浙江师范大学信息科学与工程学院,金华321004

出　　处：《计算机系统应用》2011年第4期241-244,共4页Computer Systems & Applications

摘　　要：在建立烟草配送车路径优化问题模型的基础上,采用轮盘赌复制法、部分匹配交叉算法、和适应度函数自适应调整等技术,设计了基于自然数编码的遗传算法,最后以这种方法进行了实验计算,通过计算结果表明,用遗传算法进行烟草车配送路径优化,可以方便有效地求得问题的最优解或近似最优解。On the basis of establishing an optimized model for optimal routing of cigarette delivery vehicle problem,the paper uses techniques such as roulette wheel selection,partially matched crossover and self adaptation for fitness function,designs a genetic algorithm based on natural numbers.At the end of the paper make some experimental calculations using this algorithm.The experimental calculations results demonstrate that the optimal or nearly optimal solutions to the Cigarette Delivery Vehicle routing problem can be easily obtained by using genetic algorithm.

关 键 词：配送车路径 多项式复杂程度的非确定性问题 优化 遗传算法 自然数编码 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]