The optimal sequenced path query is a hot topic in the intelligent transportation. In practical applications, the existing approaches cannot effectively solve these constrained path query problems in the time-dependent network because of the constraints of the optimal sequenced path query. This study employs the rules to stand for the constraints. In order to solve the shortest travel time problem of the constrained path in the time-dependent network, a new query form of the optimal sequenced path, namely the multi-rule based shortest path query, is studied. This study provides a unified framework, which includes the path set query and the shortest path query. In order to efficiently retrieve the path set satisfying multiple rules, a new tree traversal method, inheritance and traversal of trees, is proposed on the basis of generalized rule tree. Based on the idea of tree inheritance and traversal, a pruning method is proposed to prune the path set, and finally, the candidate path set is obtained. In the shortest path query part, a dynamic threshold method is proposed. Extensive experiments with two real data offer evidence that the proposed solutions can solve the problem of multi-rule based shortest path query.