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.