Loading [a11y]/accessibility-menu.js
An approximate ripple-spreading algorithm to identify the k best paths | IEEE Conference Publication | IEEE Xplore

An approximate ripple-spreading algorithm to identify the k best paths


Abstract:

As a newly reported nature-inspired algorithm, ripple-spreading algorithm (RSA) can resolve the k shortest paths problem (k-SPP) with a guarantee of optimality and a just...Show More

Abstract:

As a newly reported nature-inspired algorithm, ripple-spreading algorithm (RSA) can resolve the k shortest paths problem (k-SPP) with a guarantee of optimality and a just-so-so computational efficiency, given each node can be triggered to produce up to k ripples. This paper reports an approximate RSA by allowing every node to produce no more than h ripples, 1≤h<;k. In this case, the optimality of RSA is no longer guaranteed, while the computational efficiency is largely improved. Thus, by a comprehensive experimental study, this paper attempts to reveal the relationships between the optimality, the computational efficiency and the value of h. In other words, as h decreases, to what extent might the optimality of RSA be degraded, and to what extent might the computational efficiency of RSA be improved? The experimental results show that, by choosing a proper h<;k, it is possible for the approximate RSA to achieve a good tradeoff between the computational efficiency and the optimality i.e., the solutions are still fairly suboptimal while the computational efficiency is significantly improved. Therefore, the approximated RSA has a good potential of applying to large-scale real-world k-SPPs.
Date of Conference: 29-31 July 2017
Date Added to IEEE Xplore: 25 June 2018
ISBN Information:
Conference Location: Guilin, China

References

References is not available for this document.