Many facilities exist to provide essential services in a city or region. The service area of a facility refers to a geographical area where the intended service of the facility can be received effectively. Service area delineation varies with the particular service a facility provides. This topic examines two types of service areas, one that can be defined based on a predetermined range such as travel distance/time and another based on the nearest facility available. Relevant location models are introduced to identify the best location(s) of one or multiple facilities to maximize service provision or minimize the system-wide cost. The delineation of service areas and structuring of a location model draw extensively on existing functions in a GIS. The topic represents an important area of GIS&T.
Modelling accessibility involves combining ideas about destinations, distance, time, and impedances to measure the relative difficulty an individual or aggregate region faces when attempting to reach a facility, service, or resource. In its simplest form, modelling accessibility is about quantifying movement opportunity. Crucial to modelling accessibility is the calculation of the distance, time, or cost distance between two (or more) locations, which is an operation that geographic information systems (GIS) have been designed to accomplish. Measures and models of accessibility thus draw heavily on the algorithms embedded in a GIS and represent one of the key applied areas of GIS&T.
Linear referencing is a term that encompasses a family of concepts and techniques for associating features with a spatial location along a network, rather than referencing those locations to a traditional spherical or planar coordinate system. Linear referencing is used when the location on the network, and the relationships to other locations on the network, are more significant than the location in 2D or 3D space. Linear referencing is commonly used in transportation applications, including roads, railways, and pipelines, although any network structure can be used as the basis for linearly referenced features. Several data models for storing linearly referenced data are available, and well-defined sets of procedures can be used to implement linear referencing for a particular application. As network analysis and network based statistical analysis become more prevalent across disciplines, linear referencing is likely to remain an important component of the data used for such analyses.
A network is a widely used term with different definitions and methodologies depending on the applications. In GIS, a network refers to an arrangement of elements (i.e., nodes, links) and information on their connections and interactions. There are two types of networks: physical and logical. While a physical network has tangible objects (e.g., road segments), a logical network represents logical connections among nodes and links. A network can be represented with a mathematical notion called graph theory. Different network components are utilized to describe characteristics of a network including loops, walks, paths, circuits, and parallel edges. Network data are commonly organized in a vector format with network topology, specifically connectivity among nodes and links, whereas raster data can be also utilized for a least-cost problem over continuous space. Network data is utilized in a wide range of network analyses, including the classic shortest path problem.
Linear programming is a set of methods for finding optimal solutions to mathematical models composed of a set of linear functions. Many spatial location problems can be structured as linear programs. However, even modest-sized problem instances can be very difficult to solve due to the combinatorial complexity of the problems and the associated computational expense that they incur. Geographic Information Systems software does not typically incorporate formal linear programming functionality, and instead commonly uses heuristic solution procedures to generate near-optimal solutions quickly. There is growing interest in integrating the spatial analytic tools incorporated in Geographic Information Systems with the solution power of linear programming software to generate guaranteed optimal solutions to spatial location problems.
The idea of networks has become popular in GIS since the early 1990s. There are several applications of network analyses that could be solved with the use of GIS but the first and foremost context that comes to mind is that of city planning. A network structure emphasizes the connectivity between infrastructure, essential amenities, and green spaces in a city. If we assume each amenity to be a single node then the interconnections among these nodes via street networks become the underlying network structure that defines the city’s accessibility. Such an assumption of the city’s structure has been highly relevant in transportation studies while defining traffic volume and traffic routing through the city. In such a case each street intersection becomes a single node within the network and the streets themselves are the edges. A network-based understanding of the city’s pulse is essential to model the behavior of human mobility, network accessibility and understanding of safety and emergency needs during times of extreme events. The most important aspect of network analyses till date has been routing and allocation modeling. In a complex network the problem of finding the shortest optimal route from an origin to a destination can be a np hard problem depending upon the number of parameters needed to reach the optimal solution. There are several mechanisms to resolve the complexity of the routing problem one of the common methods being multicriteria decision analyses which I will elaborate in detail in the following sections.