Abstract
In this paper, we develop an insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services, an innovative concept that merges the flexibility of Demand Responsive Transit (DRT) systems with the low cost operability of fixed-route systems. A MAST system allows vehicles to deviate from the fixed path so that customers within a service area may be picked up or dropped off at their desired locations. Such a service already exists in Los Angeles County, where MTA Line 646 is a MAST nighttime service, transporting passengers between a business area and a nearby bus terminal. Since the current demand is very low, the service is entirely manageable by the bus operator, but a higher demand would certainly require the development of a scheduling algorithm. The proposed insertion heuristic makes use of control parameters, which properly regulate the consumption of the slack time. A set of simulations performed in the service area covered by the existing MTA Line 646 at different demand levels attests the effectiveness of the algorithm by comparing its performance versus a first-come/first-serve (FCFS) policy and optimal solutions generated by a commercial integer program solver. The results show that our approach can be used as an effective method to automate scheduling of this line and other services similar to it.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldaihani, M. M. and M. Dessouky, “Hybrid scheduling methods for paratransit operations,” Computers & Industrial Engineering, 45, 75–96 (2003).
Aldaihani, M. M., L. Quadrifoglio, M. Dessouky, and R. W. Hall, “Network design for a grid hybrid transit service,” Transportation Research, 38A, 511–530 (2004).
Bodin, L. and T. Sexton, “The multi-vehicle subscriber dial-a-ride problem,” TIMS Studies in the Management Sciences, 22, 73–86 (1986).
Campbell, A. M. and M. Savelsbergh, “Efficient insertion heuristics for vehicle routing and scheduling problems,” Transportation Science, 38, 369–378 (2004).
Crainic, T. G., F. Malucelli, and M. Nonato, “Flexible many-to-few + few-to-many = an almost personalized transit system,” TRISTAN IV, Sáo Miguel Azores Islands (2001) pp. 435–440.
Daganzo, C. F., “An approximate analytic model of many-to-many demand responsive transportation systems,” Transportation Research, 12, 325–333 (1978).
Daganzo, C. F., “Checkpoint dial-a-ride systems,” Transportation Research, 18B, 315–327 (1984).
Desaulniers, G., et al., “The VRP with pickup and delivery,” Cahiers du GERARD G-2000-25, Ecole des Hautes Etudes Commerciales, Montréal (2000).
Desrosiers, J., Y. Dumas, and F. Soumis, “A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows,” American Journal of Mathematical and Management Sciences, 6, 301–325 (1986).
Desrosiers, J., Y. Dumas, and F. Soumis, “The multiple dial-a-ride problem,” Lecture Notes in Economics and Mathematical Systems, vol. 308: Computer-Aided Transit Scheduling, Springer, Berlin (1988).
Dessouky, M., F. Ordóńez, and L. Quadrifoglio, “Productivity and cost-effectiveness of demand responsive transit systems,” PATH/Caltrans Technical Report, Berekely, CA (2005).
Dessouky, M., M. Rahimi, and M. Weidner, “Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling,” Transportation Research Part D: Transport and Environment, 8, 433–465 (2003).
Diana, M. and M. Dessouky, “A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows,” Transportation Research, 38B, 539–557 (2004).
Hickman, M. and K. Blume, “A method for scheduling integrated transit service,” in 8th International Conference on Computer-Aided Scheduling of Public Transport (CASPT), Berlin, Germany (2000).
Jaw, J. J., et al., “A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows,” Transportation Research, 20B(3), 243–257 (1986).
Liaw, C. F., C. C. White, and J. L. Bander, “A decision support system for the bimodal dial-a-ride problem,” IEEE Transactions on Systems, Man, and Cybernetics, 26(5), 552–565 (1996).
Lu, Q. and M. Dessouky, “An exact algorithm for the multiple vehicle pickup and delivery problem,” Transportation Science, 38, 503–514 (2004).
Lu, Q. and M. Dessouky, “New insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows,” European Journal of Operational Research, 175, 672–687, (2006).
Madsen, O. B. G., H. F. Raven, and J. M. Rygaard, “A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives,” Annals of Operations Research, 60, 193–208 (1995).
Malucelli, F., M. Nonato, and S. Pallottino, “Demand adaptive systems: Some proposals on flexible transit,” in: Ciriania, T., Johnson, E., and Tadei, R. (Eds.), Operations Research in Industry, McMillan Press, London, 157–182 (1999).
Palmer, K, M. Dessouky, and T. Abdelmaguid, “Impact of management practices and advanced technology on demand responsive transit systems,” Transportation Research, Part A: Policy and Practice, 38, 495–509 (2004).
Psaraftis, H. N., “A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem,” Transportation Science, 14, 130–154 (1980).
Psaraftis, H. N. “An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows,” Transportation Science, 17, 351–357 (1983a).
Psaraftis, H. N., “Scheduling large-scale advance-request dial-a-ride systems,” American Journal of Mathematical and Management Sciences, 6, 327–367 (1986).
Savelsbergh, M. W. P. and Sol, M., “The general pickup and delivery problem,” Transportation Science, 29, 17–29 (1995).
Sexton, T. R. and L. D. Bodin, “Optimizing single vehicle many-to-many operations with desired delivery times: 1. Scheduling,” Transportation Science, 19, 378–410 (1985a).
Sexton, T. R. and L. D. Bodin, “Optimizing single vehicle many-to-many operations with desired delivery times: 2. Routing,” Transportation Science, 19, 411–435 (1985b).
Sexton, T. R. and Y. Choi, “Pickup and delivery of partial loads with soft time windows,” American Journal of Mathematical and Management Sciences, 6, 369–398 (1986).
Toth, P. and D. Vigo, “Heuristic algorithm for the handicapped persons transportation problem,” Transportation Science, 31, 60–71 (1997).
Wilson, N. H. M., et al. (1971) “Scheduling algorithms for a dial-a-ride System,” Technical Report USL TR-70-13, M.I.T, Urban Systems Laboratory.
Wilson, N. H. M. and C. Hendrickson, “Performance models of flexibly routed transportation services,” Transportation Research, 14B, 67–78 (1980).
Zhao, J. and M. Dessouky, “Optimal service capacity for a single bus mobility allowance shuttle transit (MAST) system,” submitted for publication.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Quadrifoglio, L., Dessouky, M.M. & Palmer, K. An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services. J Sched 10, 25–40 (2007). https://doi.org/10.1007/s10951-006-0324-6
Issue Date:
DOI: https://doi.org/10.1007/s10951-006-0324-6