带硬时间窗的航空路径规划模型  

A Programming Model of Air Routing Problems With Hard Time Window

作　　者：陈建华[1] 孙文筱[1] 

机构地区：[1]武汉理工大学物流工程学院,武汉430063

出　　处：《武汉理工大学学报（交通科学与工程版）》2011年第5期963-966,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：湖北省自然科学基金项目(批准号:2009CDB303);武汉理工大学自主创新研究基金项目(批准号:2010-ib-019)资助

摘　　要：针对物流快递行业,以牺牲部分成本来完全满足快递时效的要求,建立了基于硬时间窗的航空路径规划模型,采用并行遗传算法进行了求解.同时建立了相应的软时间窗模型,通过构造满意度函数,与硬时间窗的结果进行了对比分析,算例结果表明硬时间窗的规划路线虽然成本较高,但是更注重时效性的客户的满意度也高,这种规划方法更适于中端物流企业的特点与要求.Considering air routing problems of logistics express delivery industry,we considered increasing cost so as to completely meet the delivery time requirement,a programming model of air routing problems with hard time window was presented,which was solved by parrallel genetic algorithm.Meanwhile,the soft time window model was constructed to compare with the result of the hard window＇s,by building and applying desirability function,numerical contrast analysis showed that the hard time window is of high cost as well as a greater satisfaction degree.This planning is more suitable for the character and requirement of the mid-market logistics.

关 键 词：硬时间窗 软时间窗 车辆路径问题(VRP) 满意度函数 

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