谷歌浏览器插件
订阅小程序
在清言上使用

Tricks from the Trade for Large-Scale Markdown Pricing: Heuristic Cut Generation for Lagrangian Decomposition

Robert Streeck, Torsten Gellert, Andreas Schmitt, Asya Dipkaya, Vladimir Fux,Tim Januschowski,Timo Berthold

arXiv (Cornell University)(2024)

引用 0|浏览7
暂无评分
摘要
In automated decision making processes in the online fashion industry, the'predict-then-optimize' paradigm is frequently applied, particularly formarkdown pricing strategies. This typically involves a mixed-integeroptimization step, which is crucial for maximizing profit and merchandisevolume. In practice, the size and complexity of the optimization problem isprohibitive for using off-the-shelf solvers for mixed integer programs andspecifically tailored approaches are a necessity. Our paper introduces specificheuristics designed to work alongside decomposition methods, leading toalmost-optimal solutions. These heuristics, which include both primal heuristicmethods and a cutting plane generation technique within a Lagrangiandecomposition framework, are the core focus of the present paper. We provideempirical evidence for their effectiveness, drawing on real-world applicationsat Zalando SE, one of Europe's leading online fashion retailers, highlightingthe practical value of our work. The contributions of this paper are deeplyingrained into Zalando's production environment to its large-scale catalogranging in the millions of products and improving weekly profits by millions ofEuros.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要