Markdown optimization at multiple stores

This article studies a markdown optimization problem commonly faced by many large retailers that involves joint decisions on inventory allocation and markdown pricing at multiple stores subject to various business rules. At the beginning of the markdown planning horizon, there is a certain amount of inventory of a product at a warehouse that needs to be allocated to many retail stores served by the warehouse over the planning horizon. In the same time, a markdown pricing scheme needs to be determined for each store over the planning horizon. A number of business rules for inventory allocation and markdown prices at the stores must be satisfied. The retailer does not have a complete knowledge about the probability distribution of the demand at a given store in a given time period. The retailer’s knowledge about the demand distributions improves over time as new information becomes available. Hence, the retailer employs a rolling horizon approach where the problem is re-solved at the beginning of each period by incorporating the latest demand information. It is shown that the problem involved at the beginning of each period is NP-hard even if the demand functions are deterministic and there is only a single store or a single time period. Thus, attention is focused on heuristic solution approaches. The stochastic demand is modeled using discrete demand scenarios based on the retailer’s latest knowledge about the demand distributions. This enables possible demand correlations to be modeled across different time periods. The problem involved at the beginning of each period is formulated as a mixed-integer program with demand scenarios and it is solved using a Lagrangian relaxation – based decomposition approach. The approach is implimented on a rolling horizon basis and it is compared with several commonly used benchmark approaches in practice. An extensive set of computational experiments is perfomed under various practical situations, and it is demonstrated that the proposed approach significantly outperforms the benchmark approaches. A number of managerial insights are derived about the impact of business rules and price sensitivity of individual stores on the total expected revenue and on the optimal inventory allocation and pricing decisions.

[1]  Murali K. Mantrala,et al.  A Decision-Support System that Helps Retailers Decide Order Quantities and Markdowns for Fashion Goods , 2001, Interfaces.

[2]  Baichun Xiao,et al.  Maximizing Revenues of Perishable Assets with a Risk Factor , 1999, Oper. Res..

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

[4]  Linus Schrage,et al.  OR Practice - A Scenario Approach to Capacity Planning , 1989, Oper. Res..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Narendra Agrawal,et al.  A discrete optimization model for seasonal merchandise planning , 1998 .

[7]  G. Gallego,et al.  Optimal starting times for end-of-season sales and optimal stopping times for promotional fares , 1995 .

[8]  Russell C. H. Cheng,et al.  Optimal pricing policies for perishable products , 2005, Eur. J. Oper. Res..

[9]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[10]  Ruth N. Bolton,et al.  An Empirical Analysis of Determinants of Retailer Pricing Strategy , 2004 .

[11]  G. Gallego,et al.  Perishable Asset Revenue Management with Markovian Time Dependent Demand Intensities , 2000 .

[12]  C. M. Shetty,et al.  Nonlinear Programming - Theory and Algorithms, Second Edition , 1993 .

[13]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[14]  Mei-Shiang Chang,et al.  A scenario planning approach for the flood emergency logistics preparation problem under uncertainty , 2007 .

[15]  Felipe Caro,et al.  Clearance Pricing Optimization for a Fast-Fashion Retailer , 2010, Oper. Res..

[16]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[17]  Richard E. Chatwin,et al.  Optimal dynamic pricing of perishable products with stochastic demand and a finite set of prices , 2000, Eur. J. Oper. Res..

[18]  Gautam Mitra,et al.  An application of Lagrangian relaxation to a capacity planning problem under uncertainty , 2001, J. Oper. Res. Soc..

[19]  Dan Zhang,et al.  Managing Clearance Sales in the Presence of Strategic Customers , 2008 .

[20]  Gabriel R. Bitran,et al.  Coordinating Clearance Markdown Sales of Seasonal Products in Retail Chains , 1998, Oper. Res..

[21]  Eric T. Anderson,et al.  Effects of $9 Price Endings on Retail Sales: Evidence from Field Experiments , 2003 .

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

[23]  Harald Hruschka,et al.  Clusterwise pricing in stores of a retail chain , 2007, OR Spectr..

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

[25]  R. L. Hall,et al.  PRICE THEORY AND BUSINESS BEHAVIOUR , 1939 .

[26]  Susana V. Mondschein,et al.  Periodic Pricing of Seasonal Products in Retailing , 1997 .

[27]  Murali K. Mantrala,et al.  A Decision-Support System that Helps Retailers Decide Order Quantities and Markdowns for Fashion Goods , 2001 .

[28]  Wenjiao Zhao,et al.  Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand , 2000 .

[29]  Dan Zhang,et al.  Pricing substitutable flights in airline revenue management , 2009, Eur. J. Oper. Res..

[30]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[31]  Panagiotis Kouvelis,et al.  Dynamic Pricing and Inventory Control of Substitute Products , 2009, Manuf. Serv. Oper. Manag..

[32]  Zhi-Long Chen,et al.  Recent Developments in Dynamic Pricing Research: Multiple Products, Competition, and Limited Demand Information , 2015 .