Learn More
Previous studies have demonstrated that non-Euclidean distance metrics can improve model fit in the geographically weighted regression (GWR) model. However, the GWR model often considers spatial nonstationarity and does not address variations in local temporal issues. Therefore, this paper explores a geographically temporal weighted regression (GTWR)(More)
This paper describes the concept of address elements and proposes a fuzzy Chinese-geocoding method via using fuzzy mathematics principle. The segmentation accuracy is improved by employed elements identification mechanism techniques, moreover, the best matching result is derived by calculating the MI indicator. The simulation error related to re-matched(More)
Rational development and utilization of water resources in the Qaidam Basin is the most important prerequisite to realize the goal of the regional econony's sustainable development. This paper takes the Qaidam Basin for example, studies the water points coverage by GIS spatial analysis. The water resources optimal allocation model in the Qaidam Basin is(More)
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on(More)
To capture both global stationarity and spatiotemporal non-stationarity, a novel mixed geographically and temporally weighted regression (MGTWR) model accounting for global and local effects in both space and time is presented. Since the constant and spatial-temporal varying coefficients could not be estimated in one step, a two-stage least squares(More)
  • Shruti Pant, Pooja Khulbe, +13 authors Min Shi
  • 2014
Finding the shortest path in a graph means selecting the path between source and destination which gives the minimum path length. This problem of finding the shortest path can be solved using Dijkstra algorithm. The time complexity of Dijkstra algorithm is high. Looking at the shortcoming of traditional Dijkstra algorithm, this paper has proposed a new(More)
  • 1