IDEAS home Printed from https://ideas.repec.org/a/wly/transj/v57y2018i1p83-111.html
   My bibliography  Save this article

Optimizing Area Coverage for Time‐Differentiated Distribution: A Unidimensional Analysis

Author

Listed:
  • Mohsin Nasir Jat

Abstract

This article studies the problem of optimally locating storage facilities and determining their service areas for the distribution of goods within multiple distance constraints. The problem is relevant for the service systems that maintain inventories of items required for servicing at demand locations within different service time windows (e.g., the after‐sales service systems that maintain service parts for critical equipment). A location optimization model is presented that considers a continuous unidimensional coverage under two service distance constraints, demand composition, and inventory and transportation costs. The investigation primarily focuses on the tradeoff between inventory and transportation costs to provide guidelines for the appropriate distribution setups under a set of different conditions. The article adds to the under‐researched area of continuous location optimization and offers some novel insights in this area. Some of the existing optimization methods in this area rely on Voronoi partitioning. However, the analysis highlights that Voronoi regions may not be optimum when inventory costs are considered. It also highlights that different cost and demand compositions can result in significantly different optimum location patterns.

Suggested Citation

  • Mohsin Nasir Jat, 2018. "Optimizing Area Coverage for Time‐Differentiated Distribution: A Unidimensional Analysis," Transportation Journal, John Wiley & Sons, vol. 57(1), pages 83-111, January.
  • Handle: RePEc:wly:transj:v:57:y:2018:i:1:p:83-111
    DOI: 10.5325/transportationj.57.1.0083
    as

    Download full text from publisher

    File URL: https://doi.org/10.5325/transportationj.57.1.0083
    Download Restriction: no

    File URL: https://libkey.io/10.5325/transportationj.57.1.0083?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:transj:v:57:y:2018:i:1:p:83-111. 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: Wiley Content Delivery (email available below). General contact details of provider: .

    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.