Evaluating road selectivity of urban-trip based on dynamic betweenness centrality

Improving both of the efficiency and reasonableness of path query are the key aspects in public travel information service research. Hierarchical spatial reasoning can solve the efficiency problem, but it cannot guarantee the reasonableness. As we know, road travel efficiency varies at different positions in the urban road network and the reasonableness of path query has close relation to the road selectivity. Since static road evaluation methods used in the past are not suitable in public travel information service, we propose an approach to evaluate road selectivity based on the betweenness centrality calculation in graph theory. By using this approach, we estimate the urban road travel efficiency in dynamic urban road environment that can reveal the traffic smoothness and connectivity at different time windows. The empirical results show that this approach can overcome the limitation caused by data boundaries. Besides, the hierarchical characteristics presented by selectivity evaluation results can be used as a hierarchical criterion in the hierarchical spatial reasoning (HSR) algorithm to improve the reasonableness of the path query result.