Demand prediction and price optimization for semi-luxury supermarket segment. (November 2017)

• Record Type: Journal Article
• Authors: Qu, T.; Zhang, J.H.; Chan, Felix T.S.; Srivastava, R.S.; Tiwari, M.K.; Park, Woo-Yong
• Is Part Of: Computers & industrial engineering. Volume 113(2017)
• Page Start: 91
• Page End: 102
• Publication Date: 2017-11
• Subjects: Branch and bound -- Data mining -- Integer programming -- Analytics -- Retailing -- Assignment; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2017.09.004
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A twofold approach to formulate pricing policy for semi-luxury supermarket commodities. The pricing decision relies on tree-based demand prediction model. Price-demand interdependency has been incorporated in the optimization problem using competing styles. Formulation is solved by recursive branch-and-bound based heuristics. Abstract: Offline retail stores face day-to-day challenges in clearing out expensive and high-end luxury products. In case of high-end priced products, the demand is seasonal and sensitive. The investment involves high risk and revenues vary beyond fathomable bounds. The primary objective of this research is to present a decision-support system for retail pricing and revenue optimization of these retail products. The sales data of past 2.5 years from prominent retail stores across 45 different regions has been used to develop this study. A regression tree/random forest-based machine learning algorithm is used to predict weekly demand. It incorporates price, holidays, discounts, inventory and other regional factors in decision making. Following this, the demand-price interdependencies are quantified and integrated into an integer linear programming model for optimal price allocation. This methodology has been implemented on offline retailing of expensive products which generally follow high variation in demand. The expected revenue has been optimized by branch & bound and branch & cut method, followed by root node analysis. The solution is further optimized by heuristic methods.