摘要
针对中小城市烟草配送的路线选择问题,考虑每个县区的分销商经过且只经过一次,建立县区分销商间最短路径模型,应用遗传算法解决该问题,并应用Matla2011b编程实现,计算结果表明该方法的有效性。
In this paper, in view of the issues concerning the route selection of tobacco distribution activities in small-and-medium-sized cities and considering that the distributors located in every county and district were reached once and only once, we built the shortest path model between these distributors, used the genetic algorithm to solve the problem and realized it on the basis of the Matla2011b platform.
出处
《物流技术》
北大核心
2014年第3期348-350,共3页
Logistics Technology
关键词
烟草配送
遗传算法
路径选择
tobacco distribution
genetic algorithm
path selection
