交通运输工程与信息学报2016，Vol.14Issue(2)：101-109,9.DOI:10.3969/j.issn.1672-4747.2016.02.014
基于图转换法的双重时限下城市快递问题研究
Research of Urban Express Delivery Under Double Time Restrictions Based on Graph Transformation Method
摘要
Abstract
Urban express delivery is a problem with the properties of the complexity economy,timeliness, service and uncertainty. This paper focuses on the delivery problem under double restrictions of soft time window and maximum working time in a day. Under the constrains of single operation soft window ,courier total work time and the loading capacity ,the needed courier number to finish the deliverys in a urban road network ,the delivery task distribution and the path selection were calculated. First, a CARP and 0-1 integer programming model based on the double packing problem were chosen to define the urban delivering problem. The first packing problem was defined as when a courier worked for a single distribution tasks, its loading capacity and single delivery time had to meet the small box's"capacity" limits; the second packing problem was defined as that the total time, a courier finished his whole single distribution tasks, had to meet the big box's"capacity" limits. Then, because of the double time restrictions, the courier's single delivery time was flexible. By transforming the demanding arcs into the demanding points and giving them the time and capacity attributes, the CARP was transformed into a VRP. Lingo software was chosen to get the accurate solution, meanwhile, the sub-circuit problem of the CARP was solved. At last, an example was used to prove the model's feasibility.关键词
快递派送/双层装箱问题/图转换法/子回路消除Key words
Courier delivering/double packing problem/path planning/graph transformation/sub circuit eliminating分类
管理科学引用本文复制引用
张晓,刘澜..基于图转换法的双重时限下城市快递问题研究[J].交通运输工程与信息学报,2016,14(2):101-109,9.基金项目
中央高校基本科研业务费专项资金(SWJTU09ZT18) （SWJTU09ZT18）
四川省科技支撑计划项目(2014GZ0019-1). （2014GZ0019-1）
