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

Handicapped Person Transportation: An application of the Grouping Genetic Algorithm

TL;DR: The objective of this paper is to implement Grouping Genetic Algorithm to find optimal (or close to optimal) routes for transporting handicapped people in terms of service quality and number of used vehicles.
Journal ArticleDOI

A vehicle routing problem with backhauls and time windows: a guided local search solution

TL;DR: In this article, a guided local search heuristic was proposed to solve the vehicle routing problem with backhauls and time windows (VRPBTW) with and without customer precedence.
Journal ArticleDOI

Solving a vehicle-routing problem arising in soft-drink distribution

TL;DR: Three construction heuristics and an improvement procedure are developed for the problem of distribution of soft drinks and collection of recyclable containers in a Quebec-based company, modelled as a variant of the vehicle routing problem.
Book ChapterDOI

Fast Local Search Algorithms for the Handicapped Persons Transportation Problem

TL;DR: Fast and effective local search refining procedures are described, based on trip movements and exchanges, which can be used to improve within acceptable computing time the solutions of large-size instances obtained by using a parallel insertion heuristic algorithm.
Journal ArticleDOI

The swapping problem

TL;DR: This work exhibits several structural properties of shortest routes, develops polynomial approximation algorithms that are variations of a well-known “patching” algorithm for the traveling salesman problem, and proves tight constant performance guarantees for these algorithms.