Centre de documentation
scientifique

A spatiotemporal data model for dynamic transit networks / R. Huang in International journal of geographical information science IJGIS, vol 22 n° 4-5 (april 2008)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 22 n° 4-5 (april 2008) . - pp 527 - 545 Titre : A spatiotemporal data model for dynamic transit networks Type de document : Article/Communication Auteurs : R. Huang, Auteur ; Z.R. Peng, Auteur Année de publication : 2008 Article en page(s) : pp 527 - 545 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] calcul d'itinéraire [Termes IGN] données spatiotemporelles [Termes IGN] modèle conceptuel de données localisées [Termes IGN] modèle orienté objet [Termes IGN] modèle topologique complet [Termes IGN] relation topologique [Termes IGN] réseau de transport Résumé : (Auteur) A transit network is a spatiotemporally dynamic system whose topology, components, and services all change over time. The complexity and dynamic nature of transit networks make it difficult to model by traditional transportation models. This paper presents an object-oriented data model that coherently represents space, time, and dynamics of transit networks and supports schedule-based pathfinding. In this data model, a transit network and its components are modelled as spatiotemporal objects that have properties and behaviours. Unlike traditional roadway transportation network models that define topology as connectivity between geometric elements such as edges and nodes, this data model uniquely defines topology as sequences and collections of transit features which are application domain objects. Moreover, this data model supports the generation of active network topologies based on given times to represent real-time network states as well as to reduce topological redundancy. Implementations of the data model in two Internet transit trip planners have demonstrated that it can effectively reduce computation complexity of schedule-based pathfinding algorithms and enhance pathfinding performance. Copyright Taylor & Francis Numéro de notice : A2008-153 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810701492399 En ligne : https://doi.org/10.1080/13658810701492399 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29148 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-08031	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-08032	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A schedule-based pathfinding algorithm for transit networks using Pattern First Search [PFS] / R. Huang in Geoinformatica, vol 11 n° 2 (June - August 2007)  

Public [article]  inGeoinformatica > vol 11 n° 2 (June - August 2007) . - pp 269 - 285 Titre : A schedule-based pathfinding algorithm for transit networks using Pattern First Search [PFS] Type de document : Article/Communication Auteurs : R. Huang, Auteur Année de publication : 2007 Article en page(s) : pp 269 - 285 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] chemin le plus rapide, algorithme du [Termes IGN] complexité [Termes IGN] données spatiotemporelles [Termes IGN] requête spatiale [Termes IGN] réseau de transport [Termes IGN] système d'information géographique Résumé : (Auteur) The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US. Copyright Springer Numéro de notice : A2007-240 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-006-0011-y En ligne : https://doi.org/10.1007/s10707-006-0011-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28603 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-07021	RAB	Revue	Centre de documentation	En réserve L003	Disponible