A decision support system for the bimodal dial-a-ride problem
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Vol. 26 (5), 552-565
- https://doi.org/10.1109/3468.531903
Abstract
A bimodal dial-a-ride problem (BDARP) considered in this paper is a dial-a-ride problem that involves two transportation modes: paratransit vehicles and fixed route buses. Riders in such a system might be transferred between different transportation modes during the service process. The motivation of this research is that by efficiently coordinating paratransit vehicles with fixed route buses we can improve the accessibility and efficiency of a dial-a-ride system. In this paper, we design a decision support system (DSS) which automatically constructs efficient paratransit vehicle routes and schedules for the BDARP. This DSS has been tested using actual data from the Ann Arbor Transportation Authority (AATA) in Ann Arbor, MI. The results show that this DSS produces an average increase of 10% in the number of requests that can be accommodated and an average decrease of 10% in the number of paratransit vehicles required, as compared to the manual results where no fixed route buses are involvedKeywords
This publication has 10 references indexed in Scilit:
- A heuristic search approach for solving a minimum path problem requiring arc cost determinationIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1996
- The Multiple Vehicle DIAL-A-RIDE ProblemPublished by Springer Nature ,1988
- Simulated Annealing: Theory and ApplicationsPublished by Springer Nature ,1987
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time WindowsAmerican Journal of Mathematical and Management Sciences, 1986
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. SchedulingTransportation Science, 1985
- An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time WindowsTransportation Science, 1983
- Optimization by Simulated AnnealingScience, 1983
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957