Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/11301
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Martins, Ernesto Queirós | - |
dc.contributor.author | Paixão, José Manuel | - |
dc.contributor.author | Rosa, Mário Silva | - |
dc.contributor.author | Santos, José Luis | - |
dc.date.accessioned | 2009-09-07T10:08:04Z | - |
dc.date.available | 2009-09-07T10:08:04Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Pré-Publicações DMUC. 07-11 (2007) | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/11301 | - |
dc.description.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. | en_US |
dc.description.sponsorship | FCT, 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.iso | eng | en_US |
dc.publisher | Centro de Matemática da Universidade de Coimbra | en_US |
dc.rights | openAccess | eng |
dc.subject | Multiple objective programming | en_US |
dc.subject | Combinatorial optimization | en_US |
dc.subject | Ranking algorithm | en_US |
dc.subject | Total order | en_US |
dc.subject | Non-dominated path | en_US |
dc.title | Ranking multiobjective shortest paths | en_US |
dc.type | preprint | en_US |
uc.controloAutoridade | Sim | - |
item.fulltext | Com Texto completo | - |
item.openairecristype | http://purl.org/coar/resource_type/c_816b | - |
item.languageiso639-1 | en | - |
item.openairetype | preprint | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
crisitem.author.dept | Faculty of Sciences and Technology | - |
crisitem.author.parentdept | University of Coimbra | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.orcid | 0000-0002-2727-6774 | - |
Aparece nas coleções: | FCTUC Matemática - Vários |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
Ranking multiobjective shortest paths.pdf | 273.77 kB | Adobe PDF | Ver/Abrir |
Visualizações de página 50
544
Visto em 15/out/2024
Downloads
88
Visto em 15/out/2024
Google ScholarTM
Verificar
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.