SearcharxivSearch

arXiv · 2002.10810

Profit-Maximizing Parcel Locker Location Problem under Threshold Luce Model

Abstract

The growth of e-commerce has created increasing complexity in logistics services. To remain competitive, logistics and e-commerce companies are exploring new modes as supplements to traditional home delivery, one of which is the self-service parcel locker. This paper studies a parcel locker location problem where a company plans to introduce the locker service by locating locker facilities to attract customers. The objective is to maximize the profit, accounting for the revenue and the cost of facilities. To estimate the revenue, we use the threshold Luce model (TLM) to predict customers' likelihood of using the locker service. We then propose a combinatorial optimization model and develop exact solution methodologies that are practically implementable according to our extensive computational experiments. In effect, our modeling framework generalizes the traditional facility location problems based on the binomial logit model (BNL) and the multinomial logit model (MNL), both of which impose strong and strict assumptions on the customer's choice sets. That is, they assume that the choice sets will either contain only one facility or all facilities. In our numerical experiment, we demonstrate that using the BNL and the MNL in the locker location problem could lead to, respectively, pessimistic and optimistic revenue estimation. Consequently, the suggested location decisions will be either conservative or aggressive. Our proposed model, by contrast, can effectively relax these assumptions. Our results also reveal that the aggressive decision due to the use of the MNL will incur an unnecessarily high facility cost that cannot be compensated by the additional revenue, leading to profit loss that can be significant in various scenarios. Finally, we conduct sensitivity analysis on the input parameters and draw additional implications.

Explore related subjects

Keep this discovery

BibTeXRIS

Yun Hui Lin, Yuan Wang, Loo Hay Lee, Ek Peng Chew. 2020-02-25. Profit-Maximizing Parcel Locker Location Problem under Threshold Luce Model. https://arxiv.org/abs/2002.10810

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC