An Algorithm to Vehicle Scheduling Problem of AirPort Pickup and Delivery Service
- 1 1School of Business Administration, Northeastern University, Shenyang 110819, China; 2State Key Laboratory of Integrated Auto-mation for Process Industries, Northeastern University, Shenyang 110819, China
- 2 State Key Laboratory of Integrated Automation for Process Industries, Northeastern University, Shenyang 110819, China
Abstract
This paper studies the vehicle scheduling problem in cities for the pickup and delivery service. Considering customer point as vehicle collaboration point, we propose a two-stage algorithm based on customer point collaboration through the theory of optimization. In addition to considering the problem whether the isolated customer point is collaborative, the algorithm also takes into account the problem whether the customers on the vehicle (picking up multiple customer points) can transfer its customers to the other basic vehicle. Moreover, the selection of the type of basic vehicles is no longer single; we can choose different types of vehicles suitable for different vehicle capacit ies according to the total number of people to carry. Finally, we perform simulation analysis and simulation results show that the algorithm proposed in this paper is feasible and effective.
- P. Pop, I. Kara and A. Marc, “New Mathematical Models of the Generalized Vehicle Routing Problem and Extensions,” Applied Mathematical Modelling, 2012, Vol. 36, No. 1, pp. 97-107.doi:10.1016/j.apm.2011.05.037
- P. Belfiore and H. Yoshizaki, “Heuristic Methods for the Fleet Size and Mix Vehicle Routing Problem with Time Windows and Split Deliveries,” Computers and Industrial Engineering, Vol. 64, No. 2, 2013, pp. 589-601. doi:10.1016/j.cie.2012.11.007
- D. Jiang and G. Hu, “GARCH Model-based Large-scale IP Traffic Matrix Estimation,” IEEE Communications Letters, Vol. 13, No. 1, 2009, pp. 52-54. doi:10.1109/LCOMM.2008.081271
- D. Jiang and G. Hu, “An Accurate Approach to Large-scale IP Traffic Matrix Estimation,” IEICE Transactions on Communications, Vol. E92B, No. 1, 2009, pp. 322-325.
- J. Wy and B. Kim, “A Hybrid Metaheuristic Approach for the Rollon–rolloff Vehicle Routing Problem,” Computers and Operations Research, Vol. 40, No. 8, 2013, pp. 1947-1952.doi:10.1016/j.cor.2013.03.006
- D. Mester, O. Braysy and W. Dullaert, “A Multi-parametric Evolution Strategies Algorithm for Vehicle Routing Problems,” Expert Systems with Applications, Vol. 32, No. 2, 2007, pp. 508-517. doi:10.1016/j.eswa.2005.12.014
- M. Rancourt, J. Cordeau and G. Laporte, “Long-Haul Vehicle Routing and Scheduling with Working Hour Rules,” Transportation Science, Vol. 47, No. 1, 2013, pp. 81-107.doi:10.1287/trsc.1120.0417
- S. Yan, S. Wang and M. Wu, “A Model with a Solution Algorithm for the Cash Transportation Vehicle Routing and Scheduling Proble,” Computers and Industrial Engineering, Vol. 63, No. 2, 2012, pp. 464-473. doi:10.1016/j.cie.2012.04.004
- Z. Xu and J. Tang, “A Coordination-based Two-stage Algorithm for Pickup and Delivery Customer to Airport Service,” in Proc. of ICMSEM’13, 2013, pp. 1-9.