Abstract
This paper is the second part of a comprehensive survey on routing problems involving pickups and deliveries. Basically, two problem classes can be distinguished. The first part dealt with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. The second part now considers all those problems where goods are transported between pickup and delivery locations, denoted as Vehicle Routing Problems with Pickups and Deliveries (VRPPD). These are the Pickup and Delivery Vehicle Routing Problem (PDVRP - unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP - paired pickup and delivery points), and the Dial-A-Ride Problem (DARP - passenger transportation between paired pickup and delivery points and user inconvenience taken into consideration). 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.
| Original language | English |
|---|---|
| Pages (from-to) | 81-117 |
| Number of pages | 37 |
| Journal | Journal für Betriebswirtschaft |
| Volume | 58 |
| Issue number | 2 |
| Publication status | Published - 2008 |
Austrian Fields of Science 2012
- 502050 Business informatics
- 502052 Business administration
- 101015 Operations research