Hybrid scheduling methods for paratransit operations

Aldaihani, Majid M.; Dessouky, Maged

doi:10.1016/s0360-8352(03)00032-9

Cited by 80 publications

(35 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Metaheuristics are among the most popular solution procedures for solving the static DARP. Efficient tabu search algorithms were developed by Cordeau and Laporte (2003), Aldaihani and Dessouky (2003), and Melachrinoudis et al (2007). Toth and Vigo (1997) proposed a tabu thresholding algorithm while alternative heuristics based on simulated annealing and on genetic search were designed by Baugh et al (1998) andJørgensen et al (2007), respectively.…”

Section: Or Methodologymentioning

confidence: 99%

Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals

Melo²,

2009

View full text Add to dashboard Cite

Intra-hospital transports are often required for diagnostic or therapeutic reasons. Depending on the hospital layout, transportation between nursing wards and service units is either provided by ambulances or by trained personnel who accompany patients on foot. In many large German hospitals, the patient transport service is poorly managed and lacks workflow coordination. This contributes to higher hospital costs (e.g. when a patient is not delivered to the operating room on time) and to patient inconvenience due to longer waiting times. We have designed a computer-based planning systemOpti-TRANS c -that supports all phases of the transportation flow, ranging from travel booking, dispatching transport requests to monitoring and reporting trips in real-time.The methodology developed to solve the underlying optimization problem -a dynamic dial-a-ride problem with hospital-specific constraints -draws on fast heuristic methods to * Corresponding author.1 ensure the efficient and timely provision of transports. We illustrate the strong impact of Opti-TRANS c on the daily performance of the patient transportation service of a large German hospital. The major benefits obtained with the new tool include streamlined transportation processes and workflow, significant savings and improved patient satisfaction. Moreover, the new planning system has contributed to increase awareness among hospital staff about the importance of implementing efficient logistics practices.Medical diagnostic facilities and treatment units are among the most daily visited departments of a hospital, both by inpatients and outpatients. In particular, inpatients with limited mobility are accompanied by trained staff from and to these service areas. If intra-hospital movement is required between health care units within the same building then patients are pushed on gurneys, beds or wheelchairs. In campus-based hospitals, inter-building transportation is provided by appropriate vehicles, mostly ambulances, which can be shared by several patients.The organization and provision of intra-hospital transportation for patients, as well as for supplies and equipment, are among the daily logistics activities conducted in a hospital. Although these ancillary services seem simple and straightforward, they impact significantly on the quality of health care and on hospital costs. For example, the late delivery of a patient to a high cost service facility, such as an operating theater or a magnetic resonance imaging department, leads to the underutilization of valuable (staff and equipment) resources. In addition, it disrupts the initially planned schedules of these units. On the other hand, missing an appointment often results in extended waiting time for the patient or even in rescheduling the appointment, thus impacting negatively on patient satisfaction.Despite its importance, the role played by logistics is often overlooked by health care organizations. A recent study by Landry and Philippe (2004) has revealed that logistics related activities account...

show abstract

Section: Or Methodologymentioning

confidence: 99%

Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals

Melo²,

2009

View full text Add to dashboard Cite

show abstract

“…In order to model waiting times of the PD vehicles and multiple visits at the transfer nodes, each physical scheduled line (i.e., (i, j) ∈ E, e.g., arcs (1,2) and (2,1) in Figure 2a) is replicated n times as in Hall et al [15]. In addition, each replication is assigned to one request, and only that specific request can travel on the assigned scheduled line (see Figure 2b).…”

Section: A Formal Description Of the Pdptw-slmentioning

confidence: 99%

“…The authors proposed two types of heuristics (i.e., online and offline) and solved instances with up to 120 requests. Later, Aldaihani and Dessouky [1] considered an integrated DARP with public transport and proposed a two-stage heuristic algorithm to solve instances with up to 155 requests. Hall et al [15] introduced a mixed-integer program to solve an integrated dial-a-ride problem (IDARP).…”

Section: Introductionmentioning

confidence: 99%

An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

Ghilas

Demir

2016

Computers & Operations Research

171

View full text Add to dashboard Cite

“…Hickman and Blume (2001) present a two-stage scheduling heuristic for a similar problem. Another major contribution is made in Aldaihani and Dessouky (2003). The authors do not provide another model for the problem but present an insertion heuristic that builds on the work of Liaw et al (1996) and Hickman and Blume (2001).…”

Section: Literature Reviewmentioning

confidence: 99%

The integrated dial-a-ride problem with timetabled fixed route service

2016

View full text Add to dashboard Cite

This paper concerns operational planning of door-to-door transportation systems for the elderly and/or disabled, who often need a more flexible transportation system than the rest of the population. Highly flexible, but very costly direct transportation is often offered as a complement to standard fixed route public transport service. In the integrated dial-a-ride problem (IDARP), these modes of transport are combined and certain legs of the passengers journeys may be performed with the fixed route public transport system. We extend the IDARP and include timetables for the fixed route services, forcing the fleet of vehicles to schedule the arrival at transfer locations with care. Two mixed integer linear programming formulations of the integrated dial-a-ride problem with timetables (IDARP-TT) are presented and analyzed. The key modeling challenge is that of the transfers between the fleet of vehicles and the fixed route public transport system. The formulations differ in how the transfers are modeled and the differences are thoroughly discussed. The computational study compares the formulations in terms of network size, computational time and memory usage and conclusions about their performances are drawn.

show abstract

Hybrid scheduling methods for paratransit operations

Cited by 80 publications

References 22 publications

Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals

Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals

An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

The integrated dial-a-ride problem with timetabled fixed route service

Contact Info

Product

Resources

About