Skip to main content
SpringerLink
Log in
Book cover

LISS 2014 pp 267–273Cite as

Study on City Express Delivery Routing and Scheduling Problem with Time Windows

  • Conference paper
  • First Online:

  • 196 Accesses

Abstract

The vehicle routing problem is usually resolved with ant colony algorithm nowadays. Many researchers have put forward advanced ant colony algorithm to improve the calculating speed. City express delivery routing and scheduling model is constructed based on the actuality of city express. Different with traditional vehicle routing problem, this model includes two objective functions-minimum cost and highest service level. The constraint of time window is also included in the model. SF express delivery routing and scheduling problem in Chaoyang District, Beijing is resolved based on this model. After comparison and analysis we draw a conclusion that the model is feasible and more practical.

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   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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

  • Ho SC, Haugland D (2004) A tabu serach heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 1(31):1947–1964

    Article  Google Scholar 

  • Lang M (2006) Study on the model and algorithm for multi-depot vehicle scheduling problem. J Transp Syst Eng Inf Technol 6(5):65–69

    Google Scholar 

  • Luis G (1995) A realut on projection for the vehicle routing problem. Eur J Opt Res 1(85):610–624

    Google Scholar 

  • Ma H, Yang S (2008) Improved tabu search algorithm for vehicle routing problem with alternative time windows. J Syst Simul 20(16):4454–4456

    Google Scholar 

  • Qianqian Q, Shiru Q, Gekai W (2008) Hybrid genetic algorithm for distribution vehicle routing problem. Comput Eng Appl 1(44):205–207

    Google Scholar 

Download references

Acknowledgments

Thanks my supervisor and fellow on my paper.

Author information

Authors and Affiliations

  1. Logistics Management and Engineering, Beijing Jiaotong University, 100044, Beijing, China

    Li Li & Qilan Zhao

Authors
  1. Li Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qilan Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li Li .

Editor information

Editors and Affiliations

  1. School of Economics and Management, Beijing Jiaotong University, Beijing, Beijing, China

    Zhenji Zhang

  2. Department of Industrial Engineering and Operations Research, University of California, Berkeley, California, USA

    Zuojun Max Shen

  3. School of Economics and Management, Beijing Jiaotong University, Beijing, China

    Juliang Zhang

  4. School of Economics and Management, Beijing Jiaotong University, Beijing, Beijing, China

    Runtong Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, L., Zhao, Q. (2015). Study on City Express Delivery Routing and Scheduling Problem with Time Windows. In: Zhang, Z., Shen, Z., Zhang, J., Zhang, R. (eds) LISS 2014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43871-8_41

Download citation

Publish with us

Policies and ethics

Search

Navigation