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
A multifaceted heuristic for the orienteering problem
TL;DR: In this article, the authors presented an improved procedure based on four concepts (center of gravity, randomness, subgravity, and learning) for the orienteering problem, which is much faster and results in more nearly optimal solutions than previous procedures.
Journal ArticleDOI
A new branching strategy for time constrained routing problems with application to backhauling
TL;DR: A new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time windows that produced an average cost decrease when backhauling was permitted as compared to the cost involved when the client and the distributor routes were distinct.
Journal ArticleDOI
Efficient solutions to some transportation problems with applications to minimizing robot arm travel
TL;DR: The authors give efficient solutions to transportation problems motivated by the following robotics problem: A robot arm has the task of rearranging m objects between n stations in the plane and needs to be moved to another station.
Journal ArticleDOI
Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem
TL;DR: An O(N2) heuristic is developed to solve the single vehicle many-to-many Euclidean Dial-A-Ride problem based on the Minimum Spanning Tree of the modes of the problem, which exhibits statistical stability over a broad range of problem sizes.
Journal ArticleDOI
A multi-start local search heuristic for ship scheduling—a computational study
TL;DR: The computational study shows that the multi-start local search method consistently returns optimal or near-optimal solutions to real-life instances of the ship scheduling problem within a reasonable amount of computation time.