A branch-price-and-cut algorithm for stochastic crowd shipping last-mile delivery with correlated marginals

DOI10.4230/OASICS.ATMOS.2021.12MaRDI QIDQ6587290zbMATH OpenFDO

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

Publication date 13 August 2024

zbMATH Keywords

distributionally robust optimizationstochastic vehicle routing problemdata-driven optimizationlast-mile deliverycrowd shipping

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Robustness in mathematical programming (90C17)

Recommendations

• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
• The probabilistic travelling salesman problem with crowdsourcing
• Solution approaches for the vehicle routing problem with occasional drivers and time windows
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping

Cited in

(3)

• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping
• Estimating the marginal cost to deliver to individual customers

This page was built for publication: A branch-price-and-cut algorithm for stochastic crowd shipping last-mile delivery with correlated marginals

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