Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 1 h ago
PreprintarXiv licencearXiv

Assortment Control Unlocks the Value of Dynamic Pricing in Mixed Last-Mile Delivery

Abstract

The growth of e-commerce has intensified the need for last-mile delivery systems that can jointly manage customer choice and operational efficiency. We study the Dynamic Offering and Pricing of Mixed Delivery Options problem, in which a logistics service provider dynamically selects and prices attended home-delivery time slots and out-of-home pickup options for sequentially arriving customers. Each decision affects immediate revenue, customer acceptance, and the route-dependent fulfillment cost realized at the end of the booking horizon. We formulate DOPMDO as a finite-horizon Markov decision process and propose State-Value Anchored Pricing via Approximate Dynamic Programming. The method learns a continuation-value approximation on an aggregate state representation of the mixed-delivery system and uses accepted-versus-rejected value differences to estimate option-level opportunity costs. These opportunity costs are embedded in an anchored trust-region pricing problem around a calibrated fine-static benchmark. Computational experiments on the real-world Seattle instance show that SVAP--ADP increases mean episode profit by 7.0\% relative to current practice (95\% CI: 6.7--7.2\%), primarily by reducing terminal fulfillment cost while maintaining a stable home--locker--opt-out mix. Assortment-control experiments show that dynamic pricing is most effective when the menu exposes operationally valuable locker alternatives, with richer candidate pools delivering substantially larger gains than restricted nearest-locker menus. These results indicate that anticipatory pricing and assortment control are complementary: pricing steers customers toward lower-cost options, but the menu determines whether high-value consolidation opportunities are available in the first place.

Related

  1. Pricing Today, Shaping Tomorrow: Contextual Dynamic Pricing in Purchase-Driven Evolving Systems
    Jinjiang Zou, Yang Li, Zemin Zheng
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Mean Field Games in Dynamic Ticket Pricing with Overselling and Cancellations
    Yuzhou Chen, Yumiharu Nakano
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Scalable Dynamic Pricing of Substitutable Products through Structure-Guided Policy Learning
    Yue Su, Antoine Désir, Axel Parmentier
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Source-Aware Dynamic Pricing with Strategic Buyers
    Jinjiang Zou, Yang Li, Zemin Zheng
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Inter-Temporal Price Constraints in Dynamic Pricing: Performance Guarantees Under Price Monotonicity and Promotion Fatigue
    Weiyuan Li, Paat Rusmevichientong, Huseyin Topaloglu
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{zhou2026assortment,
  title = {{Assortment Control Unlocks the Value of Dynamic Pricing in Mixed Last-Mile Delivery}},
  author = {Ze Zhou and Balázs Kulcsár},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.13539},
  eprint = {2609.13539},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13539},
}
RIS
TY  - UNPB
TI  - Assortment Control Unlocks the Value of Dynamic Pricing in Mixed Last-Mile Delivery
AU  - Ze Zhou
AU  - Balázs Kulcsár
PY  - 2026
DA  - 2026/09/11
PB  - arXiv
DO  - 10.48550/arxiv.2609.13539
UR  - https://arxiv.org/abs/2609.13539
AB  - The growth of e-commerce has intensified the need for last-mile delivery systems that can jointly manage customer choice and operational efficiency. We study the Dynamic Offering and Pricing of Mixed Delivery Options problem, in which a logistics service provider dynamically selects and prices attended home-delivery time slots and out-of-home pickup options for sequentially arriving customers. Each decision affects immediate revenue, customer acceptance, and the route-dependent fulfillment cost realized at the end of the booking horizon. We formulate DOPMDO as a finite-horizon Markov decision process and propose State-Value Anchored Pricing via Approximate Dynamic Programming. The method learns a continuation-value approximation on an aggregate state representation of the mixed-delivery system and uses accepted-versus-rejected value differences to estimate option-level opportunity costs. These opportunity costs are embedded in an anchored trust-region pricing problem around a calibrated fine-static benchmark. Computational experiments on the real-world Seattle instance show that SVAP--ADP increases mean episode profit by 7.0\% relative to current practice (95\% CI: 6.7--7.2\%), primarily by reducing terminal fulfillment cost while maintaining a stable home--locker--opt-out mix. Assortment-control experiments show that dynamic pricing is most effective when the menu exposes operationally valuable locker alternatives, with richer candidate pools delivering substantially larger gains than restricted nearest-locker menus. These results indicate that anticipatory pricing and assortment control are complementary: pricing steers customers toward lower-cost options, but the menu determines whether high-value consolidation opportunities are available in the first place.
ER  -