Abstract: This study considers a k-objective time-varying shortest path problem, which cannot be combined into a single overall objective. In this problem, the transit cost to traverse an arc is varying over time, which depend upon the departure time at the beginning vertex of the arc. An algorithm is presented for finding the efficient solutions of problem and its complexity of algorithm is analyzed. Finally, an illustrative example is also provided to clarify the problem.