IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i2p201-219.html
   My bibliography  Save this article

Variable neighborhood search incorporating a new bounding procedure for joint replenishment and delivery problem

Author

Listed:
  • Lin Wang
  • Rui Liu
  • Shan Liu

Abstract

In recent years, joint replenishment and delivery problem (JRD) has been examined extensively in the context of replenishment and inventory control. However, as an extension of joint replenishment problem, the JRD is more complex and difficult to optimize with an exact algorithm. In this study, lower and upper bounds of JRD are obtained approximately but quickly using a novel bounding procedure. Then, a variable neighborhood search (VNS) with the bounding method is developed to solve the JRD. Computational examples show that the bounding procedure can effectively and efficiently determine satisfactory bounds, which are helpful for the proposed VNS. Results of randomly generated examples further indicate that the hybrid VNS performs better than the best known heuristic and metaheuristic for JRD in terms of accuracy.

Suggested Citation

  • Lin Wang & Rui Liu & Shan Liu, 2018. "Variable neighborhood search incorporating a new bounding procedure for joint replenishment and delivery problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 201-219, February.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:2:p:201-219
    DOI: 10.1057/s41274-017-0188-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0188-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0188-5?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yao, Ming-Jong & Lin, Jen-Yen & Lin, Yu-Liang & Fang, Shu-Cherng, 2020. "An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    2. Carvajal, Jimmy & Castaño, Fabian & Sarache, William & Costa, Yasel, 2020. "Heuristic approaches for a two-echelon constrained joint replenishment and delivery problem," International Journal of Production Economics, Elsevier, vol. 220(C).

    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:taf:tjorxx:v:69:y:2018:i:2:p:201-219. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.