Route Time Management System

Context

Qt/C++ application for managing and optimizing travel times between French cities

Description

Desktop application developed with Qt 6 and C++17 for calculating and optimizing travel times between different French cities. It integrates the Floyd-Warshall algorithm for shortest paths and a nearest neighbor heuristic to solve the Traveling Salesman Problem (TSP). The application offers interactive map visualization on a France SVG map and allows exporting results to PDF.

May 2025
1 person
University Project • 18/20

Skills used

C++
Qt
CMake

Skills

Skills used

C++
Qt
CMake

Skills acquired

Qt

Skills improved

C++
CMake

Features

09Features
Swipe< >
01

Instant calculation of travel times between two cities

C++
Qt
02

Generation of complete matrix of all travel times

Qt
CMake
C++
03

Floyd-Warshall algorithm for automatic shortest path calculation

CMake
C++
Qt
04

Traveling Salesman Problem (TSP) resolution with nearest neighbor heuristic

C++
Qt
05

Visualization of optimal route on interactive SVG map

Qt
CMake
C++
06

Calculation of optimal depot minimizing travel times to all cities

CMake
C++
Qt
07

Data import from CSV files (cities with GPS coordinates, travel times)

C++
Qt
08

Export of results and detailed reports to PDF

Qt
CMake
C++
09

Smooth graphical interface with Qt Widgets, QGraphicsView and QtSvgWidgets

CMake
C++
Qt

Gallery

Gallery

7

Downloads