This Master's Thesis presents a comprehensive exploration of a project aimed at enhancing minimum travel time path research algorithms for electric vehicles. The algorithm used for defining the minimum travel time path is Dijkstra's algorithm, which is implemented on a cost matrix constructed by assigning a specific recharging station within a map to each column and row. The value contained in each cell is the sum of the travel time taken from the station connected to the column to the station connected to the row, to which is added the recharging time required to restore the battery to its initial charge level.