193. A GRASP algorithm for the Non-Urgent Transportation Problem
Invited abstract in session HB-3: Transportation in Healthcare and Social Services, stream Regular talks.
Thursday, 11:00-12:30Room: Room S2
Authors (first author is the speaker)
| 1. | Iván Giménez-Palacios
|
| Estadística i Investigació Operativa, Universitat de València | |
| 2. | Jose M. Belenguer
|
| Estadistica i Investigació Operativa, Universitat de València | |
| 3. | Eva Vallada
|
| Estadística e Investigación Operativa Aplicadas y Calidad, Universidad Politécnica de Valencia | |
| 4. | Fulgencia Villa
|
| Department of Applied Statistics, Operations Research and Quality, Universitat Politecnica de Valencia |
Abstract
Every day, hundreds of patients need to be transported to healthcare facilities for scheduled visits because they are unable to come by their own means. In this work, we deal with this problem, the non-urgent transport of patients, with time windows between which the pick-ups and deliveries of the different patients can be made. The solution to the problem is the set of routes that will be followed by each of the available vehicles so that the total time that the vehicles are in circulation is minimum. The time windows must be taken into account, with the time required to complete each of the trips, and the maximum capacity of the vehicles. To solve this problem, we propose a GRASP algorithm. The ultimate objective of this work is to develop efficient methods for solving this problem that is a daily occurrence in the healthcare environment.
Keywords
- Healthcare logistics
Status: accepted
Back to the list of papers