Industrial Engineering Journal ›› 2017, Vol. 20 ›› Issue (4): 18-24.doi: 10.3969/j.issn.1007-7375.e17-4077

Previous Articles     Next Articles

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

LIU Lanfen, YANG Xinfeng   

  1. School of Traffic & Transportation Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China
  • Received:2017-03-31 Online:2017-08-30 Published:2017-09-08

Abstract: 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 multi-objective 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.

Key words: logistics engineering, vehicle routing problem, time-dependent network, multi-objective, genetic algorithm

CLC Number: