IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-14493-7_7.html
   My bibliography  Save this book chapter

Vehicle Routing Problem: Past and Future

In: Contemporary Operations and Logistics

Author

Listed:
  • Emrah Demir

    (Cardiff University)

  • Katy Huckle

    (Cardiff University)

  • Aris Syntetos

    (Cardiff University)

  • Andrew Lahy

    (Cardiff University)

  • Mike Wilson

    (Cardiff University)

Abstract

Freight transportation is a critical part of any supply chain and has many facets, particularly when viewed from the multiple levels of decision-making. The most known problem at the operational level planning is the Vehicle Routing Problem (VRP), which is one of the most interesting and challenging optimization problems in the operations research literature. By definition, it consists of designing optimal collection or delivery routes for a set of vehicles from a depot to a set of geographically scattered customers, subject to various side constraints, such as vehicle capacity, time windows, precedence relations between customers, and, etc. This chapter discusses the basic principles of vehicle routing to provide readers with a complete introductory resource. More specifically, knowing the past of vehicle routing will help readers to understand the present and to prepare for the future of road freight transportation.

Suggested Citation

  • Emrah Demir & Katy Huckle & Aris Syntetos & Andrew Lahy & Mike Wilson, 2019. "Vehicle Routing Problem: Past and Future," Springer Books, in: Peter Wells (ed.), Contemporary Operations and Logistics, chapter 0, pages 97-117, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-14493-7_7
    DOI: 10.1007/978-3-030-14493-7_7
    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-030-14493-7_7. 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.