Papers by Lucas José Machado
Bicycle paths are increasingly becoming part of road infrastructure of cities. However, the expan... more Bicycle paths are increasingly becoming part of road infrastructure of cities. However, the expansion of bicycle paths network demands planning to prioritize investment in order to attend the population needs properly. The connectivity between bicycle paths is considered the most important issue pointed out by cyclists. In this work, it is assumed that the problem of planning bicycle path networks can be solved by using graph theory. Therefore, this work proposes a decision support to help planning bicycle path network, prioritizing the connectivity between the existing bicycle paths by using concepts of clustering, centrality and shortest path. In experiments performed in Joinville – Brazil, it could be seen that the proposed method can help specialists by promoting discussions about the bicycle path network connectivity. Also, it was observed that the usage of graph database increased considerably the solution performance.
Uploads
Papers by Lucas José Machado