The quickest path problem with interval lead times

Authors:
Herminia I. Calvete
Affiliations:
Dpto. de Métodos Estadísticos, Edificio B, Universidad de Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain
Venue:
Computers and Operations Research
Year:
2004

Citing 5
Cited 0

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
An algorithm for finding the k quickest paths in a network

Computers and Operations Research
Algorithms for the constrained quickest path problem and the enumeration of quickest paths

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.