IDEAS home Printed from https://ideas.repec.org/p/ags/ndtr09/207730.html

A research on the new Demand Responsive Transit service in Japan

Author

Listed:
  • Tsubouchi, Kota
  • Yamato, Hiroyuki
  • Hietaka, Kazuo

Abstract

This paper proposes practical Demand Responsive Transit (DRT) system with a new reservation processing called “Insured Announced Time Reservation System (IATRS)”. DRT service has been expected as an alternative mode in public transportation which aims to improve mobility in a city. However, it was initially impractical because the routing system cannot assure reserved passengers that vehicles will arrive at the passengers’ destination by the announced arrival time. The developed IATRS for this new DRT service intends to ensure the announced arrival time by employing a slack time variable and a new proposed algorithm. The program composes of vehicle-choosing and routing algorithms. The vehicle-choosing algorithm decides which vehicle will accept the new reservation, while the routing algorithm designs the new route and schedule for the vehicle chosen to serve the new reservation. The system calculates and updates the route of the vehicle and returns the pick-up time to the customers immediately during reservation. Moreover, the vehicle will not delay the announced arrival time of passengers who have reserved already even if new passengers are added and the schedule of the vehicle is updated. In order to validate the proposed DRT service, one experiment was conducted in Kashiwa City, Japan in 2008. In the experiment in Kashiwa City, which is recognized as a commuters’ town of Tokyo metropolitan area, 3851 passengers used the about five DRT vehicles in 40 days (480 hours). It was shown that the characteristics of this system worked very well, and more than 44.7 percent of passengers were satisfied with the DRT service because they can make a reservation via personal computers and they were able to specify dependable arrival time or pick-up time. And 36.1 percent of passengers answered that their chances of going out increased by the introduction of DRT service. The result of Willingness To Pay (WTP) analysis is more than twice of fixed bus (353 yen / ride). In conclusion, the result of experiment showed the developed DRT service is a practical alternative mode for public transportation.

Suggested Citation

  • Tsubouchi, Kota & Yamato, Hiroyuki & Hietaka, Kazuo, 2009. "A research on the new Demand Responsive Transit service in Japan," 50th Annual Transportation Research Forum, Portland, Oregon, March 16-18, 2009 207730, Transportation Research Forum.
    • Handle: RePEc:ags:ndtr09:207730
    DOI: 10.22004/ag.econ.207730
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/207730/files/2009_83_NewDemandResponsive_paper.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.22004/ag.econ.207730?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
    2. Fabri, A. & Recht, P., 2006. "On dynamic pickup and delivery vehicle routing with several time windows and waiting times," Transportation Research Part B: Methodological, Elsevier, vol. 40(4), pages 335-350, May.
    3. Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
    4. Jaw, Jang-Jei & Odoni, Amedeo R. & Psaraftis, Harilaos N. & Wilson, Nigel H. M., 1986. "A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 243-257, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wright, Steve & Emele, C. David & Fukumoto, Masayuki & Velaga, Nagendra R. & Nelson, John D., 2014. "The design, management and operation of flexible transport systems: Comparison of experience between UK, Japan and India," Research in Transportation Economics, Elsevier, vol. 48(C), pages 330-338.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dai, Rongjian & Ding, Chuan & Gao, Jian & Wu, Xinkai & Yu, Bin, 2022. "Optimization and evaluation for autonomous taxi ride-sharing schedule and depot location from the perspective of energy consumption," Applied Energy, Elsevier, vol. 308(C).
    2. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    3. Arvind U. Raghunathan & David Bergman & John N. Hooker & Thiago Serra & Shingo Kobori, 2024. "Seamless Multimodal Transportation Scheduling," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 336-358, March.
    4. Chandra, Shailesh & Quadrifoglio, Luca, 2013. "A model for estimating the optimal cycle length of demand responsive feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 1-16.
    5. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
    6. Kirchler, Dominik & Wolfler Calvo, Roberto, 2013. "A Granular Tabu Search algorithm for the Dial-a-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 120-135.
    7. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    8. Hai Wang, 2019. "Routing and Scheduling for a Last-Mile Transportation System," Service Science, INFORMS, vol. 53(1), pages 131-147, February.
    9. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    10. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    11. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Operational effects of service level variations for the dial-a-ride problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 71-90, March.
    12. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    13. Masoud, Neda & Jayakrishnan, R., 2017. "A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 218-236.
    14. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
    15. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    16. Chen, Shijie & Rahman, Md Hishamur & Marković, Nikola & Siddiqui, Muhammad Imran Younus & Mohebbi, Matthew & Sun, Yanshuo, 2024. "Schedule negotiation with ADA paratransit riders under value of time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    17. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    18. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    19. Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
    20. Ahuja, Ravindra K., 1956- & Dial, Robert B. & Orlin, James B., 1953-, 1998. "Fast infeasibility detection algorithms for dial-a-ride transit problems," Working papers WP 4005-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ags:ndtr09:207730. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: AgEcon Search (email available below). General contact details of provider: http://www.trforum.org/journal/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.