Using the Theory of Graphs on the Implementation of Bike Lane in Small Towns

Abstract

The study uses the Theory of Graphs in the implementation of bike lane in city with population between 70 and 100 thousand inhabitants, so that it is possible to calculate the shortest path between two vertices. The edges of this graph are the streets and avenues of the city. The process of choosing these streets is defined as Routing Problem in Arches based on the Smallest Path Problem can minimize costs, distances and path time. We conclude that graph theory has been successfully applied in a path defined with the aid of issues related to the graph.

Bi-objective freight scheduling optimization in an integrated forward/reverse logistic network using non-dominated sorting genetic algorithm-II

“…Likaj et al (2013) presented the use of Dijkstra's and Kruskal's algorithm to find the shortest path and minimum spanning tree which minimized the shipment cost. Barwaldt et al (2014) studied the use of graph theory for the implementation of bike lane in a small town. They found out that by using the graph theory, the bike lane was successfully generated by minimizing the cost and time of implementation.…”