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 IssueDOI
A branch-and-cut algorithm for the k-edge connected subgraph problem
TL;DR: In this article, the k-edge connected subgraph problem from a polyhedral point of view is considered, and a branch-and-cut algorithm is proposed to solve it.
Journal ArticleDOI
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
Shoshana Anily,Julien Bramel +1 more
TL;DR: In this article, the authors considered the Capacitated Traveling Salesman Problem with Pickups and Deliv- eries (CTSPPD), where a single product is available at the pickup points which must be brought to the delivery points.
Journal ArticleDOI
An investigation into a new class of vehicle routing problem with backhauls
Anne Wade,Said Salhi +1 more
TL;DR: A new version of the vehicle routing problem with backhauls is presented and an insertion-type heuristic is put forward for this class of problems.
Journal ArticleDOI
A neural network algorithm for the traveling salesman problem with backhauls
Hassan Ghaziri,Ibrahim H. Osman +1 more
TL;DR: In this paper, a new heuristic based on Kohonen's self-organizing feature map for the traveling salesman problem with backhauls (TSPB) is introduced.
Journal ArticleDOI
Vehicle Routing at Quality Stores
Candace Arai Yano,Thomas Justin. Chan,Lori Kaplan Richter,Theodore Cutler,Katta G. Murty,David McGettigan +5 more
TL;DR: Vehicle routing optimization software has been implemented on a personal computer for Quality Stores, a chain of retail stores, enabling personnel with no prior exposure to computers or optimization to operate the software unaided.