基于时间依赖网络的车辆调度问题研究  

Study of Vehicle Scheduling Problem in Time-dependent

作　　者：李春霞[1] 张思林[1] 庞明宝[1] 

机构地区：[1]河北工业大学土木工程学院,天津300401

出　　处：《交通科技》2011年第1期104-107,共4页Transportation Science & Technology

基　　金：河北省科技研究计划项目(09457201D)资助

摘　　要：针对城市道路交通存在的不确定性问题,提出将动态车辆调度问题置于时间依赖网络的思想,建立了包括车辆固定成本费用、路阻费用和违反时间窗约束费用在内的广义费用最小化数学模型,采用改进的蚁群算法进行优化求解。仿真实验表明,该方法充分利用了城市道路交通时变性所呈现的周期性特点,是运输与物流企业进行车辆调度时节约成本的有效方法。The thought is proposed to design the dynamic vehicle routing and scheduling project in the time-dependent networks based on the uncertain problems of urban traffic networks.The model of minimum generalized expenses is established,which includes the fixed costs of vehicles,road impedance expenses,and the early arrival or delay penalties expenses.The concrete course for solution is discussed by using the improved ant colony algorithms（ACO）.The feasibility and validity of the method is demonstrated by the simulation experiment,which shows that the periodicity characteristic of the time variant in the urban traffic networks is fully used and the total costs of the transportation or logistics enterprises can be reduced.

关 键 词：车辆调度问题 动态网络 动态路阻 蚁群算法 最短路径算法 

分 类 号：U292.4[交通运输工程—交通运输规划与管理]