The pickup and delivery problem with time windows and occasional drivers
type: Item
instance of: scholarly article
title: The pickup and delivery problem with time windows and occasional drivers
zbMATH Open document ID: 1458.90075
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2019-07-09T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7077668
zbMATH Keywords: crowdshipping
zbMATH Keywords: occasional drivers
zbMATH Keywords: compensation schemes
zbMATH Keywords: pickup and delivery problem with time windows
zbMATH Keywords: compact and extended formulation
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2019.04.023
OpenAlex ID: W2941075535
cites work: Optimization for dynamic ride-sharing: a review
cites work: A maritime inventory routing problem: discrete time formulations and valid inequalities
cites work: The vehicle routing problem with occasional drivers
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The vehicle routing problem with dynamic occasional drivers
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: The pickup and delivery problem with time windows
cites work: Efficient symmetry breaking formulations for the job grouping problem
cites work: The share-a-ride problem: people and parcels sharing taxis
DOI: 10.1016/J.COR.2019.04.023
description: scientific article; zbMATH DE number 7077668