The quickest path problem with interval lead times

In this paper, a version of the quickest path problem is considered in which arc capacities are fixed but lead times are expressed as intervals on real line. By considering order relations that represent the decision makerʹs preference between interval transmission times, we show that the problem can be solved by transforming it into a sequence of bicriteria shortest path problems in properly defined networks.