A method for finding K best different paths in traffic assignment model

In real-world transportation network, the K shortest paths between a pair of nodes on a network will often be slight variations of one another. This could be a serious problem for the path-based models, particularly those on capacitated network. It is very necessary for finding less likely paths that can...