Centre de documentation
scientifique

Adaptive zoning for transport mode choice modeling / Alex Hagen-Zanker in Transactions in GIS, vol 17 n° 5 (October 2013)  

Public [article]  inTransactions in GIS > vol 17 n° 5 (October 2013) . - pp 706 - 723 Titre : Adaptive zoning for transport mode choice modeling Type de document : Article/Communication Auteurs : Alex Hagen-Zanker, Auteur ; Ying Jin, Auteur Année de publication : 2013 Article en page(s) : pp 706 - 723 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] extensibilité [Termes IGN] interaction spatiale [Termes IGN] Londres [Termes IGN] modélisation spatiale [Termes IGN] outil d'aide à la décision [Termes IGN] réseau de transport [Termes IGN] zonage (urbanisme) Résumé : (Auteur) Adaptive zoning is a recently introduced method for improving computer modeling of spatial interactions and movements in the transport network. Unlike traditional zoning, where geographic locations are defined by one single universal plan of discrete land parcels or ‘zones’ for the study area, adaptive zoning establishes a compendium of different zone plans, each of which is applicable to one journey origin or destination only. These adaptive zone plans are structured to represent strong spatial interactions in proportionately more detail than weaker ones. In recent articles, it has been shown that adaptive zoning improves, by a large margin, the scalability of models of spatial interaction and road traffic assignment. This article confronts the method of adaptive zoning with an application of the scale and complexity for which it was intended, namely an application of mode choice modeling that at the same time requires a large study area and a fine-grained zone system. Our hypothesis is that adaptive zoning can significantly improve the accuracy of mode choice modeling because of its enhanced sensitivity to the geographic patterns and scales of spatial interaction. We test the hypothesis by investigating the performance of three alternative models: (1) a spatially highly detailed model that is permissible to the maximum extent by available data, but requires a high computational load that is generally out of reach for rapid turnaround of policy studies; (2) a mode choice model for the same area, but reducing the computational load by 90% by using a traditional zone system consisting of fewer zones; and (3) a mode choice model that also reduces the computational load by 90%, but based on adaptive zoning instead. The tests are carried out on the basis of a case study that uses the dataset from the London Area Transport Survey. Using the first model as a benchmark, it is found that for a given computational load, the model based on adaptive zoning contains about twice the amount of information of the traditional model, and model parameters on adaptive zoning principles are more accurate by a factor of six to eight. The findings suggest that adaptive zoning has a significant potential in enhancing the accuracy of mode choice modeling at the city or city-region scale. Numéro de notice : A2013-578 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2012.01372.x Date de publication en ligne : 14/01/2013 En ligne : https://doi.org/10.1111/j.1467-9671.2012.01372.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32714 [article]

The k closest pairs in spatial databases: When only set is indexed / Gilberto Gutiérrez in Geoinformatica, vol 17 n° 4 (October 2013)  

Public [article]  inGeoinformatica > vol 17 n° 4 (October 2013) . - pp 543 - 565 Titre : The k closest pairs in spatial databases: When only set is indexed Type de document : Article/Communication Auteurs : Gilberto Gutiérrez, Auteur ; Pablo Saez, Auteur Année de publication : 2013 Article en page(s) : pp 543 - 565 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] arbre-R [Termes IGN] base de données localisées [Termes IGN] extensibilité [Termes IGN] rectangle englobant minimum [Termes IGN] requête spatiale Résumé : (Auteur) We provide in this article a branch-and-bound algorithm that solves the problem of finding the k closest pairs of points (p,q), p € P,q € Q, considering two sets of points in the euclidean plane P,Q stored in external memory assuming that only one of the sets has a spatial index. This problem arises naturally in many scenarios, for instance when the set without an index is the answer to a spatial query. The main idea of our algorithm is to partition the space occupied by the set without an index into several cells or subspaces and to make use of the properties of a set of metrics defined on two Minimum Bounding Rectangles (MBRs). We evaluated our algorithm for different values of k by means of a series of experiments that considered both synthetical and real world datasets. We compared the performance of our algorithm with that of techniques that either assume that both datasets have a spatial index or that none has an index. The results show that our algorithm needs only between a 0.3 and a 35 % of the disk accesses required by such techniques. Our algorithm also shows a good scalability, both in terms of k and of the size of the data set. Numéro de notice : A2013-509 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-012-0169-4 Date de publication en ligne : 14/09/2012 En ligne : https://doi.org/10.1007/s10707-012-0169-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32647 [article]

Exemplaires(1)

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