标题:Demand prediction and price optimization for semi-luxury supermarket segment
作者:Qu, T.; Zhang, J. H.; Chan, Felix T. S.; Srivastava, R. S.; Tiwari, M. K.; Park, Woo-Yong
作者机构:[Qu, T.] Jinan Univ, Sch Elect & Informat Engn, Zhuhai Campus, Zhuhai 519070, Peoples R China.; [Zhang, J. H.] Shandong Univ, Sch Management, Jinan 更多
通讯作者:Zhang, JH
通讯作者地址:[Zhang, JH]Shandong Univ, Sch Management, Jinan 250100, Shandong, Peoples R China.
来源:COMPUTERS & INDUSTRIAL ENGINEERING
出版年:2017
卷:113
页码:91-102
DOI:10.1016/j.cie.2017.09.004
关键词:Branch and bound; Data mining; Integer programming; Analytics;; Retailing; Assignment
摘要: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. (C) 2017 Elsevier Ltd. All rights reserved.
收录类别:EI;SCOPUS;SCIE;SSCI
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029546623&doi=10.1016%2fj.cie.2017.09.004&partnerID=40&md5=07d65bd0bca478f3f7e38ae57d853ecb
TOP