Using K-shortest paths algorithms to accommodate user preferences in the optimization of public transport travel

Wu, Q. and Hartley, J. ORCID: 0000-0003-0727-9588, 2004. Using K-shortest paths algorithms to accommodate user preferences in the optimization of public transport travel. In: Proceedings of the Eighth International Conference on Applications of Advanced Technologies in Transportaion Engineering, Beijing, China.

Full text not available from this repository.

Abstract

Traffic congestion is becoming a serious problem in more and more modern cities. Encouraging more private-vehicle drivers to use public transportation is one of the most effective and economical ways to reduce the ever increasing congestion problem on the streets (Hartley and Bargiela, 2001). In this paper, the author presents an approach that uses K-shortest paths algorithms to compute a reasonable number of ranked shortest paths, with the ultimate 'most optimal' path being selected by consideration of the preferences. Some experiments have been done based on the public transportation network of Nottingham City

Item Type: Conference contribution
Creators: Wu, Q. and Hartley, J.
Publisher: American Society of Civil Engineers
Place of Publication: Reston, VA
Date: 2004
Divisions: Schools > School of Science and Technology
Depositing User: EPrints Services
Date Added: 09 Oct 2015 11:17
Last Modified: 09 Jun 2017 13:55
URI: http://irep.ntu.ac.uk/id/eprint/25638

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year