Centre de documentation
scientifique

A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1368 - 1390 Titre : A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks Type de document : Article/Communication Auteurs : Shaohua Wang, Auteur ; Song Gao, Auteur ; Xin Feng, Auteur ; Alan T. Murray, Auteur ; Yuan Zeng Année de publication : 2018 Article en page(s) : pp 1368 - 1390 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes IGN] arbre-R [Termes IGN] chaîne de traitement [Termes IGN] chemin le plus court, algorithme du [Termes IGN] démonstration de faisabilité [Termes IGN] méthode heuristique [Termes IGN] objet mobile [Termes IGN] optimisation (mathématiques) [Termes IGN] position [Termes IGN] prise en compte du contexte [Termes IGN] réseau routier Résumé : (Editeur) Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e. distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space–time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a geographic information systems environment to facilitate integration with external geographic contextual information, e.g. temporary road barriers, points of interest, and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management. Numéro de notice : A2018-278 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2018.1431838 En ligne : https://doi.org/10.1080/13658816.2018.1431838 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90360 [article]

Exemplaires(1)

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

A parallel algorithm for coverage optimization on multi-core architectures / Ran Wei in International journal of geographical information science IJGIS, vol 30 n° 3-4 (March - April 2016)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 30 n° 3-4 (March - April 2016) . - pp 432 - 450 Titre : A parallel algorithm for coverage optimization on multi-core architectures Type de document : Article/Communication Auteurs : Ran Wei, Auteur ; Alan T. Murray, Auteur Année de publication : 2016 Article en page(s) : pp 432 - 450 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] architecture de système [Termes IGN] Californie (Etats-Unis) [Termes IGN] couverture (données géographiques) [Termes IGN] cyberinfrastructure [Termes IGN] Ohio (Etats-Unis) [Termes IGN] optimisation spatiale [Termes IGN] système d'information géographique [Termes IGN] traitement parallèle Résumé : (Auteur) Location siting is an important part of service provision, with much potential to impact operational efficiency, safety, security, system reliability, etc. A class of location models seeks to optimize coverage of demand for service that is continuously distributed across space. Decision-making and planning contexts include police/fire resource allocation for a community, siting cellular towers to support cell phone signal transmission, locating emergency warning sirens to alert the public of severe weather and other related dangers, and many others as well. When facilities can be sited anywhere in continuous space to provide coverage to an entire region, this is a very computationally challenging problem to solve because potential demand for service is everywhere and there are an infinite number of potential facility sites to consider. This article develops a new parallel solution approach for this location coverage optimization problem through an iterative bounding scheme on multi-core architectures. The developed approach is applied to site emergency warning sirens in Dublin, Ohio, and fire stations in Elk Grove, California. Results demonstrate the effectiveness and efficiency of the proposed approach, enabling real-time analysis and planning. This work illustrates that the integration of cyberinfrastructure can significantly improve computational efficiency in solving challenging spatial optimization problems, fitting the themes of this special issue: cyberinfrastructure, GIS, and spatial optimization. Numéro de notice : A2016-202 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1030750 En ligne : https://doi.org/10.1080/13658816.2015.1030750 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79888 [article]

Exemplaires(1)

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

A new approach to quantifying spatial contiguity using graph theory and spatial interaction / X. Wu 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 387 - 407 Titre : A new approach to quantifying spatial contiguity using graph theory and spatial interaction Type de document : Article/Communication Auteurs : X. Wu, Auteur ; Alan T. Murray, Auteur Année de publication : 2008 Article en page(s) : pp 387 - 407 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] interaction spatiale [Termes IGN] paysage [Termes IGN] théorie des graphes [Termes IGN] voisinage (relation topologique) Résumé : (Auteur) Spatial contiguity is an important and fundamental landscape property in land allocation, habitat design, and forest management. The agreed upon notion of contiguity in the literature suggests shapelessness. However, existing approaches for measuring/promoting contiguity use proxies that either favour a particular shape or ignore inter-patch relationships in fragmented landscapes. We propose an unbiased relative measure of contiguity ranging from zero to one based on graph theory and spatial interaction. The new measure reflects intra-patch and inter-patch relationships by quantifying contiguity within patches and potential contiguity among patches. Empirical analysis suggests that this measure of contiguity is reliable, consistent, and insensitive to sub-region shape. Copyright Taylor & Francis Numéro de notice : A2008-146 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810701405615 En ligne : https://doi.org/10.1080/13658810701405615 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29141 [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

Coverage optimization in continuous space facility siting / Alan T. Murray in International journal of geographical information science IJGIS, vol 21 n° 6-7 (july 2007)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 21 n° 6-7 (july 2007) . - pp 757 - 776 Titre : Coverage optimization in continuous space facility siting Type de document : Article/Communication Auteurs : Alan T. Murray, Auteur ; D. Tong, Auteur Année de publication : 2007 Article en page(s) : pp 757 - 776 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] aménagement régional [Termes IGN] aménagement urbain [Termes IGN] équipement collectif [Termes IGN] intersection spatiale [Termes IGN] Ohio (Etats-Unis) [Termes IGN] point de polygonation Résumé : (Auteur) Facility placement and associated service coverage are major concerns in urban and regional planning. In this paper an approach is detailed for the problem of covering spatial demand for service, where potential facilities are located in the continuous plane. It is shown that weighted demand, represented as points, lines or polygons, can be optimally served by a finite number of potential facility locations, called the polygon intersection point set (PIPS). The developed approach is an extension of a point-based abstraction of demand to more general representations (e.g. points, lines or polygons). An empirical analysis of warning siren siting in Ohio is carried out, highlighting the applicability of this approach. Numéro de notice : A2007-270 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810601169857 En ligne : https://doi.org/10.1080/13658810601169857 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28633 [article]

Exemplaires(2)

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