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

Scheduling Periodical Deliveries from a Distribution Centre to Minimize the Fleet Size

In: Collaborative Logistics and Intermodality

Author

Listed:
  • Jiyin Liu

    (Loughborough University)

  • Aiying Rong

    (Aalto University)

Abstract

This chapter studies the delivery problem in which a distribution center delivers goods to customers periodically. Each customer has a specified delivery frequency. The deliveries to the same customer must be spaced over time as evenly as possible. The objective is to minimize the fleet size. We start from the special version with customers requiring the same delivery frequency, and propose a routing-then-scheduling approach: a routing problem for making one delivery to every customer is first solved and the resulting routes are then scheduled over the period. The study mainly focuses on the scheduling of the routes. Feasibility and optimality of the solution are analyzed. Based on the analysis, we develop a general integer programming model and a two-stage method for the problem with different delivery frequencies. Numerical experiments show that both methods solve the problem quickly. However, the delivery patterns generated by the two-stage models are more stable.

Suggested Citation

  • Jiyin Liu & Aiying Rong, 2021. "Scheduling Periodical Deliveries from a Distribution Centre to Minimize the Fleet Size," Springer Books, in: Jorge E. Hernández & Dong Li & José Elias Jimenez-Sanchez & Miguel Gaston Cedillo-Campos & Luo Wenpi (ed.), Collaborative Logistics and Intermodality, pages 159-177, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-50958-3_9
    DOI: 10.1007/978-3-030-50958-3_9
    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-50958-3_9. 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.