Offline-Channel Planning in Smart Omnichannel Retailing

全渠道 在线和离线 计算机科学 频道(广播) 运筹学 启发式 数学优化 数学 计算机网络 万维网 操作系统
作者
Jian Chen,Yong Liang,Hao Shen,Zuo‐Jun Max Shen,Mengying Xue
出处
期刊:Manufacturing & Service Operations Management [Institute for Operations Research and the Management Sciences]
卷期号:24 (5): 2444-2462 被引量:42
标识
DOI:10.1287/msom.2021.1036
摘要

Problem definition: Observing the retail industry inevitably evolving into omnichannel, we study an offline-channel planning problem that helps an omnichannel retailer make store location and location-dependent assortment decisions in its offline channel to maximize profit across both online and offline channels, given that customers’ purchase decisions depend on not only their preferences across products but also, their valuation discrepancies across channels, as well as the hassle costs incurred. Academic/practical relevance: The proposed model and the solution approach extend the literature on retail-channel management, omnichannel assortment planning, and the broader field of smart retailing/cities. Methodology: We derive parameterized models to capture customers’ channel choice and product choice behaviors and customize a corresponding parameter estimation approach employing the expectation-maximization method. To solve the proposed optimization model, we develop a tractable mixed integer second-order conic programming reformulation and explore the structural properties of the reformulation to derive strengthening cuts in closed form. Results: We numerically validate the efficacy of the proposed solution approach and demonstrate the parameter estimation approach. We further draw managerial insights from the numerical studies using real data sets. Managerial implications: We verify that omnichannel retailers should provide location-dependent offline assortments. In addition, our benchmark studies reveal the necessity and significance of jointly determining offline store locations and assortments, as well as of incorporating the online channel while making offline-channel planning decisions.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
molihuakai应助新叶采纳,获得10
刚刚
花开富贵完成签到,获得积分10
刚刚
脑洞疼应助chen采纳,获得10
1秒前
LLc发布了新的文献求助10
1秒前
浅香千雪发布了新的文献求助10
1秒前
彭于晏应助感动函采纳,获得10
1秒前
小马甲应助lingling采纳,获得10
1秒前
shelemi发布了新的文献求助10
2秒前
2秒前
大个应助雪意采纳,获得10
2秒前
sjl完成签到,获得积分10
2秒前
2秒前
CodeCraft应助焱鑫采纳,获得10
2秒前
慕青应助123采纳,获得10
2秒前
李帅超完成签到,获得积分10
3秒前
3秒前
情怀应助平淡的井采纳,获得30
3秒前
有魅力嚓茶完成签到,获得积分20
3秒前
汉堡包应助XY采纳,获得10
4秒前
星辰大海应助Spy_R采纳,获得10
4秒前
墙雨轩发布了新的文献求助20
4秒前
李木子发布了新的文献求助10
5秒前
huhuiya完成签到 ,获得积分10
5秒前
5秒前
MozzieMiao应助缥缈的闭月采纳,获得100
5秒前
6秒前
Akim应助荔枝多酚采纳,获得10
6秒前
kajikaji6完成签到,获得积分10
6秒前
ysxxx完成签到,获得积分10
6秒前
LLLLL完成签到,获得积分20
7秒前
灵巧芷天发布了新的文献求助10
7秒前
纪元龙完成签到,获得积分10
7秒前
完美世界应助橙神采纳,获得10
7秒前
Liuxinyan发布了新的文献求助10
7秒前
山山而川发布了新的文献求助10
8秒前
英俊的铭应助雪落采纳,获得10
8秒前
8秒前
9秒前
9秒前
如果应助jiongrz采纳,获得10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Autoparametric Resonance in Mechanical Systems 1000
Effects of Two Weeks of Red Light Therapy on Choroidal Thickness and Axial Length in Young Adults 700
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 600
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Rutherford's Vascular Surgery and Endovascular Therapy, 2‑Volume Set, 11th Edition 480
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7665094
求助须知:如何正确求助?哪些是违规求助? 9235121
关于积分的说明 19871553
捐赠科研通 7234252
什么是DOI,文献DOI怎么找? 3283327
关于科研通互助平台的介绍 2442226
邀请新用户注册赠送积分活动 2284394