Skip to main content
Springer Nature Link
Log in

Hyperpath-based vehicle routing and scheduling method in time-varying networks for airport shuttle service

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • 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–447

    Google Scholar 

  • Black D, Eglese R, Wøhlk S (2015) The time-dependent multiple-vehicle prize-collecting arc routing problem. (unpublished work)

  • Demeyer S et al (2013) Speeding up Martins’ algorithm for multiple objective shortest path problems. 4OR-A Q J Oper Res 11(4):323–348

    Article  MathSciNet  Google 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–443

    MATH  Google 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–799

    Article  Google 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–67

    Article  MathSciNet  Google 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–679

    Article  Google 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–75

    Article  MathSciNet  Google Scholar 

  • Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: a review[J]. Comput Oper Res 64:189–197

    Article  MathSciNet  Google Scholar 

  • Lecluyse C, Sörensen K, Peremans H (2013) A network-consistent time-dependent travel time layer for routing optimization problems[J]. Eur J Oper Res 226(3):395–413

    Article  MathSciNet  Google Scholar 

  • Marinakis Y, Marinaki M, Dounias G (2010) Honey bees mating optimization algorithm for large scale vehicle routing problems[J]. Nat Comput 9(1):5–27

    Article  MathSciNet  Google Scholar 

  • Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 16(2):236–245

    Article  MathSciNet  Google Scholar 

  • Mouthuy S, Massen F, Deville Y et al (2015) A multistage very large-scale neighborhood search for the vehicle routing problem with soft time windows[J]. Transp Sci 49(2):223–238

    Article  Google Scholar 

  • Opasanon S, Miller-Hooks E (2006) Multicriteria adaptive paths in stochastic, time-varying networks. Eur J Oper Res 173(1):72–91

    Article  MathSciNet  Google Scholar 

  • Pascoal M et al (2013) Bicriteria path problem minimizing the cost and minimizing the number of labels. 4OR 11(3):275–294

    Article  MathSciNet  Google Scholar 

  • Ravizza S et al (2013) The trade-off between taxi time and fuel consumption in airport ground movement. Public Transp 5(1–2):25–40

    Article  Google Scholar 

  • Tang J et al (2008) Multi-objective model and algorithm of free pickup customer and delivery to airport service. J Manag Sci China 11(6):35–42

    Google Scholar 

  • Tang J et al (2009) Vehicle routing problem with fuzzy time windows. Fuzzy Sets Syst 160(5):683–695

    Article  MathSciNet  Google 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–132

    Article  Google 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–383

    Article  MathSciNet  Google Scholar 

  • Wang L, Tang J (2010) Application of BP Neural Network in Exhaust Emission Estimatation of CAPS. Lect Note Comput Sci 312–320

  • 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–923

    Article  MathSciNet  Google Scholar 

  • Xu Z, Tang J (2013) An algorithm to vehicle scheduling problem of airport pickup and delivery service. Ibusiness 05(3B):84–89

    Article  Google 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–826

  • 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–4896

  • 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–1091

    Article  Google 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–181

    Article  Google Scholar 

  • Zang X, Zhou W (2010) Theoretic capacity model based on variable space headway. J Highw Transp Res Dev 27(2):103–113

    Google Scholar 

Download references

Acknowledgements

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).

Author information

Authors and Affiliations

  1. School of Control Science and Engineering, Dalian University of Technology, Dalian, Liaoning, People’s Republic of China

    Wang Linqing, Zhao Jun & Wang Wei

Authors
  1. Wang Linqing
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhao Jun
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Wang Wei
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Wang Linqing.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Linqing, W., Jun, Z. & Wei, W. Hyperpath-based vehicle routing and scheduling method in time-varying networks for airport shuttle service. Nat Comput 18, 769–784 (2019). https://doi.org/10.1007/s11047-016-9603-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-016-9603-0

Keywords