Hybrid Diversified Routing System

The diversified route planning finds multiple paths that are sufficiently different from each other while as short as possible. It is of great significance to traffic alleviation through provided alternative routes during navigation. However, it is NP-H to find the optimal result and the existing solutions have either high quality (exact path enumeration-based) or high efficiency (alternative path), which is highly affected by the network properties and query parameters but has never been investigated before. Therefore, this paper proposes a hybrid diversified routing system that can handle any query efficiently with quality as high as possible. Specifically, we first analyze the path enumeration problem from the ground up and unify all the existing algorithms theoretically to identify the factors that affect algorithm performance. After that, we review and select the alternative path methods to identify the suitable ones for our system. Finally, we propose a query classification module to estimate the hardness of a query and determine how it should be processed. Extensive experiments on real-life networks validate the effectiveness and efficiency of our hybrid system compared with state-of-the-art solutions.