Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints

DOI10.1016/J.EJOR.2022.10.039MaRDI QIDQ6106980zbMATH OpenOpenAlexFDO

Authors Marco Silva, João Pedro Pedroso, Ana Viana

Publication date 3 July 2023

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

Full work available at URL https://doi.org/10.1016/j.ejor.2022.10.039

zbMATH Keywords

crowdshippingdata-driven optimizationdistributionally robust optimizationlast-mile deliverystochastic programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A branch-price-and-cut algorithm for stochastic crowd shipping last-mile delivery with correlated marginals
• Solution approaches for the vehicle routing problem with occasional drivers and time windows
• The probabilistic travelling salesman problem with crowdsourcing
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
• Crowd-shipping with time windows and transshipment nodes

Cites work

• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A Robust Optimization Perspective on Stochastic Programming
• A Vehicle Routing Problem with Stochastic Demand
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Crowd-shipping with time windows and transshipment nodes
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• Distributionally robust expectation inequalities for structured distributions
• Distributionally robust optimization and its tractable approximations
• Distributionally robust optimization under moment uncertainty with application to data-driven problems
• Exact algorithms for the chance-constrained vehicle routing problem
• On a Class of Minimax Stochastic Programs
• Price of correlations in stochastic optimization
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Shortest Path Problems with Resource Constraints
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The distributionally robust chance-constrained vehicle routing problem
• The pickup and delivery problem with time windows and occasional drivers
• The probabilistic travelling salesman problem with crowdsourcing
• The vehicle routing problem with occasional drivers
• Vehicle Routing

Cited in

(8)

• Optimal pricing of crowdsourcing logistics services with social delivery capacity
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting
• Last-mile scheduling under uncertainty
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping
• A branch-price-and-cut algorithm for stochastic crowd shipping last-mile delivery with correlated marginals
• An effective mitigation strategy to hedge against absenteeism of occasional drivers
• Rolling optimal scheduling for urban parcel crowdsourced delivery with new order insertion
• Optimizing delivery systems within the e-retail context: a weighted self-organizing map for delivery region partitioning

This page was built for publication: Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints

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