Study on Multi-Trips Whole-Transport Vehicle Scheduling Problem Based on the Multistage Network Flow Model
Abstract: Multi-trips whole-transport vehicle scheduling problem is one kind of Vehicle Scheduling Prob-lem (VSP), and the ordinary VSP algorithms haven’t made use of its special structure and behave poorly. Firstly, its structure is analyzed and the problem is transformed into a multistage net-work flow model. Secondly, the Bellman equation with tabu list is designed to deal with the non-monotonicity of the model, and then the dynamic programming algorithm for finding the minimum cost flow is designed. Finally, the effectiveness of the model and algorithm is verified through an example.
文章引用: 宋志华 , 张 晗 (2017) 基于多阶段网络流模型的多回合整车装卸车辆调度问题研究。 运筹与模糊学， 7， 81-89. doi: 10.12677/ORF.2017.73010
 Kumar, S.N. and Panneerselvam, R. (2012) A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management, 4, 66-74.
Toth, P. and Vigo, D. (2014) Vehicle Routing: Problems, Methods, and Applications. Siam.
Song, Z.H., et al. (2015) Algorithm for Distance Constrained Aerial Vehicle Routing Problem: Based on Minimum Spanning Tree and Genetic Computation. 2015 11th International Conference on Computational Intelligence and Security (CIS), IEEE.
Rivera, J.C., Afsar, H.M. and Prins, C. (2016) Mathematical Formulations and Exact Algorithm for the Multitrip Cumulative Capacitated Single-Vehicle Routing Problem. European Journal of Operational Research, 249, 93-104.
Novoa, C. and Storer, R. (2009) An Approximate Dynamic Programming Approach for the Vehicle Routing Problem with Stochastic Demands. European Journal of Operational Research, 196, 509-515.
 Bertsekas, D.P. (2014) Abstract Dynamic Programming. Tsinghua University Press, Beijing, 1-25.