Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorRooij, Johan van
dc.contributor.authorKuijpers, Nick
dc.date.accessioned2023-08-11T00:02:30Z
dc.date.available2023-08-11T00:02:30Z
dc.date.issued2023
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/44635
dc.description.abstractIn this master thesis, we address the challenge of dynamically replanning transportation services for individuals with reduced mobility in the context of Valys: a paratransit agency in the Netherlands. High financial costs and the need for reducing greenhouse gas emissions have put pressure on paratransit agencies to improve their operational efficiency of transport services. Dynamic replanning can prevent changes from rendering the schedule created a day in advance inefficient, thereby averting delays, missed deliveries, and additional expenses. Furthermore, it can enhance flexibility for paratransit users, allowing same-day bookings instead of a day or more in advance. We propose a Greedy Randomized Adaptive Search Procedure (GRASP) with evolutionary Path Relinking as a solution to the challenges of dynamic replanning. To the best of our knowledge, we are the first to apply GRASP in this field. Therefore, we provide numerical evidence for our GRASP in comparison with a widely used simulated annealing (SA) method. Comparative analysis with an SA approach demonstrates that our GRASP outperforms SA significantly in the setting of limited computation time, typically encountered in real-time planning scenarios. Our GRASP approach relies on high-quality start solutions for better overall solutions, and we provide qualitative insight into the influence of the start solution on the performance. At last, we demonstrate that our GRASP approach is better at frequent real-time replanning than an SA approach. Overall, our findings highlight the effectiveness of our GRASP in addressing the challenges of dynamic replanning. Furthermore, we assess the opportunity gap of dynamic rescheduling with respect to not rescheduling, quantifying the potential improvement based on the cumulative number of changes. Our results show predictable gains ranging from 3.0 to 16.8 depending on the number of changes. These gains correspond to a decrease in service time from 150 to 600 hours per day. Our GRASP algorithm can effectively close the opportunity gap, improve service delivery, and enhance customer satisfaction.
dc.description.sponsorshipUtrecht University
dc.language.isoEN
dc.subjectIn this master thesis, we address the challenge of dynamically replanning transportation services for individuals with reduced mobility in the context of Valys: a paratransit agency in the Netherlands. Dynamic replanning can prevent changes from rendering the schedule created a day in advance inefficient, thereby averting delays, missed deliveries, and additional expenses. Furthermore, it can enhance flexibility for paratransit users, allowing same-day bookings instead of a day in advance.
dc.titleDynamic Reoptimization of Transportation for Elderly and Disabled
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsmetaheuristic, paratransit organization, DARP, DDARP, GRASP, Simulated annealing, operations research, local search
dc.subject.courseuuComputing Science
dc.thesis.id21639


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record