Demand prediction and price optimization for semi-luxury supermarket segment

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. 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.5years 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.

[1]  R. Phillips,et al.  The Oxford Handbook of Pricing Management , 2012 .

[2]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Junxiu Jia,et al.  Dynamic ordering and pricing for a perishable goods supply chain , 2011, Comput. Ind. Eng..

[4]  B. Pradhan,et al.  GIS-based modeling of rainfall-induced landslides using data mining-based functional trees classifier with AdaBoost, Bagging, and MultiBoost ensemble frameworks , 2016, Environmental Earth Sciences.

[5]  Gabriel R. Bitran,et al.  An overview of pricing models for revenue management , 2003, IEEE Engineering Management Review.

[6]  Stephen A. Smith,et al.  Clearance Pricing and Inventory Policies for Retail Chains , 1998 .

[7]  Giovanni Giuffrida,et al.  Turning Datamining into a Management Science Tool: New Algorithms and Empirical Results.: New Algorithms and Empirical Results. , 2000 .

[8]  Nan Liu,et al.  Pricing games of mixed conventional and e-commerce distribution channels , 2013, Comput. Ind. Eng..

[9]  Sheldon H. Jacobson,et al.  Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning , 2016, Discret. Optim..

[10]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[11]  A. Prasad,et al.  Newer Classification and Regression Tree Techniques: Bagging and Random Forests for Ecological Prediction , 2006, Ecosystems.

[12]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[13]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[14]  Steven T. Berry,et al.  Automobile Prices in Market Equilibrium , 1995 .

[15]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[16]  P. Parker,et al.  Marketing universals: Consumers' use of brand name, price, physical appearance, and retailer , 1994 .

[17]  Pinar Keskinocak,et al.  Dynamic pricing in the presence of inventory considerations: research overview, current practices, and future directions , 2003, IEEE Engineering Management Review.

[18]  R. Lewis.  An Introduction to Classification and Regression Tree (CART) Analysis , 2000 .

[19]  Sandra Alemany,et al.  An ensemble of ordered logistic regression and random forest for child garment size matching , 2016, Comput. Ind. Eng..

[20]  Thomas G. Dietterich.  An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization , 2000, Machine Learning.

[21]  Andy Liaw,et al.  Classification and Regression by randomForest , 2007 .

[22]  Sébastien Thomassey,et al.  Sales forecasts in clothing industry: The key success factor of the supply chain management , 2010 .

[23]  Tor Guimaraes,et al.  Assessing the moderating effect of consumer product knowledge and online shopping experience on using recommendation agents for customer loyalty , 2013, Decis. Support Syst..

[24]  Malin Song,et al.  Customer profitability forecasting using Big Data analytics: A case study of the insurance industry , 2016, Comput. Ind. Eng..

[25]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[26]  Paul S. Bradley,et al.  Refining Initial Points for K-Means Clustering , 1998, ICML.

[27]  David Simchi-Levi,et al.  Analytics for an Online Retailer: Demand Forecasting and Price Optimization , 2016, Manuf. Serv. Oper. Manag..

[28]  G DietterichThomas.  An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees , 2000 .

[29]  Burak Kazaz,et al.  Wine Futures and Advance Selling Under Quality Uncertainty , 2015, Manuf. Serv. Oper. Manag..

[30]  Chen-Yang Cheng,et al.  Dynamic cost forecasting model based on extreme learning machine - A case study in steel plant , 2016, Comput. Ind. Eng..

[31]  Wolfgang Müller,et al.  Applying decision tree methodology for rules extraction under cognitive constraints , 2002, Eur. J. Oper. Res..

[32]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..