Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorMartins, Ernesto Queirós-
dc.contributor.authorPaixão, José Manuel-
dc.contributor.authorRosa, Mário Silva-
dc.contributor.authorSantos, José Luis-
dc.identifier.citationPré-Publicações DMUC. 07-11 (2007)en_US
dc.description.abstractThis 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.en_US
dc.description.sponsorshipFCT, POCTI - Research Units Pluriannual Funding to Centro de Matemática da Universidade de Coimbra, CIO (Operations Research Center of the University of Lisbon); POCTI/MAT/139/2001 cofunded by the EU program FEDER.en_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.subjectMultiple objective programmingen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectRanking algorithmen_US
dc.subjectTotal orderen_US
dc.subjectNon-dominated pathen_US
dc.titleRanking multiobjective shortest pathsen_US
item.fulltextCom Texto completo-
item.languageiso639-1en- de Ciências e Tecnologia, Universidade de Coimbra- de Coimbra- for Mathematics, University of Coimbra-
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 simple item record

Page view(s) 50

checked on Jan 20, 2020


checked on Jan 20, 2020

Google ScholarTM


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