Distributed approach for solving time-dependent problems in multimodal transport networks (Q606185): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104872182 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58647089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object modeling and path computation for multimodal travel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best routes selection in international intermodal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfer Graph Approach for Multimodal Transport Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:09, 3 July 2024

scientific article
Language Label Description Also known as
English
Distributed approach for solving time-dependent problems in multimodal transport networks
scientific article

    Statements

    Distributed approach for solving time-dependent problems in multimodal transport networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 November 2010
    0 references
    Summary: This paper presents an alternative approach for time-dependent multimodal transport problem. We describe a new graph structure to abstract multimodal networks, called transfer graph, which adapts to the distributed nature of real information sources of transportation networks. A decomposition of the Shortest Path Problem in transfer graph is proposed to optimize the computation time. This approach was computationally tested in several experimental multimodal networks having different size and complexity. The approach was integrated in the multimodal transport service of the European Carlink platform, where it has been validated in real scenarios. Comparision with other related works is provided.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references