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

General solutions to the single vehicle routing problem with pickups and deliveries

TL;DR: A mixed integer linear programming model for the single vehicle routing problem with pickups and deliveries is proposed and the concept of general solution is introduced which encompasses known solution shapes such as Hamiltonian, double-path and lasso.
Journal ArticleDOI

An efficient implementation of local search algorithms for constrained routing problems

TL;DR: This work investigates the implementation of local search algorithms for routing problems with various side constraints such as time windows on vertices and precedence relations between vertices based on the k-exchange concept and shows how this effort can be reduced to a constant.
Journal ArticleDOI

A new tabu search algorithm for the vehicle routing problem with backhauls

TL;DR: A new tabu search algorithm that starting from pseudo-lower bounds was able to match almost all the best published solutions and to find many new best solutions, for a large set of benchmark problems.
Journal ArticleDOI

Tabu Thresholding: Improved Search by Nonmonotonic Trajectories

TL;DR: Embodied particularly in the strategic oscillation component of tabu search, this nonmonotonic control has been shown in a variety of studies to yield outcomes superior to those of simulated annealing and threshold acceptance.
Book ChapterDOI

The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery

TL;DR: A Branch and Price approach based on a set covering formulation for the master problem is implemented and a relaxation of the elementary shortest path problem with time windows and capacity constraints is used as pricing problem.