Centre de documentation
scientifique

Spatial optimization for regionalization problems with spatial interaction: a heuristic approach / Kamyoung Kim 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 451 - 473 Titre : Spatial optimization for regionalization problems with spatial interaction: a heuristic approach Type de document : Article/Communication Auteurs : Kamyoung Kim, Auteur ; Denis J. Dean, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 451 - 473 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] interaction spatiale [Termes IGN] méthode heuristique [Termes IGN] optimisation spatiale [Termes IGN] régionalisation (segmentation) Résumé : (Auteur) Spatial optimization techniques are commonly used for regionalization problems, often represented as p-regions problems. Although various spatial optimization approaches have been proposed for finding exact solutions to p-regions problems, these approaches are not practical when applied to large-size problems. Alternatively, various heuristics provide effective ways to find near-optimal solutions for p-regions problem. However, most heuristic approaches are specifically designed for particular geographic settings. This paper proposes a new heuristic approach named Automated Zoning Procedure-Center Interchange (AZP-CI) to solve the p-functional regions problem (PFRP), which constructs regions by combining small areas that share common characteristics with predefined functional centers and have tight connections among themselves through spatial interaction. The AZP-CI consists of two subprocesses. First, the dissolving/splitting process enhances diversification and thereby produces an extensive exploration of the solution space. Second, the standard AZP locally improves the objective value. The AZP-CI was tested using randomly simulated datasets and two empirical datasets with different sizes. These evaluations indicate that AZP-CI outperforms two established heuristic algorithms: the AZP and simulated annealing, in terms of both solution quality and consistency of producing reliable solutions regardless of initial conditions. It is also noted that AZP-CI, as a general heuristic method, can be easily extended to other regionalization problems. Furthermore, the AZP-CI could be a more scalable algorithm to solve computational intensive spatial optimization problems when it is combined with cyberinfrastructure. Numéro de notice : A2016-203 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1031671 En ligne : https://doi.org/10.1080/13658816.2015.1031671 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79889 [article]

Exemplaires(1)

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

Finding optimal travel routes with uncertain cost data / Denis J. Dean in Transactions in GIS, vol 17 n° 2 (April 2013)  

Public [article]  inTransactions in GIS > vol 17 n° 2 (April 2013) . - pp 159 - 181 Titre : Finding optimal travel routes with uncertain cost data Type de document : Article/Communication Auteurs : Denis J. Dean, Auteur Année de publication : 2013 Article en page(s) : pp 159 - 181 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement [Termes IGN] base de données localisées [Termes IGN] calcul d'itinéraire [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] coût Résumé : (Auteur) Geospatial data analysis techniques are widely used to find optimal routes from specified starting points to specified destinations. Optimality is defined in terms of minimizing some impedance value over the length of the route – the value to be minimized might be distance, travel time, financial cost, or any other metric. Conventional analysis procedures assume that impedance values of all possible travel routes are known a priori, and when this assumption holds, efficient solution strategies exist that allow truly optimal solutions to be found for even very large problems. When impedance values are not known with certainty a priori, exact solution strategies do not exist and heuristics must be employed. This study evaluated how the quality of the solutions generated by one such heuristic were impacted by the nature of the uncertainty in the cost database, the nature of the costs themselves, and the parameters used in the heuristic algorithm. It was found that all of these factors influenced the qualities of the solutions produced by the heuristic, but encouragingly, an easily controlled parameter of the heuristic algorithm itself played the most important role in controlling solution quality. Numéro de notice : A2013-169 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2012.01359.x Date de publication en ligne : 09/10/2012 En ligne : https://doi.org/10.1111/j.1467-9671.2012.01359.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32307 [article]

Optimal routefinding with unlimited possible directions of movement / Denis J. Dean in Transactions in GIS, vol 15 n° 1 (February 2011)  

Public [article]  inTransactions in GIS > vol 15 n° 1 (February 2011) . - pp 87 - 107 Titre : Optimal routefinding with unlimited possible directions of movement Type de document : Article/Communication Auteurs : Denis J. Dean, Auteur Année de publication : 2011 Article en page(s) : pp 87 - 107 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes IGN] base de données localisées [Termes IGN] calcul d'itinéraire [Termes IGN] données maillées [Termes IGN] recherche du chemin optimal, algorithme de [Termes IGN] réseau routier [Termes IGN] système d'information géographique [Termes IGN] Triangular Regular Network Résumé : (Auteur) Finding optimal paths through raster databases is limited by the very nature of the raster data itself. This limitation restricts the possible directions of movement through the database from the infinite possibilities found in the real world to a finite number of possibilities defined by the cell-to-cell movement that characterizes raster databases. A Triangulated Irregular Network (TIN)-based alternative optimization model that allows unlimited possible directions of movement is presented. While not without its own limitations, this new approach offers a viable alternative to raster-based optimal routefinding. Numéro de notice : A2011-059 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/j.1467-9671.2010.01244.x Date de publication en ligne : 16/02/2011 En ligne : https://doi.org/10.1111/j.1467-9671.2010.01244.x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30840 [article]

Deriving new minimum cost pathways from existing paths / Denis J. Dean in Cartography and Geographic Information Science, vol 32 n° 1 (January 2005)  

Public [article]  inCartography and Geographic Information Science > vol 32 n° 1 (January 2005) . - pp 47 - 60 Titre : Deriving new minimum cost pathways from existing paths Type de document : Article/Communication Auteurs : Denis J. Dean, Auteur Année de publication : 2005 Article en page(s) : pp 47 - 60 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] Colorado (Etats-Unis) [Termes IGN] forêt [Termes IGN] itinéraire [Termes IGN] parc naturel régional [Termes IGN] programmation linéaire [Termes IGN] réseau routier Résumé : (Auteur) Without a priori cell traversing cost data, conventional GIS-based techniques cannot be used to find minimum cost paths from specified starting points to specified ending points. However, in one class of problems where these costs do not exist a priori, it may be possible to derive them. This class problem is characterized by the presence of an existing minimum cost path that is subject to the same traversing cost mechanics as the new path that is being contemplated. This study developed and evaluated linear programming-based techniques for deriving both isotropic and anisotropic traversing costs from existing minimum costs pathways. The derived costs can be used to find minimum cost routes for new pathways that are subject to the same cost mechanics as the existing pathways. The techniques presented here were evaluated by applying them to situation found in the forest road network of the Arapho and Roosevelt National Forest (ARNF) in Colorado. In 18 of the 19 situations evaluated, the predicted routes generated using the techniques presented here agreed with actual roads found in the ARNF. Numéro de notice : A2005-137 Affiliation des auteurs : non IGN Thématique : FORET/GEOMATIQUE Nature : Article DOI : 10.1559/1523040053270738 En ligne : https://doi.org/10.1559/1523040053270738 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27275 [article]

Exemplaires(1)

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

Toward a differential calculus for temporal map analysis / Denis J. Dean in Cartography and Geographic Information Science, vol 31 n° 2 (April 2004)  

Public [article]  inCartography and Geographic Information Science > vol 31 n° 2 (April 2004) . - pp 89 - 101 Titre : Toward a differential calculus for temporal map analysis Type de document : Article/Communication Auteurs : Denis J. Dean, Auteur Année de publication : 2004 Article en page(s) : pp 89 - 101 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image [Termes IGN] analyse diachronique [Termes IGN] analyse spatio-temporelle [Termes IGN] calcul différentiel [Termes IGN] détection de changement [Termes IGN] interpolation Résumé : (Auteur) Investigators in many fields are analyzing temporal change in spatial data. Such analyses are typically conducted by comparing the value of some metric (e.g., area, contagion, or diversity indices) measured at time T1, with the value of the same metric measured at time T2, These comparisons typically include the use of simple interpolation models to estimate the value of the metric of interest at points in time between observations, followed by applications of differential calculus to investigate the rates at which the metric is changing. Unfortunately, these techniques treat the values of the metrics being analyzed as if they were observed values, when in fact the metrics are derived from more fundamental spatial data. The consequence of treating metrics as observed values is a significant reduction in the degrees of freedom in spatial change over time. This results in an oversimplified view of spatio-temporal change. A more accurate view can be produced by (1) applying temporal interpolation models to observed spatial data rather than derived spatial metrics; (2) expanding the metric of interest's computational equation by replacing the terms relating to the observed spatial data with their temporal interpolation equations; and (3) differentiating the expanded computational equation. This alternative, three-step spatio-temporal analysis technique will be described and justified. The alternative technique will be compared to the conventional approach using common metrics and a sample data set. Numéro de notice : A2004-341 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1559/1523040041649380 En ligne : https://doi.org/10.1559/1523040041649380 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26868 [article]

Exemplaires(1)

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