11,825 research outputs found

    A GIS toolkit to evaluate individual and joint accessibility to urban opportunities

    Get PDF

    GIS and Network Analysis

    Get PDF
    Both geographic information systems (GIS) and network analysis are burgeoning fields, characterised by rapid methodological and scientific advances in recent years. A geographic information system (GIS) is a digital computer application designed for the capture, storage, manipulation, analysis and display of geographic information. Geographic location is the element that distinguishes geographic information from all other types of information. Without location, data are termed to be non-spatial and would have little value within a GIS. Location is, thus, the basis for many benefits of GIS: the ability to map, the ability to measure distances and the ability to tie different kinds of information together because they refer to the same place (Longley et al., 2001). GIS-T, the application of geographic information science and systems to transportation problems, represents one of the most important application areas of GIS-technology today. While traditional GIS formulation's strengths are in mapping display and geodata processing, GIS-T requires new data structures to represent the complexities of transportation networks and to perform different network algorithms in order to fulfil its potential in the field of logistics and distribution logistics. This paper addresses these issues as follows. The section that follows discusses data models and design issues which are specifically oriented to GIS-T, and identifies several improvements of the traditional network data model that are needed to support advanced network analysis in a ground transportation context. These improvements include turn-tables, dynamic segmentation, linear referencing, traffic lines and non-planar networks. Most commercial GIS software vendors have extended their basic GIS data model during the past two decades to incorporate these innovations (Goodchild, 1998). The third section shifts attention to network routing problems that have become prominent in GIS-T: the travelling salesman problem, the vehicle routing problem and the shortest path problem with time windows, a problem that occurs as a subproblem in many time constrained routing and scheduling issues of practical importance. Such problems are conceptually simple, but mathematically complex and challenging. The focus is on theory and algorithms for solving these problems. The paper concludes with some final remarks.

    FLIAT, an object-relational GIS tool for flood impact assessment in Flanders, Belgium

    Get PDF
    Floods can cause damage to transportation and energy infrastructure, disrupt the delivery of services, and take a toll on public health, sometimes even causing significant loss of life. Although scientists widely stress the compelling need for resilience against extreme events under a changing climate, tools for dealing with expected hazards lag behind. Not only does the socio-economic, ecologic and cultural impact of floods need to be considered, but the potential disruption of a society with regard to priority adaptation guidelines, measures, and policy recommendations need to be considered as well. The main downfall of current impact assessment tools is the raster approach that cannot effectively handle multiple metadata of vital infrastructures, crucial buildings, and vulnerable land use (among other challenges). We have developed a powerful cross-platform flood impact assessment tool (FLIAT) that uses a vector approach linked to a relational database using open source program languages, which can perform parallel computation. As a result, FLIAT can manage multiple detailed datasets, whereby there is no loss of geometrical information. This paper describes the development of FLIAT and the performance of this tool

    Automating the administration boundary design process using Hierarchical Spatial Reasoning theory and Geographical Information Systems

    Get PDF
    This paper addresses the problems associated with the integration of data between incongruent boundary systems. Currently, the majority of spatial boundaries are designed in an uncoordinated manner with individual organisations generating individual boundaries to meet individual needs. As a result, current technologies for analysing geospatial information, such as geographic information systems (GISs), are not reaching their full potential. In response to the problem of uncoordinated boundaries, the authors present an algorithm for the hierarchical structuring of administrative boundaries. This algorithm applies hierarchical spatial reasoning (HSR) theory to the automated structuring of polygons. In turn, these structured boundary systems facilitate accurate data integration and analysis whilst meeting the spatial requirements of selected agencies. The algorithm is presented in two parts. The first part outlines previous research undertaken by the authors into the delineation of administrative boundaries in metropolitan regions. The second part outlines the distinctly different constraints required for administrative-boundary design in rural areas. The formalisation of the algorithm has taken place in a GIS environment utilising Avenue, an object-orientated programming language that operates under ArcView, the desktop software developed and distributed by ESRI

    Automating the administration boundary design process using Hierarchical Spatial Reasoning theory and Geographical Information Systems

    Get PDF
    This paper addresses the problems associated with the integration of data between incongruent boundary systems. Currently, the majority of spatial boundaries are designed in an uncoordinated manner with individual organisations generating individual boundaries to meet individual needs. As a result, current technologies for analysing geospatial information, such as geographic information systems (GISs), are not reaching their full potential. In response to the problem of uncoordinated boundaries, the authors present an algorithm for the hierarchical structuring of administrative boundaries. This algorithm applies hierarchical spatial reasoning (HSR) theory to the automated structuring of polygons. In turn, these structured boundary systems facilitate accurate data integration and analysis whilst meeting the spatial requirements of selected agencies. The algorithm is presented in two parts. The first part outlines previous research undertaken by the authors into the delineation of administrative boundaries in metropolitan regions. The second part outlines the distinctly different constraints required for administrative-boundary design in rural areas. The formalisation of the algorithm has taken place in a GIS environment utilising Avenue, an object-orientated programming language that operates under ArcView, the desktop software developed and distributed by ESRI
    • …
    corecore