A model for estimating the optimal cycle length of demand responsive feeder transit services

Transportation Research Part B: Methodological

Volumn 51, Issue , 2013, Pages 1-16

  Chandra, Shailesh ^a   Quadrifoglio, Luca ^a  

^a Texas A and M University   (United States)

Author keywords

Continuous approximations; Demand responsive; Feeder transit; First last mile; Optimal cycle; Transit performance

Indexed keywords

DECISION MAKING; GEOMETRY; MASS TRANSPORTATION;

CONTINUOUS APPROXIMATIONS; DEMAND RESPONSIVE; FEEDER TRANSIT; FIRST/LAST MILE; OPTIMAL CYCLE; TRANSIT PERFORMANCE;

FEEDING;

COMPUTER SIMULATION; NUMERICAL MODEL; PUBLIC TRANSPORT;

EID: 84875202525     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2013.01.008     Document Type: Article

References (52)

1. Ahouissoussi N.B.C., Wetzstein M.E. A comparative cost analysis of biodiesel, compressed natural gas, methanol, and diesel for transit bus systems. Resource and Energy Economics 1998, 20(1):1-15.
2. Aldaihani M.M., Quadrifoglio L., Dessouky M.M., Hall R. Network design for a grid hybrid transit service. Transportation Research Part A 2004, 38(7):511-530.
3. Alp O., Erkip N.K., Güllü R. Optimal lot-sizing/vehicle-dispatching policies under stochastic lead times and stepwise fixed costs. Operations Research 2003, 51(1):160-166.
4. Badami M.G., Haider M. An analysis of public bus transit performance in Indian cities. Transportation Research Part A 2007, 41(10):961-981.
5. Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C., Stewart W.R. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1995, 1(1):9-32.
6. Beardwood J., Halton J.H., Hammersley J.M. The Shortest Path through Many Points. Mathematical Proceedings of the Cambridge Philosophical Society 1959, vol. 55(6). Cambridge Univ. Press, pp. 299-327.
7. Bertini R.L., El-Geneidy A.M. Modeling transit trip time using archived bus dispatch system data. Journal of Transportation Engineering 2004, 130(1):56-67.
8. Campbell A.M., Savelsbergh M. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science 2004, 38(3):369-378.
9. Cayford, R., Yim, Y.B., 2004. Personalized Demand-responsive Transit Service. California PATH Research Report UCB-PRR-2004-12, Berkeley, California.
10. Chandra S., Shen C.W., Quadrifoglio L. A simulation study to derive the optimal cycle length for feeder transit services. International Journal of Information Systems in the Service Sector 2011, 3(3):27-46.
11. Chang S.K.J., Hsu S.C. Modeling of passenger waiting time in intermodal station with constrained capacity on intercity transit. International Journal of Urban Sciences 2004, 8(1):51-60.
12. Chowdhury M.S., Chien S.I.J. Joint optimization of bus size, headway, and slack time for efficient timed transfer. Transportation Research Record: Journal of the Transportation Research Board 2011, 2218:48-58.
13. Clarens G.C., Hurdle V. An operating strategy for a commuter bus system. Transportation Science 1975, 9(1):1-20.
14. Cordeau J.F. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 2006, 54(3):573-586.
15. Cordeau J.F., Laporte G. The dial-a-ride problem: models and algorithms. Annals of Operations Research 2007, 153(1):29-46.
16. Cortés C.E., Jayakrishnan R. Design and operational concepts of a high coverage point-to-point transit system. Transportation Research Record 2002, 1783:178-187.
17. Daganzo C.F. Some properties of polling systems. Queueing Systems 1990, 6(1):137-154.
18. Daganzo C.F. Logistics Systems Analysis 1996, Springer.
19. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F., 2002. VRP with pickup and delivery. In: Toth, P., Vigo, D. (Eds.), The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
20. Dessouky M., Hall R., Nowroozi A., Mourikas K. Bus dispatching at timed transfer transit stations using bus tracking technology. Transportation Research Part C 1999, 7(4):187-208.
21. Diana M., Dessouky M.M. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B 2004, 38(6):539-557.
22. Diana M., Dessouky M.M., Xia N. A model for the fleet sizing of demand responsive transportation services with time windows. Transportation Research Part B 2006, 40(8):651-666.
23. Fielding G.J., Babitsky T.T., Brenner M.E. Performance evaluation for bus transit. Transportation Research Part A 1985, 19(1):73-82.
24. Gaboune B., Laporte G., Soumis F. Expected distances between two uniformly distributed random points in rectangles and rectangular parallelpipeds. Journal of the Operational Research Society 1993, 44(5):513-519.
25. Gleason J.M., Barnum D.T. Toward valid measures of public sector productivity: performance measures in urban transit. Management Science 1982, 28(4):379-386.
26. Horn M.E.T. Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research Part C 2002, 10(1):35-63.
27. Ignall E., Kolesar P. Optimal dispatching of an infinite-capacity shuttle: control at a single terminal. Operations Research 1974, 22(5):1008-1024.
28. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 1988, 36(6):929-936.
29. Jaw J.J., Odoni A.R., Psaraftis H.N., Wilson N.H.M. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B 1986, 20(3):243-257.
30. Khattak A.J., Yim Y. Traveler response to innovative personalized demand-responsive transit in the San Francisco Bay Area. Journal of Urban Planning and Development 2004, 130(1):42-55.
31. Koffman D. Operational Experiences with Flexible Transit Services 2004, Transportation Research Board, Washington, DC.
32. Langevin A., Mbaraga P., Campbell J.F. Continuous approximation models in freight distribution: an overview. Transportation Research Part B 1996, 30(3):163-188.
33. Li X., Quadrifoglio L. Feeder transit services: choosing between fixed and demand responsive policy. Transportation Research Part C 2010, 18(5):770-780.
34. Melachrinoudis E., Ilhan A.B., Min H. A dial-a-ride problem for client transportation in a health-care organization. Computers and Operations Research 2007, 34(3):742-759.
35. özekici S. Average waiting time in queues with scheduled batch services. Transportation Science 1987, 21(1):55-61.
36. Pagès L., Jayakrishnan R., Cortes C.E. Real-time mass passenger transport network optimization problems. Transportation Research Record 2006, 1964:229-237.
37. Potts J.F., Marshall M.A., Crockett E.C., Washington J. A Guide for Planning and Operating Flexible Public Transportation Services 2010, Transportation Research Board, Washington, DC.
38. Psaraftis H.N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 1980, 14(2):130-154.
39. Quadrifoglio L., Li X. A methodology to derive the critical demand density for designing and operating feeder transit services. Transportation Research Part B 2009, 43(10):922-935.
40. Quadrifoglio L., Hall R.W., Dessouky M.M. Performance and design of mobility allowance shuttle transit services: bounds on the maximum longitudinal velocity. Transportation Science 2006, 40(3):351-363.
41. Quadrifoglio L., Dessouky M.M., Palmer K. An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services. Journal of Scheduling 2007, 10(1):25-40.
42. Quadrifoglio L., Dessouky M.M., Ordóñez F. A simulation study of demand responsive transit system design. Transportation Research Part A 2008, 42(4):718-737.
43. Quadrifoglio L., Chandra S., Shen C.W. Transit Services for Sprawling Areas with Relatively Low Demand Density: A Pilot Study in the Texas Border's Colonias 2009, Texas Transportation Institute, Texas A&M University System.
44. Roos, D., 1971. Summary Report: The Dial-a-ride Transportation System. MIT Urban Systems Laboratory, Cambridge, Massachusetts, USL TR-70-10.
45. Ropke S., Cordeau J.F., Laporte G. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 2007, 49(4):258-272.
46. Santos A., McGuckin N., Nakamoto H.Y., Gray D., Liss S. Summary of Travel Trends: 2009 National Household Travel Survey 2011, Federal Highway Administration, Washington, DC.
47. Savelsbergh M.W.P., Sol M. The general pickup and delivery problem. Transportation Science 1995, 29(1):17-29.
48. SuperShuttle. (accessed on 07.01.12). http://www.supershuttle.com.
49. Szplett D.B. Approximate procedures for planning public transit systems: a review and some examples. Journal of Advanced Transportation 1984, 18(3):245-257.
50. TriMet Paratransit Program. (last accessed on 05.03.12). http://www.trimet.org/lift/index.htm.
51. Wardman M. Public transport values of time. Transport Policy 2004, 11(4):363-377.
52. Zhao F., Zeng X. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. European Journal of Operational Research 2008, 186(2):841-855.