IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-42902-1_21.html
   My bibliography  Save this book chapter

Single Vehicle Routing Problem with a Predefined Customer Sequence, Stochastic Demands and Partial Satisfaction of Demands

In: Operations Research Proceedings 2015

Author

Listed:
  • Epaminondas G. Kyriakidis

    (Athens University of Economics and Business)

  • Theodosis D. Dimitrakos

    (University of the Aegean)

Abstract

We consider the problem of finding the optimal routing of a single vehicle that starts its route from a depot and delivers a product to N customers that are served according to a particular sequence. The vehicle during its route can return to the depot for restocking. The demands of the customers are random variables with known distributions. The actual demand of each customer is revealed as soon as the vehicle visits the customer’s site. It is permissible to satisfy fully or to satisfy partially or not to satisfy the demand of a customer. The cost structure includes travel costs between consecutive customers, travel costs between the customers and the depot and penalty costs if a customer’s demand is not satisfied or if it is satisfied partially. A dynamic programming algorithm is developed for the determination of the optimal routing policy. It is shown that the optimal routing policy has a specific threshold-type structure.

Suggested Citation

  • Epaminondas G. Kyriakidis & Theodosis D. Dimitrakos, 2017. "Single Vehicle Routing Problem with a Predefined Customer Sequence, Stochastic Demands and Partial Satisfaction of Demands," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 157-164, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_21
    DOI: 10.1007/978-3-319-42902-1_21
    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:oprchp:978-3-319-42902-1_21. 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.