The pickup and delivery problem with time windows and occasional drivers

DOI10.1016/j.cor.2019.04.023zbMath1458.90075OpenAlexW2941075535MaRDI QIDQ2003570

Yanyan Li

Publication date: 9 July 2019

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

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

zbMATH Keywords

crowdshippingoccasional driverscompensation schemespickup and delivery problem with time windowscompact and extended formulation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping ⋮ An improved decomposition-based heuristic for truck platooning ⋮ Directions for future research on urban mobility and city logistics ⋮ The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment ⋮ Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers ⋮ Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints ⋮ Solving a pickup and delivery routing problem for fourth‐party logistics providers ⋮ The online vehicle routing problem with occasional drivers ⋮ A multi-period analysis of the integrated item-sharing and crowdshipping problem ⋮ Shared resources in collaborative vehicle routing ⋮ A data-driven compensation scheme for last-mile delivery with crowdsourcing

Uses Software

• VRP

Cites Work

• The share-a-ride problem: people and parcels sharing taxis
• The vehicle routing problem with occasional drivers
• Efficient symmetry breaking formulations for the job grouping problem
• The pickup and delivery problem with time windows
• The vehicle routing problem with dynamic occasional drivers
• Optimization for dynamic ride-sharing: a review
• A maritime inventory routing problem: Discrete time formulations and valid inequalities
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows