The shortest path problem is a classical network problem that has been extensively studied. The problem of determining not only the shortest path, but also listing the K shortest paths (for a given… (More)

Yen's algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this paper an implementation of Yen's algorithm is presented. Although with… (More)

The quickest path problem arises when transmitting a given amount of data between two given nodes of a network, a lead time and a capacity (per unit of time) being assigned to each arc in the… (More)

The multiobjective shortest path problem (MSPP) consists of finding the best nondominated path linking two specified nodes in a network where k > 1 different criteria are considered for the arc… (More)

Let G(N, A) be a finite directed network where N= { 1, . . . , n} is the set of nodes and A c ((i, j) 1 i#j and i, je N) is the set of arcs. Each arc (i j) E A is assigned a cost cjj and a capacity… (More)

This paper presents a new algorithm to compute the set of Pareto solutions in the multiobjective shortest path problem. The main idea consists of ranking lexicographic shortest paths using the… (More)