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

Lin Wang, Rui Liu and Shan Liu

Journal of the Operational Research Society, 2018, vol. 69, issue 2, 201-219

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.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1057/s41274-017-0188-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:69:y:2018:i:2:p:201-219

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1057/s41274-017-0188-5

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().