The objective of this research was to model a transportation network as a graph and apply graph theory algorithms to find optimal routes that minimize time and cost. The network of a transport company was modeled as a valued directed graph with nodes (stations) and edges (routes) weighted by time and cost. Using the Dijkstra and Floyd-Warshall algorithms, the shortest paths between each pair of nodes were determined. The results made it possible to identify opportunities for improvement in route assignment, managing to reduce average delivery times by 8% and costs by 5%, demonstrating the utility of graph theory for the optimization of transportation networks.
