Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/11301
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.date.accessioned2009-09-07T10:08:04Z-
dc.date.available2009-09-07T10:08:04Z-
dc.date.issued2007-
dc.identifier.citationPré-Publicações DMUC. 07-11 (2007)en_US
dc.identifier.urihttps://hdl.handle.net/10316/11301-
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.language.isoengen_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.rightsopenAccesseng
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
dc.typepreprinten_US
uc.controloAutoridadeSim-
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairetypepreprint-
item.openairecristypehttp://purl.org/coar/resource_type/c_816b-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.orcid0000-0002-2727-6774-
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

Google ScholarTM

Check


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