The tricriterion shortest path problem with at least two bottleneck objective functions
The focus of this paper is on the tricriterion shortest path problem where two objective functions are of the bottleneck type, for example MinMax or MaxMin. The third objective function may be of the same kind or we may consider, for example, MinSum or MaxProd. Let p(n) be the complexity of a classical single objective algorithm responsible for this third function, where n is the number of nodes and m be the number of arcs of the graph. An O(m2p(n)) algorithm is presented that can generate the minimal complete set of Paretooptimal solutions. Finding the maximal complete set is also possible. Optimality proofs are given and extensions for several special cases are presented. Computational experience for a set of randomly generated problems is reported.
Year of publication: 
2009


Authors:  de Lima Pinto, Leizer ; Bornstein, Cláudio Thomás ; Maculan, Nelson 
Published in: 
European Journal of Operational Research.  Elsevier, ISSN 03772217.  Vol. 198.2009, 2, p. 387391

Publisher: 
Elsevier 
Keywords:  Multicriteria shortest path problem Paretooptimal solution 
Saved in favorites
Similar items by person

The tricriterion shortest path problem with at least two bottleneck objective functions
de Lima Pinto, Leizer, (2009)

The one dimensional Compartmentalised Knapsack Problem: A case study
Hoto, Robinson, (2007)

The discretizable molecular distance geometry problem
Lavor, Carlile, (2012)
 More ...