Please use this identifier to cite or link to this item:
Title: Ranking multiobjective shortest paths
Authors: Martins, Ernesto Queirós 
Paixão, José Manuel 
Rosa, Mário Silva 
Santos, José Luis 
Keywords: Multiple objective programming; Combinatorial optimization; Ranking algorithm; Total order; Non-dominated path
Issue Date: 2007
Publisher: Centro de Matemática da Universidade de Coimbra
Citation: Pré-Publicações DMUC. 07-11 (2007)
Abstract: This paper is concerned with the ranking of multi-objective shortest paths accordingly to an order relation verifying certain conditions such is the case, for instance, of the lexicographic order. We present a new labelling algorithm that makes use of shortest deviation paths for obtaining the set of Pareto solutions for the multi-objective shortest path problem. The computational experience reported at the end of the paper shows that the new algorithm clearly outperforms the previous approaches when one looks for the `-th shortest non-dominated paths.
Rights: openAccess
Appears in Collections:FCTUC Matemática - Vários

Files in This Item:
File Description SizeFormat
Ranking multiobjective shortest paths.pdf273.77 kBAdobe PDFView/Open
Show full item record

Page view(s) 50

checked on Aug 11, 2022


checked on Aug 11, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.