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
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
TL;DR: This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms.
Journal ArticleDOI
Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
Gábor Nagy,Said Salhi +1 more
TL;DR: This method finds a solution to the corresponding VRP problem and modifies this solution to make it feasible for the VRPPD, and is capable of solving multi-depot problems, which has not been done before.
The Pickup and Delivery Problem with Time Windows
TL;DR: This paper presents an exact algorithm which solves the pickup and delivery problem when transporting goods using a column generation scheme with a constrained shortest path as a subproblem.
Journal ArticleDOI
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
TL;DR: A new branch- and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation.
Journal ArticleDOI
A Unified Heuristic for a Large Class of Vehicle Routing Problems with Backhauls
Stefan Ropke,David Pisinger +1 more
TL;DR: A unified model is developed that is capable of handling most variants of the Vehicle Routing Problem with Backhauls and it has improved the best known solution for 227 of these.