It is very significant for a reasonable vehicle routing and scheduling in city airport shuttle service to decrease operational costs and increase passenger satisfaction. Most of the existing reports for such problems assumed that the travel time was invariable. However, the ever-increasing traffic congestion often makes it variable. In this study, considering the time-varying networks, a vehicle routing and scheduling method is proposed, where the time-varying feature enables the traveler to select a direction among all the Pareto-optimal paths at each node in response to the knowledge of the time window demands. Such Pareto-optimal paths are referred to hyperpaths herein. To obtain the hyperpaths, an exact algorithm is designed in this study for addressing the bi-criteria shortest paths problem, where the travel time comes to be discontinuous time-varying. Given the techniques that generate all Pareto-optimal solutions exhibiting exponential worst-case computational complexity, embedded in the exact algorithm, a computationally efficient bound strategy is reported on the basis of passenger locations, pickup time windows and arrival time windows. As such, the vehicle routing and scheduling problem viewed as an arc selection model can be solved by a proposed heuristic algorithm combined with a dynamic programming method. A series of experiments by using the practical pickup data indicate that the proposed methods can obtain cost-saving schedules under the condition of time-varying travel times.
Time-varying travel times Hyperpath Vehicle routing and scheduling problem Airport shuttle service Heuristic algorithm
This is a preview of subscription content, log in to check access.
This work is supported by the National Natural Sciences Foundation of China (61273037, 61304213, 61473056), and the National Key Technology R&D Program (2015BAF22B01), the Fundamental Research Funds of the Central Universities (DUT14RC(3)130) and the Fundamental Research Funds of the Central Universities (DUT15YQ113).
Bao Y, Tang JF, Liu LL (2011) Clustering algorithm for minimizing vehicle number of airport pickup and delivery service. Comput Integr Manuf Syst 17(2):442–447Google Scholar
Black D, Eglese R, Wøhlk S (2015) The time-dependent multiple-vehicle prize-collecting arc routing problem. (unpublished work)Google Scholar
Demeyer S et al (2013) Speeding up Martins’ algorithm for multiple objective shortest path problems. 4OR-A Q J Oper Res 11(4):323–348MathSciNetCrossRefGoogle Scholar
Dong G et al (2008) Minimizing costs model and algorithm of free pickup and delivery customers to airport service. J Syst Eng 23(4):437–443zbMATHGoogle Scholar
Dong G et al (2011) An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model. J Intell Manuf 22(5):789–799CrossRefGoogle Scholar
Fernandez-Marquez JL, Serugendo GDM, Montagna S et al (2013) Description and composition of bio-inspired design patterns: a complete overview[J]. Nat Comput 12(1):43–67MathSciNetCrossRefGoogle Scholar
Figliozzi MA (2010) An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows[J]. Transp Res Part C Emerg Technol 18(5):668–679CrossRefGoogle Scholar
Garaix T et al (2010) Vehicle routing problems with alternative paths: an application to on-demand transportation. Eur J Oper Res 204(1):62–75MathSciNetCrossRefGoogle Scholar
Tang J, Yu Y, Li J (2015) An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport. Transp Res Part E Logist Transp Rev 73:114–132CrossRefGoogle Scholar
Taş D, Gendreau M, Jabali O et al (2016) The traveling salesman problem with time-dependent service times[J]. Eur J Oper Res 248(2):372–383MathSciNetCrossRefGoogle Scholar
Wang L, Tang J (2010) Application of BP Neural Network in Exhaust Emission Estimatation of CAPS. Lect Note Comput Sci 312–320Google Scholar
Wen L, Catay B, Eglese R (2014) Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge. Eur J Oper Res 236(3):915–923MathSciNetCrossRefGoogle Scholar
Xu Z, Tang J (2013) An algorithm to vehicle scheduling problem of airport pickup and delivery service. Ibusiness 05(3B):84–89CrossRefGoogle Scholar
Xu Z, Tang J (2014) A coordination-based two-stage algorithm for pickup and delivery of customers to airport. Proceedings of the Seventh International Conference on Management Science and Engineering Management. J. Xu, J. A. Fry, B. Lev and A. Hajiyev, Springer Berlin Heidelberg. 242: 815–826Google Scholar
Xu Z, Tang J (2014) Customer point collaboration-based multi-trip vehicle scheduling algorithm to pickup and delivery service to airport. The 26th Chinese Control and Decision Conference (2014 CCDC), 4892–4896Google Scholar
Xu J, Yan F, Li S (2011) Vehicle routing optimization with soft time windows in a fuzzy random environment. Transp Res Part E Logist Transp Rev 47(6):1075–1091CrossRefGoogle Scholar
Yu B, Yang ZZ (2011) An ant colony optimization model: the period vehicle routing problem with time windows[J]. Transp Res Part E Logist Transp Rev 47(2):166–181CrossRefGoogle Scholar
Zang X, Zhou W (2010) Theoretic capacity model based on variable space headway. J Highw Transp Res Dev 27(2):103–113Google Scholar