Skip to main content
SpringerLink
Log in
Book cover

International Conference on Data Science

ICDS 2015: Data Science pp 127–134Cite as

A Vehicle Routing Problem with Time Windows for Attended Home Distribution

  • Conference paper
  • First Online:

  • 1417 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9208))

Abstract

The reliable and efficient last three mile of delivery results in enormous challenges for city logistics. In recent years, the combination of telematics based big data collection and O2O e-commerce has built the ground for time-dependent vehicle routing, which becomes extremely important in the home delivery applications. This paper proposes a logistics platform to solve the order fulfillment problem of on-demand delivery service with large quantities of orders. The problem can be considered as a special vehicle routing problem with considering the link time and cost between the store and the delivery destinations designated by customers, who are associated with time windows and vehicles with capacity. We then propose a Genetic Algorithm (GA) method. Experimental results show that the proposed approach is highly feasible and very potential in dealing with the present order fulfillment problem.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Gevaers, R., Van de Voorde, E., Vanelslander, T.: Characteristics and typology of last-mile logistics from an innovation perspective in an urban context. In: Proceedings of WCTR 2010, Lisbon, Portugal (2010)

    Google Scholar 

  2. Eglese, R., Maden, W., Slater, A.: A road timetable to aid vehicle routing and scheduling. Comput. Oper. Res. 33(12), 3508–3519 (2006)

    Article  MATH  Google Scholar 

  3. Maden, W., Eglese, R., Black, D.: Vehicle routing and scheduling with time-varying data: a case study. J. Oper. Res. Soc. 61, 515–522 (2010)

    Article  MATH  Google Scholar 

  4. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 4, 80–91 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  5. Shmoys, D.B., Lenstra, J.K., Kan, A.H.G.R., Lawler, E.L.: The Traveling Salesman Problem. Wiley, Chichester (1985)

    MATH  Google Scholar 

  6. Hà, M.H., Bostel, N., Langevin, A., Rousseau, L.-M.: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Comput. Oper. Res. 43, 9–19 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liong, C., Ismail, W.: Vehicle routing problem: models and solutions. J. Qual. Technol. 4(1), 205–218 (2008)

    Google Scholar 

  8. Toth, P., Vigo, D.: An exact algorithm for the vehicle routing problem with backhauls. Transportation Science 31, 372–385 (1997)

    Article  MATH  Google Scholar 

  9. Crainic, T.G., Delorme, L.: Dual-ascent procedures for multi commodity location- allocation problems with balancing requirements. Transp Sci 27, 90–101 (1993)

    Article  MATH  Google Scholar 

  10. Hall, R.W.: Stochastic freight flow patterns: implications for fleet optimization. Transp. Res. A 33(6), 449–465 (1999)

    Google Scholar 

  11. Jiuh-Biing, S.: A novel dynamic resource allocation model for demand- responsive city logistics distribution operations. Transp. Res. E 42, 445–472 (2006)

    Article  Google Scholar 

  12. Sensen, K., Sevaux, M.: MAjPM: memetic algorithms with population management. Comput. Oper. Res. 33, 1214–1225 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, School of Management, Xi’an Jiaotong University, 28 Xianning West Road, Xi’an, 710049, People’s Republic of China

    Yi Qu, Feng Wu & Wei Zong

Authors
  1. Yi Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Zong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Feng Wu .

Editor information

Editors and Affiliations

  1. University of Technology, Sydney, Australia

    Chengqi Zhang

  2. Xi'an Jiaotong University, Xi'an Jiaotong, China

    Wei Huang

  3. Chinese Academy of Sciences, Beijing, China

    Yong Shi

  4. University of Illinois Chicago, CHICAGO, Illinois, USA

    Philip S. Yu

  5. Fudan University, Shanghai, China

    Yangyong Zhu

  6. Research Center on Fictitious Econo, Chinese Academy of Sciences, Beijing, China

    Yingjie Tian

  7. University of Technology, Sydney, Australia

    Peng Zhang

  8. Victoria University, Melbourne, Victoria, Australia

    Jing He

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Qu, Y., Wu, F., Zong, W. (2015). A Vehicle Routing Problem with Time Windows for Attended Home Distribution. In: Zhang, C., et al. Data Science. ICDS 2015. Lecture Notes in Computer Science(), vol 9208. Springer, Cham. https://doi.org/10.1007/978-3-319-24474-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24474-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24473-0

  • Online ISBN: 978-3-319-24474-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation