Given a network with time windows, the objective of this paper is to find the first K shortest looping paths that include waiting time. Waiting time occurs in a TCSPP but is largely ignored in the literature. To know why we consider waiting time, consider a path route (s,A,D,d) shown in Fig. 1 [7], where the number on an arc is the travel time and nodes are associated with sets of windows. Without considering waiting time, the total time of this path route is 10 because we reach and leave a node at the same time. If the waiting time is involved, however, two situations occur. First, we have to wait for the next available window if the arrival time is not within a window. Second, if the arrival time is within a window, we have two choices: (1) leave immediately, or (2) wait. Under normal conditions, we will eventually leave a node after a certain number of windows