Comparison of Variants of Yen's Algorithm for Finding K-Simple Shortest Paths

In directed and weighted graph, with n nodes and m edges, the K-shortest paths problem involve finding a set of k shortest paths between a defined source and destination pair where the first path is shortest, and the remaining k-1 paths are in increasing lengths. In K-shortest path problem there are two classes, k shortest simple path problem and k shortest non-simple path problem. The first algorithm to solve K shortest simple path problems is Yen's algorithm based on deviation path concept. Later many variants of Yen's algorithm are proposed with improved computational performance. In this paper some of the variants of Yen's algorithm for finding top k simple shortest path are studied and compared.