IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-43871-8_41.html
   My bibliography  Save this book chapter

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

In: Liss 2014

Author

Listed:
  • Li Li

    (Beijing Jiaotong University)

  • Qilan Zhao

    (Beijing Jiaotong University)

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.

Suggested Citation

  • Li Li & Qilan Zhao, 2015. "Study on City Express Delivery Routing and Scheduling Problem with Time Windows," Springer Books, in: Zhenji Zhang & Zuojun Max Shen & Juliang Zhang & Runtong Zhang (ed.), Liss 2014, edition 127, pages 267-273, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-43871-8_41
    DOI: 10.1007/978-3-662-43871-8_41
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-43871-8_41. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.