scispace - formally typeset
Journal ArticleDOI

Static pickup and delivery problems: a classification scheme and survey

TLDR
A general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems, is introduced.
Abstract
Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.

read more

Citations
More filters
Journal ArticleDOI

On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment

TL;DR: A more general mathematical model for real-time high-capacity ride-sharing that scales to large numbers of passengers and trips and dynamically generates optimal routes with respect to online demand and vehicle locations is presented.
Journal ArticleDOI

Optimization for dynamic ride-sharing: A review

TL;DR: This paper systematically outline the optimization challenges that arise when developing technology to support ride-sharing and survey the related operations research models in the academic literature.
Journal ArticleDOI

The vehicle routing problem

TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.
Journal ArticleDOI

A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations

TL;DR: Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.
Journal ArticleDOI

Dynamic pickup and delivery problems

TL;DR: This article surveys the subclass of problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real-time, and discusses some general issues as well as solution strategies.
References
More filters
Journal ArticleDOI

Heuristic Algorithms for the Handicapped Persons Transportation Problem

Paolo Toth, +1 more
TL;DR: A fast and effective parallel insertion heuristic algorithm which is able to determine good solutions for real-world instances of the problem in a few seconds on a personal computer is described.
Journal ArticleDOI

Waiting strategies for the dynamic pickup and delivery problem with time windows

TL;DR: In this article, the authors define and compare four waiting strategies for dynamic pickup and delivery with time windows in courier companies making same-day pickup and delivering of letters and small parcels.
Journal ArticleDOI

A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

TL;DR: This work studies how the branch-and-price technique can be applied to the solution of the vehicle routing problem with simultaneous distribution and collection and compares two different ways of solving the pricing subproblem: exact dynamic programming and state space relaxation.
Journal ArticleDOI

A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

TL;DR: A 0-1 integer linear model is introduced for this problem and a branch-and-cut procedure for finding an optimal solution is described for solving instances of TSP with pickup and delivery.
Journal ArticleDOI

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling

TL;DR: A heuristic routing and scheduling algorithm is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithers-burg, Maryland, and Baltimore, Maryland.