One-to-Many-to-One Single Vehicle Pickup and Delivery Problems

30Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In One-to-Many-to-One Single Vehicle Pickup and Delivery Problems a vehicle based at the depot must make deliveries and pickups at customers locations before returning to the depot. Several variants can be defined according to the demand structures and sequencing rules imposed on pickups and deliveries. In recent years there has been an increased interest in this family of problems. New formulations and efficient heuristics capable of yielding general solutions (unrestricted in shape) have been proposed. In addition, some new and interesting extensions have been analyzed, including problems with selective pickups and problems with capacitated customers. The purpose of this chapter is to review these developments. © Springer Science+Business Media, LLC 2008.

Cite

CITATION STYLE

APA

Gribkovskaia, I., & Laporte, G. (2008). One-to-Many-to-One Single Vehicle Pickup and Delivery Problems. Operations Research/ Computer Science Interfaces Series. https://doi.org/10.1007/978-0-387-77778-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free