Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Hi-index | 0.00 |
Core setting region could facilitate disaster relief and strength communication among setting regions when emergent disaster happens. Shortest path search algorithms could be applied. Dijkstra algorithm is discussed and is improved to solve the confirmation of core setting region. It ensures that the core setting region is the nearest to the farthest region. The improved algorithm turns out to be practical.