烟草物流配送路线问题的实例研究  

Empirical study on distribution route of tobacco logistics

作　　者：冯子炎 张艳霞[1] 明文虎 谢胜强[1] 

机构地区：[1]同济大学经济与管理学院,上海200092 [2]红云红河烟草(集团)有限责任公司,昆明650231

出　　处：《上海管理科学》2014年第6期18-21,共4页Shanghai Management Science

摘　　要：烟草物流配送问题可以抽象为车辆路径问题(VRP),本文根据烟草物流配送的特点,设计相应的用于解决带时间窗的VRP问题的遗传算法。将该算法应用于具体的烟草物流配送案例中,编程实现并测试分析。最终验证了该方法在解决实际的大规模复杂问题的优越性。The distribution route problem of tobaccc logistics can be abstracted as Vehicle Routing Problem（VRP） A genetic algorithm solving VRPTW is proposed in this papel according to the features of tobacco logistics distribution. Thi~ algorithm is applied to the actual case of tobacco logistic~ distribution and is verified through programming. The verification result shows that the genetic algorithm can be suec to provide optimized distribution plan in complex large-scak problem.

关 键 词：烟草物流 车辆路径问题 遗传算法 

分 类 号：F54[经济管理—产业经济]