Geometric Algebra-Based Algorithm for Solving Nodes Constrained Shortest Path
Feng Lin-ya · Dianzi xuebao · 2014
Focusing on the solving of the shortest paths in the conditions of complicated constraints for network analysis and application,geometric algebra is used to develop the netw ork analysis algorithms. We built a netw ork model and bilateral search algorithms based on the multivector representation and multidimensional operators of geometric algebra. Then, w e implemented the algorithm by taking the example of finding the shortest paths that pass the specified necessary nodes and the least segments. According to the experiment analysis of the road netw ork data,this algorithm can directly estimate the constrained nodes by applying the outer algorithm and has better versatility and less path traversal times. Moreover,this algorithm has an advantage on many-to-many path solution and multi-user parallel solution.