The Pickup and Delivery Problem with time windows, split loads and transshipment - A branch-and-cut solution method
2 : Departamento de Matemáticas, Estadística e Investigación Operativa, Universidad de La Laguna
(DMEIO, ULL)
* : Corresponding author
Departamento de Matemáticas, Estadística e Investigación Operativa, Apartado de correos 456, Universidad de La Laguna, 38200 La Laguna, Spain -
Spain
We address a generalized version of the well-known pickup and delivery problem with time windows. In this version the constraint that each customer is visited by exactly one vehicle is relaxed. Furthermore, transshipment of load from one vehicle to another is allowed at specific locations. However, it induces costs. The fleet of vehicles is heterogeneous and multiple depots may be present.
The objective is to find a set of feasible vehicle routes that serves all customers, such that the sum of travel costs and transshipment costs is minimized.
We present a solution method based on Benders decomposition.
| Subject : | : | Abstracts |
| Topics | : | Exact Methods |
| Topics | : | Pickup and Delivery |
| Topics | : | Routing with Synchronization |
| Topics | : | Split Deliveries |
| PDF version | : |  PDF version |
