A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas
While many researchers have thoroughly studied the static dial-a-ride system, the scheduling of the dynamic dial-a-ride system has not been well studied. There have been attempts to extend the static solutions to a dynamic counterpart. But, one inherent problem with the extended solutions is that characteristics of static solutions are carried over to the solutions of a dynamic problem. Current solutions use single depot, and, limits on wait time for service after making the request, have forced many of requests to be rejected. In this research, a new algorithm based on partitions, subjected to limit on wait time for service after making the request, is developed. The proposed algorithm eliminates rejection of any customer request from anywhere in the service area. A combination of an existing scheduling algorithm, like a dynamic basic parallel algorithm, with this newly suggested algorithm is recommended for better performance. This combination is recommended only when the ridership is mixed in density. Three sets of experiments were conducted for evaluation and comparison of scheduling efficiency of the existing dynamic dial-a-ride algorithms and the new partition based algorithm.
Computer Engineering|Information Technology|Transportation planning
Geevarghese, Kochumman, "A Partition-Based Dynamic Routing Algorithm for On-Demand Bus Scheduling in Rural Areas" (2016). ETD Collection for Pace University. AAI10142876.
Remote User: Click Here to Login (must have Pace University remote login ID and password. Once logged in, click on the View More link above)