Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 23 min ago
PreprintarXiv licencearXiv

Handling Customer Preferences in Last-Mile Location-Routing: A Bilevel Optimization Approach

Abstract

This paper introduces the Location-Routing Problem with Delivery Preferences, a last-mile delivery problem with service flexibility that integrates collection-point activation and routing decisions while accounting for customer choice. The company determines which collection points to activate, which customers to offer home delivery, and the corresponding delivery route. Customers subsequently decide whether to accept the proposed home-delivery service or collect their parcels from an activated collection point according to ranked preferences over delivery time intervals and collection points. This hierarchical interaction is modeled through a bilevel optimization framework, which can be formulated as a mixed-integer bilevel program that incorporates compensation mechanisms for service inconvenience. Two equivalent single-level reformulations that exploit the structure of the customers' problems are developed. In addition, a two-phase heuristic is proposed to generate feasible solutions that can be used as warm starts for the formulations. The computational experiments run to compare the performance of the formulations, show that the warm-start strategy becomes particularly effective as the instance size increases. The comparison with a benchmark model that ignores customer preferences indicates that explicitly accounting for customer choice alters the resulting location-routing configuration while improving customer preference satisfaction at a small increase in the company's overall cost. These findings highlight the importance of jointly considering operational efficiency, service flexibility, and customer autonomy in last-mile delivery planning.

Related

  1. Routing in Line Networks with Handling Times
    Gabriel Deza, Michal Tzur, Tal Raviv
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Understanding Hidden Spatial Preferences in Bayesian Optimization
    Maria Bånkestad, Jens Sjölund
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Quantum-Assisted Optimization Guided by Machine-Learned Risk Maps for Aerial Surveillance Routing
    Dorian Lauwerier, Alexis Vieloszynski, Yves Bérubé-Lauzière +1
    arXivPreprintarXiv licenceFull textOptimisation & controlQuantum physics & quantum informationarXiv
  4. Quantum Vehicle Routing Problem: a smart initialization strategy for ill-conditioned optimization landscapes
    Emanuele Casciaro, Mario De Simone, Stefano Martina +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  5. Robust Heterogeneous Vehicle Routing Optimization for Hazmat Transportation Under Time-Varying Risk
    Lijuan Ding, Jun Wu
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
BibTeX
@misc{gomezrocha2026handling,
  title = {{Handling Customer Preferences in Last-Mile Location-Routing: A Bilevel Optimization Approach}},
  author = {José Emmanuel Gómez-Rocha and José-Fernando Camacho-Vallejo and Elena Fernández},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.05230},
  eprint = {2611.05230},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.05230},
}
RIS
TY  - UNPB
TI  - Handling Customer Preferences in Last-Mile Location-Routing: A Bilevel Optimization Approach
AU  - José Emmanuel Gómez-Rocha
AU  - José-Fernando Camacho-Vallejo
AU  - Elena Fernández
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2611.05230
UR  - https://arxiv.org/abs/2611.05230
AB  - This paper introduces the Location-Routing Problem with Delivery Preferences, a last-mile delivery problem with service flexibility that integrates collection-point activation and routing decisions while accounting for customer choice. The company determines which collection points to activate, which customers to offer home delivery, and the corresponding delivery route. Customers subsequently decide whether to accept the proposed home-delivery service or collect their parcels from an activated collection point according to ranked preferences over delivery time intervals and collection points. This hierarchical interaction is modeled through a bilevel optimization framework, which can be formulated as a mixed-integer bilevel program that incorporates compensation mechanisms for service inconvenience. Two equivalent single-level reformulations that exploit the structure of the customers' problems are developed. In addition, a two-phase heuristic is proposed to generate feasible solutions that can be used as warm starts for the formulations. The computational experiments run to compare the performance of the formulations, show that the warm-start strategy becomes particularly effective as the instance size increases. The comparison with a benchmark model that ignores customer preferences indicates that explicitly accounting for customer choice alters the resulting location-routing configuration while improving customer preference satisfaction at a small increase in the company's overall cost. These findings highlight the importance of jointly considering operational efficiency, service flexibility, and customer autonomy in last-mile delivery planning.
ER  -