Abstract
On-demand Bus is a new public transportation mode which has flexible schedule and flexible routes. Users can ride the bus only after making reservations. It is difficult for the On-demand Bus system without any operators to realize full demand typed service because there is no interaction between users and drivers to inform the concrete information about waiting spots. This paper proposes the new interface for On-demand Bus system through which users can register new bus stops by themselves. The developed interface, namely the developed system realizes CSCW (computer-supported cooperative work), which is a collaboration with the Internet. By developing the new interface, the full demand typed On-demand Bus service is realized and users evaluate the service positively.
Similar content being viewed by others
References
Hirata, T., Noda, I., Ota, M., Shinoda, K.: “Evaluation of Usefulness of Dial-a-ride system by Simulation-Case Study on Various City-size-”, The 17th Annual Conference of The Japanese Society for Artificial Intelligence (JSAI2003), 2003, 3B4-04
Yamato, H., Tsubouchi, K., Hiekata, K.: A research on real-time scheduling algorithm for on-demand bus and evaluation by simulation. Transp. Policy Stud. Rev. 10(4), 002–010 (2008)
Tsubouchi, K., Hiekata, K., Yamato, H.: Scheduling Algorithm for On-demand Bus System. Proceedings of the sixth International Conference on Information Technology : New Generations (ITNG), Las Vegas, pp. 823–828 (2009)
Tsubouchi, K., Yamato, H., Hiekata, K.: The evaluation of on-demand bus system by the community test. Transp. Policy Stud. Rev. 10(4), 011–020 (2008)
Stein, D.: Scheduling dial-a-ride transportation system. Transport. Sci. 12, 232–249 (1978)
Psaraftis, H.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Sci. 14, 130–154 (1980)
Psaraftis, H.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Sci. 17, 351–357 (1983)
Cullen, F., Jarvis, J., Ratliff, H.: Set partitioning based heuristics for interactive routing. Networks 11, 125–144 (1981)
Sexton, T.: The single vehicle many to many routing and scheduling problem. Ph.D. Thesis, State University of New York at Stony Brook, (1979).
Jaw, J., Odoni, A., Psaraftis, H., Wilson, N.: A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transp. Res. B. 20, 243–257 (1986)
Alfa, A.S.: Scheduling of vehicles for transportation of elderly. Transportation Plann. Technol. 11, 203–212 (1986)
Rhee, J.H.: Vehicle routing and scheduling strategies for demand responsive transportation systems. Ph.D. Dissertation, University of Delaware, Newark (1987)
Kikuchi, S., Rhee, J.H.: Scheduling method for demand responsive transportation system. J. Transp. Eng. 115, 630–645 (1989)
Acknowledgments
This study was supported in part by the Japan Science and Technology Agency’s CREST Program, and the program assisted by Ministry of Land, Infrastructure, Transport and Tourism. The system was arranged and serve was operated through collaboration rendered by JUNPUZI Co., Ltd. Community tests were conducted by assistance provided by CHODAI Co., Ltd and the Kashiwa City Planning Division. We thank Mitsutaka Nomata, director of Japan’s Land, Infrastructure, Transport, and Tourism Ministry National Planning Division.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tsubouchi, K., Yamato, H. & Hiekata, K. Development and Evaluation of New Interface for Registration of New Bus Stops for the On-Demand Bus System. Int. J. ITS Res. 8, 188–200 (2010). https://doi.org/10.1007/s13177-010-0014-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13177-010-0014-9