Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands

DOI10.1016/J.EJOR.2024.02.034MaRDI QIDQ6565437

Yang Wang, Mengyu Bi, Jose Holguín-Veras, Jianhui Lai, Chenxi Wang, Yanyan Chen

Publication date: 2 July 2024

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

distributionuncertain demandsrecourse strategiesmobile parcel lockers

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
• Location-routing: issues, models and methods
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• Facility location and supply chain management. A review
• Models and exact solutions for a class of stochastic location-routing problems
• Stochastic vehicle routing
• Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands
• Strategic facility location: A review
• Optimizing the changing locations of mobile parcel lockers in last-mile distribution
• An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• An Introduction to the Theory of Point Processes
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• Mobile parcel lockers with individual customer service

This page was built for publication: Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565437)