IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v24y2007i04ns0217595907001346.html
   My bibliography  Save this article

A Heuristic Approach For Solving Serially Distributed Storage Depots Under General-Integer Policy

Author

Listed:
  • FANG-CHUAN LEE

    (Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 300, Taiwan)

  • UE-PYNG WEN

    (Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 300, Taiwan)

Abstract

In this study, we present the problems of shipping a single product from a single supply origin, through a serial system of storage depots, to a single demand destination by trucks or ships, and aim to minimize the sum of ordering, inventory and transportation costs over an infinite time horizon. We formulate the problem consisting of general-integer (GI), stationary and nested replenishment policies for the multistage inventory/distribution system. This paper presents the near-optimal cost-curve structure analysis for this serially distributed storage depot problem (SDSDP) and show that the ordering quantities for each storage depot always comply with theGIreplenishment policy. Moreover, we develop a heuristic approach, which is based on an efficient search procedure to obtain satisfactory results. A comparison of the results obtained from the proposed heuristic method has been made with that from theLINGO®software on randomly generated problems. The proposed heuristic is the first solution approach in the literature to solve the single link problems based on the cost-curve structure analysis. Furthermore, we provide an important foundation for carrying out investigations on lot sizing and distribution problems with other supply chain configurations.

Suggested Citation

  • Fang-Chuan Lee & Ue-Pyng Wen, 2007. "A Heuristic Approach For Solving Serially Distributed Storage Depots Under General-Integer Policy," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(04), pages 479-497.
    • Handle: RePEc:wsi:apjorx:v:24:y:2007:i:04:n:s0217595907001346
    DOI: 10.1142/S0217595907001346
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595907001346
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595907001346?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:apjorx:v:24:y:2007:i:04:n:s0217595907001346. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.