时间依赖网络城市物流车辆调度的模型及算法  

Model and Algorithm of Vehicle Routing Problem for Urban Logistics in Time-Dependent Network

作　　者：刘兰芬[1] 杨信丰[1] 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《工业工程》2017年第4期18-24,共7页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(71361018;71671079);陇原青年创新创业人才资助项目;兰州交通大学青年基金资助项目(2014028)

摘　　要：在城市配送中,车辆在不同时间段通过相同路径的行驶时间可能不同,时间依赖网络能更好地刻画城市物流车辆调度的实际特征,解决时间依赖条件下的城市物流车辆调度优化问题具有更强的实际应用意义。文在分析时间依赖网络车辆行驶时间的基础上,综合考虑顾客及物流公司两方面要求,以总配送时间、使用车辆数最小及客户满意度最大为目标,建立多目标时间依赖网络城市物流车辆调度模型;设计了遗传算法对该模型进行求解,并进行了算例研究,算例分析表明本模型在城市物流车辆调度方面是合理可行的,设计的算法是有效的。The required travel time in a path may differ from time to time in city delivery. The actual characteristics of vehicle routing can be better described in time-dependent network. It is of more practical significance to solve the problem of urban logistics vehicle routing optimization in time-dependent condition. On the basis of analyzing the vehicle travel time in time-dependent network, both sides of customers and logistics company requirements are considered and a multiobjective vehicle scheduling model in time-dependent network is formulated to minimize total delivery time and the number of vehicles and maximize the customer satisfaction. Then a genetic algorithm is designed to solve the model, upon an analysis by using an example. The simulation results show that the model is feasible and the algorithm effective in urban logistics vehicle scheduling.

关 键 词：物流工程 车辆调度问题 时间依赖网络 多目标 遗传算法 

分 类 号：F252[经济管理—国民经济]