The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.
A comprehensive survey on the PDVRP can be found in @cite_19 where different variants of the problem, models and resolution methods are presented. As our knowledge, no work in the literature treat real world pick-up and delivery problem in the context of recuperation of waste for recycling. Some applications of this problem can be (1) The door-to-door delivery of mineral water bottles and the simultaneous collection of empty bottles, (2) The laundry service for hotels (collecting dirty clothes and delivering clean clothes), and (3) Medical waste.
@cite_19
1525106674
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.