Evaluating pricing strategies for premium delivery time windows

被引:4
|
作者
Koehler, Charlotte [1 ]
Ehmke, Jan Fabian [2 ]
Campbell, Ann Melissa [3 ]
Cleophas, Catherine [4 ]
机构
[1] Europa Univ Viadrina, Dept Data Sci & Decis Support, Frankfurt, Germany
[2] Univ Wien, Dept Business Decis & Analyt, Vienna, Austria
[3] Univ Iowa, Dept Business Analyt, Iowa City, IA USA
[4] Univ Kiel, Inst Business, Kiel, Germany
关键词
Pricing strategies; Routing; Dynamic pricing; Customer acceptance; Attended home deliveries; Route flexibility; NESTED LOGIT-MODELS;
D O I
10.1016/j.ejtl.2023.100108
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In the challenging environment of attended home deliveries, pricing delivery options can play a crucial role to ensure profitability and service quality of retailers. To differentiate between standard and premium delivery options, many retailers include time windows of various lengths and fees within their offer sets. Even though customers prefer short delivery time windows, longer time windows can help maintaining flexibility and profitability for the retailer. We classify pricing strategies along two dimensions: static versus dynamic price setting and whether an offer set can include one or multiple price points. For static pricing, we implement price configurations that reflect current business practice. For the dynamic pricing, we adapt routing mechanisms that consider the flexibility within the underlying route plan during the booking process and set delivery fees accordingly. To evaluate the pricing strategies under plausibly realistic conditions, we model customer behavior through a nested logit model. This model represents customer choice as sequential decisions between premium and standard time windows. We perform a computational study considering realistic travel and demand data to investigate the effectiveness of static and dynamic time window pricing. Finally, we offer managerial insights and an outlook into applying strategic analysis to decide on price setting strategies.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Pricing strategies for differentiated services content delivery networks
    Ercetin, O
    Tassiulas, L
    COMPUTER NETWORKS, 2005, 49 (06) : 840 - 855
  • [22] On the CDN Pricing Strategies in the Internet Traffic Delivery Chain
    Lee, Seunghyun
    Joo, Changhee
    35TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2021), 2021, : 680 - 682
  • [23] Investigating airline customers' premium coach seat purchases and implications for optimal pricing strategies
    Mumbower, Stacey
    Garrow, Laurie A.
    Newman, Jeffrey P.
    TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2015, 73 : 53 - 69
  • [24] Evaluating Delivery-Time Reduction Strategies for Collimated Proton Arc Therapy Plans
    Wake, K. K.
    Bennett, L.
    Patwardhan, K. A.
    Smith, B. R.
    Culberson, W. S.
    Hyer, D. E.
    Flynn, R. T.
    Nelson, N. P.
    Hill, P. M.
    MEDICAL PHYSICS, 2024, 51 (09) : 6638 - 6638
  • [25] Additional Practice Papers: Premium pricing: Understanding the value of premium
    Jamie Allsopp
    Journal of Revenue and Pricing Management, 2005, 4 (2) : 185 - 194
  • [26] Integrated scheduling of production and delivery with time windows
    Low, Chinyao
    Li, Rong-Kwei
    Chang, Chien-Min
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (03) : 897 - 909
  • [27] The pickup and delivery problem with time windows and transshipment
    Department of Mathematics, Simon Fraser University, 13450-102 Avenue, Surrey, BC V3T 5X3, Canada
    不详
    INFOR, 2006, 3 (217-227)
  • [28] A metaheuristic for the pickup and delivery problem with time windows
    Li, HB
    Lim, A
    ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2001, : 160 - 167
  • [29] The pickup and delivery problem with time windows and transshipment
    Mitrovic-Minic, Snezana
    Laporte, Gilbert
    INFOR, 2006, 44 (03) : 217 - 227
  • [30] A metaheuristic for the delivery man problem with time windows
    Ha-Bang Ban
    Journal of Combinatorial Optimization, 2021, 41 : 794 - 816