Study and Realization of GIS-based Multitask Path Optimization Algorithm
Min Ou · Jisuanji fangzhen · 2006
The study of the shortest path algorithm is the hinge of spatial network analysis in GIS. The traditional path algorithms are all for single object. There’re few studies about GIS-based multitask path optimization algorithm now. After introduction of the single-object Dijkstra algorithm, some practical projects were put forward to solve the conflict in multitask path optimization, for example: waiting or waiting combined with path reelect. Some instance on the platform of GIS shows that the algorithm is reasonable and feasible.