IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-32054-5_38.html
   My bibliography  Save this book chapter

The Optimization Model and Empirical Analysis for Vehicle Routing Problems with Time Windows Based on C-W Algorithm

In: Liss 2012

Author

Listed:
  • Lijuan Fan

    (Beijing Jiaotong University)

  • Qiuli Qin

    (Beijing Jiaotong University)

Abstract

Vehicle routing problem is a kind of optimization scheduling problems which researches how to realize transportation cost optimization though programming driving route reasonably. Considering the vehicle routing problems with time window restriction, we establish the proper model related to the typical practical situation based on c-w saving algorithm. The case study indicates that saving algorithm is reasonable, and it also shows that this calculation might be simple and convenient and this method could be easy to realize by computer. However, the precision of the solution will be reduced if the number of customers increases with growing solution space.

Suggested Citation

  • Lijuan Fan & Qiuli Qin, 2013. "The Optimization Model and Empirical Analysis for Vehicle Routing Problems with Time Windows Based on C-W Algorithm," Springer Books, in: Zhenji Zhang & Runtong Zhang & Juliang Zhang (ed.), Liss 2012, edition 127, pages 253-258, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-32054-5_38
    DOI: 10.1007/978-3-642-32054-5_38
    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-642-32054-5_38. 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.