Abstract

Before reaching the store, products generally flow through the retail distribution system as larger bundles, the so-called case packs (CP). In several studies these case packs have been identified as having a significant impact on distribution logistics efficiency. In this paper we develop a quantitative model and solution approach determining optimal case-pack sizes for non-perishable products in grocery retailing. The model captures the relevant operative cost drivers along the internal supply chain of a large bricks-and-mortar retailer. It explicitly represents each day of the retailer’s business week, where the replenishment doctrine considered generalizes the well-known periodic review reorder point (r, s, nq) policy as a stationary cyclic version. Exact and approximate methods are developed to evaluate the costs of a model instance. In addition, an optimization procedure is outlined that uses either exact or approximate methods to identify optimal and near-optimal CP sizes for a single store as well as for a network of multiple stores to be operated with one common CP. Applied to real-world examples of a large European retail chain, the methods reveal average cost improvement potential of more than 20% by adjusting the CP sizes that are currently in use. The approach presented is thus shown to be a valuable addition to any integrative retail supply chain planning system. Its results are directly applicable to retail practice.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.