An integer programming approach for quick-commerce assortment planning

整数规划 计算机科学 整数(计算机科学) 运筹学 数学 算法 程序设计语言
作者
Yajing Chen,Taotao He,Ying Rong,Yunlong Wang
出处
期刊:Cornell University - arXiv 被引量:1
标识
DOI:10.48550/arxiv.2405.02553
摘要

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 (MNL) 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 refer to this problem as quick-commerce assortment planning (QAP). We employ an integer programming approach to solve this NP-hard problem to global optimality. Specifically, we propose convexification techniques to handle its combinatorial and nonconvex nature. We capture the consumer choice of each online segment using a convex hull representation. By exploiting the geometry behind Luce's choice axiom, we provide a compact polyhedral characterization of the convex hull under various operational constraints that are not totally-unimodular. Furthermore, we conduct a polyhedral study on the relation between assortment decisions for products to offer and choice probabilities of products under the MNL model.Our methodology, coupled with a modified choice probability ordered separation algorithm, yields formulations that provide a significant computational advantage over existing methods. Through comprehensive numerical studies, we emphasize the significance of aligning offline and online assortment decisions and underscore the perils associated with inaccurately specifying customer behavior models.

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
小白完成签到,获得积分10
刚刚
1秒前
天际完成签到,获得积分10
1秒前
多多洛完成签到,获得积分10
2秒前
小田完成签到,获得积分10
2秒前
3秒前
ymlllym发布了新的文献求助10
3秒前
ZXK完成签到 ,获得积分10
3秒前
herococa应助青云采纳,获得10
4秒前
4秒前
桐桐应助孤独的宛采纳,获得10
4秒前
4秒前
4秒前
4秒前
所所应助View采纳,获得10
5秒前
kylin完成签到,获得积分10
5秒前
科研通AI5应助jiaojiao采纳,获得10
6秒前
科研通AI5应助vikey采纳,获得10
6秒前
谭红发布了新的文献求助10
6秒前
Z2222完成签到,获得积分10
7秒前
7秒前
BINGBING发布了新的文献求助10
8秒前
Niu发布了新的文献求助10
9秒前
婆婆丁应助wwwteng呀采纳,获得10
9秒前
9秒前
bkagyin应助活火山采纳,获得10
9秒前
Self完成签到,获得积分10
10秒前
鸣笛应助务实的胡萝卜采纳,获得10
10秒前
11秒前
Orange应助研友_LjVYlL采纳,获得10
11秒前
11秒前
允柠完成签到,获得积分10
11秒前
cx关闭了cx文献求助
11秒前
勤恳马里奥应助锦墨人生采纳,获得10
12秒前
隐形曼青应助土豪的麦片采纳,获得10
12秒前
12秒前
元煜祺完成签到,获得积分10
12秒前
13秒前
陈浩南xy完成签到,获得积分10
13秒前
14秒前
高分求助中
(禁止应助)【重要!!请各位详细阅读】【科研通的精品贴汇总】 10000
Semantics for Latin: An Introduction 1099
Biology of the Indian Stingless Bee: Tetragonula iridipennis Smith 1000
Robot-supported joining of reinforcement textiles with one-sided sewing heads 760
2025-2030年中国消毒剂行业市场分析及发展前景预测报告 500
2024-2030年中国石英材料行业市场竞争现状及未来趋势研判报告 500
镇江南郊八公洞林区鸟类生态位研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4145983
求助须知:如何正确求助?哪些是违规求助? 3682548
关于积分的说明 11636575
捐赠科研通 3375064
什么是DOI,文献DOI怎么找? 1853317
邀请新用户注册赠送积分活动 915856
科研通“疑难数据库(出版商)”最低求助积分说明 830067