Overlay analysis is a common task in geographic computing that is widely used in geographic information systems, computer graphics, and computer science. With the breakthroughs in Earth observation technologies, particularly the emergence of high-resolution satellite remote-sensing technology, geographic data have demonstrated explosive growth. The overlay analysis of massive and complex geographic data has become a computationally intensive task. Distributed parallel processing in a cloud environment provides an efficient solution to this problem. The cloud computing paradigm represented by Spark has become the standard for massive data processing in the industry and academia due to its large-scale and low-latency characteristics. The cloud computing paradigm has attracted further attention for the purpose of solving the overlay analysis of massive data. These studies mainly focus on how to implement parallel overlay analysis in a cloud computing paradigm but pay less attention to the impact of spatial data graphics complexity on parallel computing efficiency, especially the data skew caused by the difference in the graphic complexity. Geographic polygons often have complex graphical structures, such as many vertices, composite structures including holes and islands. When the Spark paradigm is used to solve the overlay analysis of massive geographic polygons, its calculation efficiency is closely related to factors such as data organization and algorithm design. Considering the influence of the shape complexity of polygons on the performance of overlay analysis, we design and implement a parallel processing algorithm based on the Spark paradigm in this paper. Based on the analysis of the shape complexity of polygons, the overlay analysis speed is improved via reasonable data partition, distributed spatial index, a minimum boundary rectangular filter and other optimization processes, and the high speed and parallel efficiency are maintained.

Urban transportation is a crucial aspect of modern societal development, with bus route optimization playing a central role in urban transit planning. Well-designed bus routes can enhance the efficiency and attractiveness of public transportation, alleviate traffic congestion and pollution, and ultimately contribute to the overall growth of a city. This study investigates the selection of bus stop locations and route optimization from three perspectives: population density, facility distribution, and route length. Firstly, a scheme for optimizing bus stop locations is proposed based on population grid data, Points of Interest (POI), and road network data. Next, candidate points are generated using the road network, and a new heuristic algorithm is introduced to initially establish optimized routes. A nondominated sorting algorithm is then employed to identify the optimal solution set, balancing population coverage, facility accessibility, and route distance. The proposed method for bus stop location and route optimization is universally applicable to urban bus routes and can be validated through case studies in different cities. Finally, an empirical analysis is conducted using Route 119 in Kunming City, Yunnan Province, as a case study. Compared with the original bus route, the optimized route demonstrates improvements of 18.26% in route distance, 15.79% in Points of Interest (POI) accessibility, and 10.53% in population coverage.

Urban transportation is a crucial aspect of modern societal development, with bus route optimization playing a central role in urban transit planning. Well-designed bus routes can enhance the efficiency and attractiveness of public transportation, alleviate traffic congestion and pollution, and ultimately contribute to the overall growth of a city. This study investigates the selection of bus stop locations and route optimization from three perspectives: population density, facility distribution, and route length. The main methodological contribution lies not in the Pareto filtering itself, but in the development of a unified pipeline. This pipeline first generates and prunes candidate stops by applying road-network and intersection-safety constraints. It then constructs feasible routes using a constraint-driven heuristic that enforces stop spacing, ensures monotonic progress away from the origin and toward the destination, and maintains route smoothness. Finally, it integrates population-grid and POI indicators into a tri-objective evaluation framework prior to non-dominated sorting. The proposed method for bus stop location and route optimization is universally applicable to urban bus routes and can be validated through case studies in different cities. An empirical analysis is conducted using Route 119 in Kunming City, Yunnan Province, as a case study. Compared with the original bus route, the optimized route demonstrates improvements of 18.26% in route distance, 15.79% in Points of Interest (POI) accessibility, and 10.53% in population coverage.