Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.13539

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

Ze Zhou·Balázs Kulcsár
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ze Zhou, Balázs Kulcsár. 2026-09-11. Assortment Control Unlocks the Value of Dynamic Pricing in Mixed Last-Mile Delivery. https://arxiv.org/abs/2609.13539

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗