A weighted goal programming approach for replenishment planning and space allocation in a supermarket

We propose a mixed integer non-linear goal programming model for replenishment planning and space allocation in a supermarket in which some constraints on budget, space, holding times of perishable items, and number of replenishments are considered and weighted deviations from two conflicting objectives, namely profitability and customer service level, are minimized. We apply a minimum–maximum approach to introduce demand where the maximum demand is a function of price change and allocated space. Each item is presented in the form of multiple brands, probably exposed to price changes, competing to obtain more space. In addition to inventory investment costs, replenishment costs, and inventory holding costs we also include costs related to non-productive use of space. The order quantity, the amount of allocated showroom and backroom spaces, and the cycle time of joint replenishments are key decision variables. We also propose an extended model in which price is a decision variable. Finally we solve the model using LINGO software and provide computational results.