Using K-Shortest Paths Algorithms to Accommodate User Preferences in the Optimization of Public Transport Travel

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. 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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 17 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.