Έρευνα και συγκριτική μελέτη αλγορίθμων δρομολόγησης για οχήματα με υλοποίηση σε εφαρμογή χαρτών
Research, comparative study of car path finding algorithms and development of a map routing app
View/
Keywords
Δρομολόγηση ; A* ; Dijkstra ; GraphHopper ; OpenStreetMap ; Αξιολόγηση απόδοσης ; Routing ; Performance evaluation ; Web application ; Java ; Spring Boot ; REST ; Bidirectional algorithms ; Pathfinding algorithms ; Αλγόριθμοι δρομολόγησηςAbstract
This dissertation focuses on the comparative evaluation of routing algorithms using real-world road network data, based on OpenStreetMap and the GraphHopper library. An integrated application was developed, enabling the definition of different routing scenarios, the selection of vehicles and optimization profiles, as well as the execution of multiple algorithms (Dijkstra, A*, Bidirectional Dijkstra, Bidirectional A*). The evaluation relied on metrics such as computation time, route length, travel time, and the number of explored nodes. The results highlight the clear superiority of heuristic-based algorithms and their bidirectional versions in large-scale or complex routing scenarios, while also demonstrating the variations arising from different vehicle types and optimization criteria. The thesis contributes to understanding both the practical and theoretical aspects of routing algorithm performance and provides an extensible experimentation tool for future research.
Department
Σχολή Τεχνολογιών Πληροφορικής και Επικοινωνιών. Τμήμα ΠληροφορικήςNumber of pages
38Language
GreekCollections
Except where otherwise noted, this item's license is described as
Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ελλάδα
Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ελλάδα