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

Routing for Distribution Logistics

In: Models for Practical Routing Problems in Logistics

Author

Listed:
  • S. P. Anbuudayasankar

    (Amrita School of Engineering)

  • K. Ganesh

    (McKinsey Knowledge Center India)

  • Sanjay Mohapatra

    (Xavier Institute of Management)

Abstract

The classical VRP is concerned with a set of customers to be served by a set of vehicles housed at a depot or distribution centre located in the same geographical region. The objective of the problem is to devise a set of vehicle routes with minimum distance in such a way that all delivery points are served. The demands of the points assigned to each route do not exceed the capacity of the vehicle that serves the specified route. The objective is to minimise the total distance travelled by all the vehicles and in turn to minimise the overall distribution cost. While VRP has received much attention from researchers in the last four decades (Toth and Vigo 2002), variants of this problem with more and more constraints have attracted the attention of scientific community of late.

Suggested Citation

  • S. P. Anbuudayasankar & K. Ganesh & Sanjay Mohapatra, 2014. "Routing for Distribution Logistics," Springer Books, in: Models for Practical Routing Problems in Logistics, edition 127, chapter 0, pages 95-122, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-05035-5_5
    DOI: 10.1007/978-3-319-05035-5_5
    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-319-05035-5_5. 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.