Title of article
The tricriterion shortest path problem with at least two bottleneck objective functions
Author/Authors
Leizer de Lima Pinto، نويسنده , , Cl?udio Thom?s Bornstein، نويسنده , , Nelson Maculan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
387
To page
391
Abstract
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 Pareto-optimal 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.
Keywords
Pareto-optimal solution , Multicriteria shortest path problem
Journal title
European Journal of Operational Research
Serial Year
2009
Journal title
European Journal of Operational Research
Record number
1313911
Link To Document