2011
DOI: 10.1016/j.ejor.2011.04.033
|View full text |Cite
|
Sign up to set email alerts
|

A tabu search heuristic for the dynamic transportation of patients between care units

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0
2

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 58 publications
(44 citation statements)
references
References 31 publications
0
42
0
2
Order By: Relevance
“…Depending on the medical procedure or facility capacity, a patient may need to be transferred on short notice from one service to another, possibly requiring trained staff or specific equipment for his/her care. This application has been studied by Beaudry et al [7], Kergosien et al [80], and Melachrinoudis et al [96].…”
Section: Transport Of Personsmentioning
confidence: 99%
“…Depending on the medical procedure or facility capacity, a patient may need to be transferred on short notice from one service to another, possibly requiring trained staff or specific equipment for his/her care. This application has been studied by Beaudry et al [7], Kergosien et al [80], and Melachrinoudis et al [96].…”
Section: Transport Of Personsmentioning
confidence: 99%
“…A DARP with heterogeneous users and vehicles is studied in [24] where different modes (seated, stretcher and wheelchair) and types of vehicles are considered. The problem studied in [21] was inspired by a real case of transportation of patients in a hospital complex in France, where transportations are subject to particular constraints. Among them, its worth to mention priority of urgent demands, disinfection of a vehicle after the transportation of a contagion, respect of the type of vehicle needed and the opportunity to outsource demands to a private company.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This directly leads to the goal of minimising the strategy's performance metrics related to "sojourn time" (including EV's travel time, waiting time for charging, and charging time), which is different from the well-known Vehicle Routing Problem (VRP) (Dantzig & Ramser, 1959;Pillac, Gendreau, Guéret, & Medaglia, 2013) and Dynamic Traveling Repairman Problem (DTRP) (Bertsimas & Ryzin, 1990, 1993 that involve design of vehicledelivery routes from a depot to a set of scattered demand locations, so as to minimise the overall routing cost (e.g., travel time/distance) under various side constraints (Baldacci, Toth, & Vigo, 2007;Ferrucci, Block, & Gendreau, 2013;Jaillet & Wagner, 2008;Kergosien, Lenté, Piton, & Billaut, 2011;Laporte, 2007Laporte, , 2009Li, Mirchandani, & Borenstein, 2009;Pavone, Frazzoli, & Bullo, 2007;Pillac et al, 2013;Solomon, 1987). We assume that service demands are placed by the EV drivers according to a general process, and the distribution of the locations of where EVs originate is arbitrary, although its support is determined by a compact Euclidean service region.…”
Section: Introductionmentioning
confidence: 99%