Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.10153

Last-mile Delivery: Optimal Locker Location Under Multinomial Logit Choice Model

Yun Hui Lin·Dongdong He·Yuan Wang·Loo Hay Lee
View original source ↗Read source document ↗Export metadata ↓

Abstract

One innovative solution to the last-mile delivery problem is the self-service locker system. Motivated by a real case in Singapore, we consider a POP-Locker Alliance who operates a set of POP-stations and wishes to improve the last-mile delivery by opening new locker facilities. We propose a quantitative approach to determine the optimal locker location with the objective to maximize the overall service provided by the alliance. Customer's choices regarding the use of facilities are explicitly considered. They are predicted by a multinomial logit model. We then formulate the location problem as a multi-ratio linear-fractional 0-1 program and provide two solution approaches. The first one is to reformulate the original problem as a mixed-integer linear program, which is further strengthened using conditional McCormick inequalities. This approach is an exact method, developed for small-scale problems. For large-scale problems, we propose a Suggest-and-Improve framework with two embedded algorithms. Numerical studies indicated that our framework is an efficient approach that yields high-quality solutions. Finally, we conducted a case study. The results highlighted the importance of considering the customers' choices. Under different parameter values of the multinomial logit model, the decisions could be completely different. Therefore, the parameter value should be carefully estimated in advance.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yun Hui Lin, Dongdong He, Yuan Wang, Loo Hay Lee. 2020-02-24. Last-mile Delivery: Optimal Locker Location Under Multinomial Logit Choice Model. https://arxiv.org/abs/2002.10153

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

KEEP EXPLORING

Related papers

arXiv2026

Third-Order Newton Methods with Semidefinite Programming

We study a third-order Newton method in which each iteration is obtained by minimizing the third-order Taylor expansion of the objective via a semidefinite programming (SDP) subproblem. In contrast to classical Newton methods, which rely on quadratic approximations, our approach leverages higher-order information to better capture the local geometry of the objective. We establish cubic convergence under standard assumptions, including strong convexity and sufficiently accurate initialization. We also propose practical modifications to address infeasibility of the SDP subproblem, including regularization and alternative objective formulations.

math.OC↗
arXiv2026

Linear quasi-shrinkage estimator for high-dimensional optimization with linear constraints

In large-scale data-driven optimization problems, parameters are often only known approximately due to noisy and small-sized samples. We consider optimization problems with linear constraints where the true parameter matrix is not precisely known, and the number of constraints and variables are both large. Our goal is to construct a linear estimator of the true parameter matrix by minimizing the Frobenius distance between the estimator and the true parameter matrix. Our method offers three key advantages: 1) the coefficients of the linear estimator are consistently estimated from the observations and require no further calibration; 2) it only requires the sample size to be greater than one and it delivers stable performance across varied sample sizes; and 3) the constraints of the formulated optimization problem using the estimator remain linear, ensuring computational efficiency when the number of constraints and variables are large. Simulation shows that our linear estimator consistently produces stable outcomes in terms of the objective value, the ratio of violated constraints and the magnitude of constraint violation across various scenarios, compared to the nominal and robust methods. Additionally, it demonstrates resilience against high levels of noise, making it a robust choice under uncertainty.

math.OC↗
arXiv2026

Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization

Bayesian optimisation (BO) enables sample-efficient global optimisation of expensive black-box functions but remains challenging in high dimensions. We investigate nonlinear dimensionality reduction to a sequence of low-dimensional latent-space BO (LSBO) problems. Early LSBO used linear random and supervised embeddings; building on Grosnit et al., we employ variational autoencoders (VAEs), deep metric loss for structured latent manifolds, and retraining to adapt the encoder-decoder pair to newly sampled regions. We couple LSBO with sequential domain reduction (SDR) directly in latent space (SDR-LSBO), narrowing search domains as evidence accumulates. Implemented in GPU-accelerated BoTorch with Matérn-5/2 Gaussian-process surrogates, our methods improve benchmark optimisation quality, and retraining can enhance BO performance. Comparisons with adaptive supervised linear random embeddings demonstrate the effectiveness of VAE-based BO for nonlinear low-dimensional structures. We analyse BO-VAE with a fixed pretrained representation, decomposing ambient-space simple regret into latent BO error and a fixed VAE-induced representation gap. Under a PAC-Bayes-certified reconstruction condition and standard fixed-prior assumptions for expected improvement with a Matérn-5/2 kernel, latent BO error vanishes as the evaluation budget increases, whereas the representation gap remains fixed and may impose a non-vanishing error floor. Visualisations empirically assess accessibility of the ambient optimum through the learned decoder. To our knowledge, this is the first study combining SDR with VAE-based LSBO. Our analysis clarifies metric shaping and retraining choices critical for scalable latent-space BO. For reproducibility, source code is available at https://github.com/L-Lok/Nonlinear-Dimensionality-Reduction-Techniques-for-Bayesian-Optimization.git.

math.OC↗