Study on Multi-path Optimization Routing Algorithm in Traffic Network

Jidong Wang · Journal of Highway and Transportation Research and Development · 2007

The traditional multi-shortest path algorithms are based on a mathematical perspective,and alternate routes have very similarity.On the basis of several definitions,a multiple path selection algorithm based on overlapping penalty is proposed,overlapping penalty function and route similarity evaluating function are designed,harmony factor sensitivity are analysed and suitable harmony factor value is presented.Experiment results show that the proposed,algorithm solves candidate route overlapping effectively,while average total travel time ratio does not change.It satisfies driver's routing path demand and obviously superior to traditional k-shortest path algorithms by comparing to experimental data.

Read the paper · More papers on PaperTik