arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.02553math.OC
收藏

即时商务品类规划问题的整数规划方法

An integer programming approach for quick-commerce assortment planning

Yajing Chen, Taotao He, Ying Rong, Yunlong Wang

AI总结:

针对即时商务中结合实体店与线上个性化品类的NP难规划问题,提出整数规划方法,通过凸包结果和分离算法实现全局最优求解,显著提升计算效率。

摘要:

在本文中,我们探讨了即时商务背景下的品类规划挑战。即时商务是一种快速增长的业务模式,旨在配送时效性强的商品。为了实现快速配送以满足附近线上客户的即时需求,个性化在线品类需要被纳入实体店的商品供应中。由于存在这种物理关联要求,以及针对线上消费者细分市场的不同多项Logit选择模型,公司旨在通过为本地门店选择最优商品品类,并为每个线上消费者细分市场量身定制个性化品类,来最大化整体收入。我们采用整数规划方法将该NP难问题求解至全局最优。具体而言,我们推导出凸包结果,以在一般类运营约束下表示每个线上细分市场的消费者选择,并刻画品类决策与产品选择概率之间的关系。我们的凸包结果,结合一种改进的选择概率有序分离算法,所产生的公式相比现有方法具有显著的计算优势。最后,我们展示了如何利用我们的凸包结果来解决其他品类优化问题。

英文摘要:

In this paper, we explore the challenge of assortment planning in the context of quick-commerce, a rapidly-growing business model that aims to deliver time-sensitive products. In order to achieve quick delivery to satisfy the immediate demands of online customers in close proximity, personalized online assortments need to be included in brick-and-mortar store offerings. With the presence of this physical linkage requirement and distinct multinomial logit choice models for online consumer segments, the firm seeks to maximize overall revenue by selecting an optimal assortment of products for local stores and by tailoring a personalized assortment for each online consumer segment. We employ an integer programming approach to solve this NP-hard problem to global optimality. In particular, we derive convex hull results to represent the consumer choice of each online segment under a general class of operational constraints, and to characterize the relation between assortment decisions and choice probabilities of products. Our convex hull results, coupled with a modified choice probability ordered separation algorithm, yield formulations that provide a significant computational advantage over existing methods. Finally, we illustrate how our convex hull results can be used to address other assortment optimization problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑