An integrated approach for addressing geographic uncertainty in spatial optimization

There exist many facets of error and uncertainty in digital spatial information. As error or uncertainty will not likely ever be completely eliminated, a better understanding of its impacts is necessary. Spatial analytical approaches, in particular, must somehow address data-quality issues. This can range from evaluating impacts of potential data uncertainty in planning processes that make use of methods to devising methods that explicitly account for error/uncertainty. To date, little has been done to structure methods accounting for error. This article develops an integrated approach to address data uncertainty in spatial optimization. We demonstrate that it is possible to characterize uncertainty impacts by constructing and solving a new multi-objective model that explicitly incorporates facets of data uncertainty. Empirical findings indicate that the proposed approaches can be applied to evaluate the impacts of data uncertainty with statistical confidence, which moves beyond popular practices of simulating errors in data.     

Spatial optimization for regionalization problems with spatial interaction: a heuristic approach

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.     

Getting Charlie off the MTA: a multiobjective optimization method to account for cost constraints in public transit accessibility metrics

Most analyses of accessibility by public transit have focused on travel time and not considered the cost of transit fares. It is difficult to include fares in shortest-path algorithms because fares are often path-dependent. When fare policies allow discounted transfers, for example, the fare for a given journey segment depends on characteristics of previous journey segments. Existing methods to characterize tradeoffs between travel time and monetary cost objectives do not scale well to complex networks, or they rely on approximations. Additionally, they often require assumed values of time, which may be problematic for evaluating the equity of service provision. We propose a new method that allows us to find Pareto sets of paths, jointly minimizing fare and travel time. Using a case study in greater Boston, Massachusetts, USA, we test the algorithm’s performance as part of an interactive web application for computing accessibility metrics. Potential extensions for journey planning and route choice models are also discussed.     

A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems

Local search heuristics for very large-scale vehicle routing problems (VRPs) have made remarkable advances in recent years. However, few local search heuristics have focused on the use of the spatial neighborhood in Voronoi diagrams to improve local searches. Based on the concept of a k-ring shaped Voronoi neighbor, we propose a Voronoi spatial neighborhood-based search heuristic and algorithm to solve very large-scale VRPs. In this algorithm, k-ring Voronoi neighbors of a customer are limited to building and updating local routings, and rearranging local routings with improper links. This algorithm was evaluated using four sets of benchmark tests for 200–8683 customers. Solutions were compared with specific examples in the literature, such as the one-depot VRP. This algorithm produced better solutions than some of the best-known benchmark VRP solutions and requires less computational time. The algorithm outperformed previous methods used to solve very large-scale, real-world distance constrained capacitated VRP.     

A unified approach for location-allocation analysis: integrating GIS,distributed computing and spatial optimization

Location-allocation modeling is an important area of research in spatial optimization and GIScience. A large number of analytical models for location-allocation analysis have been developed in the past 50 years to meet the requirements of different planning and spatial-analytic applications, ranging from the location of emergency response units (EMS) to warehouses and transportation hubs. Despite their great number, many location-allocation models are intrinsically linked to one another. A well-known example is the theoretical link between the classic p-median problem and coverage location problems. Recently, Lei and Church showed that a large number of classic and new location models can be posed as special case problems of a new modeling construct called the vector assignment ordered median problem (VAOMP). Lei and Church also reported extremely high computational complexity in optimally solving the best integer linear programming (ILP) formulation developed for the VAOMP even for medium-sized problems in certain cases.

In this article, we develop an efficient unified solver for location-allocation analysis based on the VAOMP model without using ILP solvers. Our aim is to develop a fast heuristic algorithm based on the Tabu Search (TS) meta-heuristic, and message passing interface (MPI) suitable for obtaining optimal or near-optimal solutions for the VAOMP in a real-time environment. The unified approach is particularly interesting from the perspective of GIScience and spatial decision support systems (DSS) as it makes it possible to solve a wide variety of location models in a unified manner in a GIS environment. Computational results show that the TS method can often obtain in seconds, solutions that are better than those obtained using the ILP-based approach in hours or a day.     

中国石化产业空间组织的评价与优化(英文)

The spatial organization of the Chinese petrochemical industry was optimized ac-cording to the status of development of the industry employing linear programming and Ar-cGIS spatial analysis tools. We first identified the indexes of the spatial organization of the petrochemical industry and established a comprehensive evaluation index system that in-cludes four major categories and 11 indicators. The weight of each index was then deter-mined by the analytical hierarchy process. Afterward, taking the 337 Chinese prefecture-level administrations as basic units and scientifically evaluating the potential comprehensive layout coefficients of the cities, 151 prefecture-level administrative units were selected as the basis for the choice of optimization sites with a linear programming model. Secondly, using the 151 prefecture-level administrative units and the maximum-coverage model, the optimal number and spatial distribution of refineries were identified for service radii of 100, 200 and 300 km. Thirdly, considering the actual distribution of China’s refineries, general rules for the number of refinery layout points and objective values were summarized, and 52 refinery layout points were selected for China. Finally, with ArcGIS spatial analysis tools, the spatial effect of the 52 optimal refinery layout points was simulated for the service scope and socioeconomic factors respectively, and the GDP and population data for each refinery layout point were then ex-tracted within the service scope. On this basis and with estimation of the intensity of crude-oil consumption, final results were obtained for the optimal spatial organization of the Chinese refining capacity and ethylene production capacity.     

区域镇村社区空间网络结构特征及其优化策略

镇村社区空间网络是以镇区为依托、镇村社区为节点、彼此关联为连边构成的空间组织形态,探索其结构特征及其优化策略对引导要素合理流动、提升网络运行效率等具有重要意义。本文选取重庆市沙坪坝区凤凰镇19个镇村社区作为网络节点,采用修正后的引力强度模型反映节点之间的联系,运用GIS工具和社会网络分析法、相关性分析等方法探究镇村社区空间网络结构的总体特征、节点特征及差异特征,提出镇村社区空间网络的优化策略。研究表明：镇村社区空间网络总体处于低水平、非均衡的发展阶段,网络兼具整体松散性与局部集聚性,且小世界特征较为显著,凝聚子群之间的关联性差异明显;镇村社区空间网络呈现“核心-边缘”的节点结构,核心节点的结构洞优势有待加强;社区居民不同的社会属性对网络结构造成了差异性影响;基于此,拟从节点自身功能完善、节点等级体系构建及节点间经济联系强化等方面,构建“1轴、1心、18点”+“1网、57线”的空间网络化模式,为当前及未来的农村社区建设提供示范。     

An Indoor Routing Algorithm for the Blind: Development and Comparison to a Routing Algorithm for the Sighted

This paper presents a prototypical implementation of a non‐network‐based indoor routing algorithm for the sighted and the blind. The spatial abilities of the visually impaired are discussed. Former approaches of outdoor navigation systems for the blind are analyzed and deemed inappropriate for the purpose of modeling indoor navigation. The proposed routing algorithm for the blind calculates routes based on physical characteristics of traveling with a long cane. The algorithm distinguishes between clues, landmarks, obstacles, and hazards along the feasible paths and selects the optimal route by trading off distance and the number of landmarks and clues along a route. Subsequently, the routes for the blind are compared to routes calculated by the routing algorithm for the sighted. The paper asserts that the proposed indoor routing algorithm leads to more suitable routes for the blind.     

Improving the performance of genetic algorithms for land-use allocation problems

Multi-objective optimization can be used to solve land-use allocation problems involving multiple conflicting objectives. In this paper, we show how genetic algorithms can be improved in order to effectively and efficiently solve multi-objective land-use allocation problems. Our focus lies on improving crossover and mutation operators of the genetic algorithms. We tested a range of different approaches either based on the literature or proposed for the first time. We applied them to a land-use allocation problem in Switzerland including two conflicting objectives: ensuring compact urban development and reducing the loss of agricultural productivity. We compared all approaches by calculating hypervolumes and by analysing the spread of the produced non-dominated fronts. Our results suggest that a combination of different mutation operators, of which at least one includes spatial heuristics, can help to find well-distributed fronts of non-dominated solutions. The tested modified crossover operators did not significantly improve the results. These findings provide a benchmark for multi-objective optimization of land-use allocation problems with promising prospectives for solving complex spatial planning problems.     

绿色发展背景下长江经济带产业结构优化升级的地区差异及空间收敛性

基于产业结构高度化和产业结构合理化两个指标,借助重心模型、Dagum基尼系数、空间收敛方法,分析2000—2017年长江经济带产业结构优化升级的地区差异和空间收敛性。研究发现：①长江经济带产业结构优化升级呈现显著的空间非均衡性,东西方向的非均衡性大于南北方向;长江经济带产业结构优化升级水平呈现东-中-西梯度式递减格局,东、中、西部地区均呈现“中心-外围”空间分布特征;②长江经济带产业结构高度化的总体差异不断减小,产业结构合理化的总体差异呈波动扩大趋势,产业结构优化升级的地区间差异是总体差异的第一来源;③长江经济带产业结构高度化存在σ收敛、β收敛和俱乐部收敛,产业结构合理化存在β收敛和俱乐部收敛;④收敛影响因素存在差异性,人力资本和市场规模对促进长江经济带整体、东部和西部地区产业结构优化升级的收敛具有促进作用,政府干预对产业结构优化升级的收敛具有抑制作用。     

Evaluation,simulation, and optimization of land use spatial patterns for high-quality development: A case study of Zhengzhou city,China

Journal of Geographical Sciences - High-intensity land use and resource overloaded-induced regional land use spatial pattern (LUSP) are essential and challenging for high-quality development. The...     

An Interdisciplinary Methodology for the Characterization and Visualization of the Heritage of Roadway Corridors

Roads, particularly since the advent of motorized traffic, have hugely impacted contemporary landscapes. Although their significance was noted in the 1980s, specific roadway‐heritage studies are scarce. Research in different disciplines has identified certain features of roads, but an integrated approach to roadway heritage or a consensus on what this constitutes are lacking. This article proposes an interdisciplinary methodology to assess roadway heritage. Roadways are interpreted within the framework of semantic openness that currently characterizes heritage studies, territory being the basic element of interpretation. Rather than a fragmented approach to conservation, the research defines integrated heritage configurations where natural, cultural, and historical features combine to produce a cohesive form of heritage. GIS (Geographical information systems) technology is used with an online database to assess the complexity of roadway heritage. ICT (Information and communications technology) strategies to raise public awareness are outlined. The methodology is applied to assess the historical N‐340 Mediterranean roadway corridor in Spain.     

An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (Quasi-TSP)

Traveling salesman problem (TSP) and its quasi problem (Quasi-TSP) are typical problems in path optimization, and ant colony optimization (ACO) algorithm is considered as an effective way to solve TSP. However, when the problems come to high dimensions, the classic algorithm works with low efficiency and accuracy, and usually cannot obtain an ideal solution. To overcome the shortcoming of the classic algorithm, this paper proposes an improved ant colony optimization (I-ACO) algorithm which combines swarm intelligence with local search to improve the efficiency and accuracy of the algorithm. Experiments are carried out to verify the availability and analyze the performance of I-ACO algorithm, which cites a Quasi-TSP based on a practical problem in a tourist area. The results illustrate the higher accuracy and efficiency of the I-ACO algorithm to solve Quasi-TSP, comparing with greedy algorithm, simulated annealing, classic ant colony algorithm and particle swarm optimization algorithm, and prove that the I-ACO algorithm is a positive effective way to tackle Quasi-TSP.     

A stratified optimization method for a multivariate marine environmental monitoring network in the Yangtze River estuary and its adjacent sea

An efficient monitoring network is very important in accessing the marine environmental quality and its protection and management. In an estuary, there are fronts that separate distinctly different water masses and affect material transport, nutrient distribution, pollutant aggregation, and diffusion. This stratified heterogeneous surface neither satisfies the stationary requirements of kriging, nor can be handled adequately by removing a spatially continuous trend. This article presents a stratified optimization method for a multivariate monitoring network. In this method, principal component analysis (PCA) was used to reduce the dimensionality of the correlated targets, and the mean of surface with nonhomogeneity (MSN) method was adopted to produce the best linear unbiased estimator for a spatially stratified heterogeneous surface that failed to satisfy the requirements for a kriging estimate. The existing monitoring network in the Yangtze River estuary and its adjacent sea, which was designed by purposive sampling year ago was optimized as an illustration. The optimization consisted of two steps: reduce the redundant monitoring sites and then optimally add new sites to the remaining sites. After optimization, the inclusion of 51 sites in the monitoring network was found to produce a smaller total estimated error than that of the current network, which has 70 sites; moreover, the use of 55 sites can produce a higher precision of estimation for all three principal components (PCs) than that of the current 70 sites. The results demonstrated that the proposed method is suitable for optimizing environmental monitoring sites that have dominant stratified nonhomogeneity and that involve multiple factors.