Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11301
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. | URI: | https://hdl.handle.net/10316/11301 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Vários |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ranking multiobjective shortest paths.pdf | 273.77 kB | Adobe PDF | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.