Crowd-shipping with time windows and transshipment nodes

DOI10.1016/J.COR.2019.104806MaRDI QIDQ2333154zbMATH OpenOpenAlexWikidataFDO

Authors Giusy Macrina, Luigi Di Puglia Pugliese, G. Laporte, Francesca Guerriero

Publication date 11 November 2019

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.104806

zbMATH Keywords

logisticsoccasional driverson-line retailingsharing economyvariable neighborhood search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The pickup and delivery problem with time windows and occasional drivers
• 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
• An exact solution method for the capacitated item-sharing and crowdshipping problem
• A multi-period analysis of the integrated item-sharing and crowdshipping problem

Cites work

• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• A survey on two-echelon routing problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• scientific article; zbMATH DE number 4076944 (Why is no real title available?)
• New families of valid inequalities for the two-echelon vehicle routing problem
• Synchronizing vans and cargo bikes in a city distribution network
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• The vehicle routing problem with occasional drivers

Cited in

(20)

• The pickup and delivery problem with time windows and occasional drivers
• An on-demand same-day delivery service using direct peer-to-peer transshipment strategies
• The online vehicle routing problem with occasional drivers
• A multi-period analysis of the integrated item-sharing and crowdshipping problem
• The probabilistic travelling salesman problem with crowdsourcing
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting
• A waste collection problem with service type option
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand
• An exact solution method for the capacitated item-sharing and crowdshipping problem
• Courier collaboration in pickup and delivery services by hub transshipment across flexible time periods
• Solution approaches for the vehicle routing problem with occasional drivers and time windows
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping
• Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers
• Two-echelon collaborative routing problem with heterogeneous crowd-shippers
• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
• A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles
• Choice-based crowdshipping for next-day delivery services: a dynamic task display problem
• Multi-period hub network design from a dual perspective: an integrated approach considering congestion, demand uncertainty, and service quality optimization
• An effective mitigation strategy to hedge against absenteeism of occasional drivers
• The service-centric vehicle routing problem with crowdshipping

This page was built for publication: Crowd-shipping with time windows and transshipment nodes

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