The k shortest paths problem (k-SPP) has a wide application background. Inspired by the natural ripple-spreading phenomenon that occurs on a water surface, we have recently proposed an originalâ€¦ (More)

It is a challenging task to find the k shortest paths in a time-window network, where a node may have some specific time windows only within which is the node accessible. Existing research assumesâ€¦ (More)

This paper is concerned with finding the k shortest routes or paths in a network where each node has some specific time windows only within which is the node accessible. Because of such time windowsâ€¦ (More)

Travelling in adverse weathers is a dynamical path optimization problem (DPO), as weather conditions usually keep changing during the traveling period. A common practice of DPO is to conductâ€¦ (More)

By allowing each node to generate up to h<k ripples, approximate ripple-spreading algorithm (ARSA) can resolve the k shortest paths problem (k-SPP) with a good balance between optimality andâ€¦ (More)

To assess the performance of a network system against disturbances, existing methods are usually concerned with two different extreme situations: (i) how likely the system will degrade into someâ€¦ (More)