检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:于述南 杨忠振[1] YU Shunan;YANG Zhongzhen(School of Transportation Management, Dalian Maritime University, Dalian 116026, China)
机构地区:[1]大连海事大学交通运输管理学院,大连116026
出 处:《系统工程理论与实践》2017年第12期3182-3192,共11页Systems Engineering-Theory & Practice
基 金:中央高校基本科研业务费专项资金资助(3132016303)~~
摘 要:为了研究快递公司航空运输网络优化及快件的运输组织问题,本文放宽了先到先服务(first come first serve,简称FCFS)作业模式的时限限制,构建了双层规划模型.上层模型确定快递公司自有全货机所配置的航线以及各航段的腹舱租赁量,下层模型决策快件的配送方案.选取SF快递公司所服务的14个城市的相关数据对模型进行验证,并基于上层模型优化的网络比较了不同时间容忍度下快件的运输方案,结果表明:随着时间容忍度的增加,快件的总运输成本逐渐降低,而总运输时间升高.可见,先到先服务模式不是最经济的派件作业模式,快递公司可利用快件的时间容忍度,实施航空运输网络和运送方案的优化设计.In order to study the problem of air transport network optimization and parcels' delivery scheme of express companies, this paper relaxes the constraint of time tolerance on first come first serve (FCFS). A bi-level programming model is constructed, the upper model determined tile routes of cargo aircrafts owned by the express companies, the amount of the rental bellies on each link, the delivery scheme of all the parcels is decided in the lower model. The related data of fourteen cities served by SF Air Express Company are used to verify the model. The delivery schemes of parcels under different time toler^mce are compared based on the network optimized by the upper model. The results show that tile total transport cost of parcels decreases as the tolerance increment, while the total transport time increases, which indicates that the FCFS mode is not the most economical one, and the express companies may optimize their transport networks and delivery schemes by taking use of the time tolerance
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70