Accommodating user preferences in the optimization of public transport travel

Two solutions are provided in this paper to accommodate user preferences in the optimisation of public transport travel by using different shortest path(s) algorithms: the single purpose shortest path algorithms and the K-shortest paths algorithm. A detailed approach about using 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 is presented. The experimental results based on the public transportation network of Nottingham City show that the single purpose shortest path algorithms work efficiently but can only accommodate one single user preference and the K-shortest path algorithm generates multiple routes in one time, however, with a longer computational execution time.