Centre de documentation
scientifique

The partial sequenced route query with traveling rules in road networks / H. Chen in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 541 - 569 Titre : The partial sequenced route query with traveling rules in road networks Type de document : Article/Communication Auteurs : H. Chen, Auteur ; W. Ku, Auteur ; M. Sun, Auteur ; R. Zimmermann, Auteur Année de publication : 2011 Article en page(s) : pp 541 - 569 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] calcul d'itinéraire [Termes IGN] itinéraire [Termes IGN] point d'intérêt [Termes IGN] requête spatiale [Termes IGN] réseau routier [Termes IGN] service fondé sur la position Résumé : (Auteur) In modern geographic information systems, route search represents an important class of queries. In route search related applications, users may want to define a number of traveling rules (traveling preferences) when they plan their trips. However, these traveling rules are not considered in most existing techniques. In this paper, we propose a novel spatial query type, the multi-rule partial sequenced route (MRPSR) query, which enables efficient trip planning with user defined traveling rules. The MRPSR query provides a unified framework that subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. The difficulty in answering MRPSR queries lies in how to integrate multiple choices of points-of-interest (POI) with traveling rules when searching for satisfying routes. We prove that MRPSR query is NP-hard and then provide three algorithms by mapping traveling rules to an activity on vertex network. Afterwards, we extend all the proposed algorithms to road networks. By utilizing both real and synthetic POI datasets, we investigate the performance of our algorithms. The results of extensive simulations show that our algorithms are able to answer MRPSR queries effectively and efficiently with underlying road networks. Compared to the Light Optimal Route Discoverer (LORD) based brute-force solution, the response time of our algorithms is significantly reduced while the distances of the computed routes are only slightly longer than the shortest route. Numéro de notice : A2011-211 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0115-2 Date de publication en ligne : 03/09/2010 En ligne : https://doi.org/10.1007/s10707-010-0115-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30989 [article]

Exemplaires(1)

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