Efficient mobility methods in modern transportation networks

Abstract

This Doctoral Dissertation deals with the design, development, and experimental evaluation of an algorithmic toolkit for solving important optimal routing problems in transport networks. In this context, the main goal is to find time-dependent travel path solutions containing the required travel-movement decisions. The examined problems concern the computation of: i) one or more (alternative) time-dependent optimal paths, with a constant upper bounded approximation ratio on optimal travel time, representing unrestricted-departure travel solutions by car in road networks; and ii) one or more (Pareto) time-dependent multimodal optimal paths, representing travel solutions by multiple transport means (e.g., car, train, bus, tram) and modes (e.g., driving, walking, boarding) in transport networks. Particularly, paths are computed: a) from a source point to a destination point; b) at any departure time at the source point in a periodic interval of at least one day; c) with time-dependent tra ...
show more

All items in National Archive of Phd theses are protected by copyright.

DOI
10.12681/eadd/52937
Handle URL
http://hdl.handle.net/10442/hedi/52937
ND
52937
Alternative title
Αποδοτικές μέθοδοι κινητικότητας σε σύγχρονα συγκοινωνιακά δίκτυα
Author
Paraskevopoulos, Andreas (Father's name: Georgios)
Date
2019
Degree Grantor
University of Patras
Committee members
Ζαρολιάγκης Χρήστος
Γαλλόπουλος Ευστράτιος
Κοντογιάννης Σπυρίδων
Μακρής Χρήστος
Καραγιάννης Ιωάννης
Σιούτας Σπυρίδων
Νικολετσέας Σωτήριος
Discipline
Natural SciencesComputer and Information Sciences ➨ Computer science, theory and methods
Natural SciencesMathematics ➨ Applied Mathematics
Keywords
Graph; Time-dependent routing; Multimodal routing; Road network; Public transport; Itinerary; Pedestrian network; Landmark; Timetable update; Alternative graph; Graph pruning; Penalty method; Plateau method; OFLAT method; CFLAT method; TDAG algorithm; MDTM model; Travel time function; Linear interpolation; Optimization; Shortest path
Country
Greece
Language
Greek
Description
im., tbls., maps, fig., ch.
Usage statistics
VIEWS
Concern the unique Ph.D. Thesis' views for the period 07/2018 - 07/2023.
Source: Google Analytics.
ONLINE READER
Concern the online reader's opening for the period 07/2018 - 07/2023.
Source: Google Analytics.
DOWNLOADS
Concern all downloads of this Ph.D. Thesis' digital file.
Source: National Archive of Ph.D. Theses.
USERS
Concern all registered users of National Archive of Ph.D. Theses who have interacted with this Ph.D. Thesis. Mostly, it concerns downloads.
Source: National Archive of Ph.D. Theses.
Related items (based on users' visits)