Optimal journey planning depending on distance and passenger density parameters

摘要

Since notion of smart city and related applications have become very common recently, local governments have an urge to use computers and high technology in their public transportation systems. A typical example is planning optimal journeys for travelers depending on different parameters. In this work, a graph model and a solution method based on well-known algorithms, for planning optimal journeys depending on distance and passenger density parameters are proposed.