A tabu search heuristic for a dynamic transportation problem of patients between care units
Résumé
The ambulance central station of the Hospital Complex of Tours (France) has to plan the transportation demands between care units which require a vehicle. Some demands are known in advance and the others arrive dynamically. Each demand requires a specific type of vehicle and a vehicle can transport only one person at a time. Moreover, transportations are subject to particular constraints: priority of urgent demands, disinfection of a vehicle after the transportation of a patient with contagious disease, respect of the type of vehicle, etc. This problem is related to the \emph{Dial A Ride Problem}. For solving the dynamic version of this problem, we propose a tabu search algorithm inspired by \cite{Gendreau99}. This method supports an adaptive memory which stores routes and consists in running a tabu search algorithm several times: one for improving the set of initial solutions, one for the neighborhood exploration and finally for improving the final solution. Computational experiments show that the method can provide high-quality solutions for this dynamic transportation problem.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...