The vehicle routing problem
Tabu Search
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands
Transportation Science
Improved route planning and scheduling of waste collection and transport
Expert Systems with Applications: An International Journal
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
Computers and Operations Research
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
Operations Research Letters
| Hi-index | 0.00 |
In this paper we consider the collection of infectious medical waste, produced by patients in self-treatment and stored at pharmacies. The problem is formulated as a collector-managed inventory routing problem, encompassing stochastic aspects, which are common in such problems. Social objectives, specifically the satisfaction of pharmacists and the local authority, as well as the minimization of public health risks, are considered for the real-world motivated inventory routing problem. To optimize the planning process for a predefined time horizon, we take advantage of radio frequency identification technologies. We design a tabu search based algorithm to optimize the determination of visit dates and corresponding vehicle routes. The suggested approach is tested on real-world data from the region of Provence-Alpes-Côte d'Azur, in France. The results for different waste collection scenarios are analyzed and compared in order to evaluate the performance of the proposed solution method.