Ranking multiobjective shortest paths

Bibliographic Details
Main Author: Martins, Ernesto Queirós
Publication Date: 2007
Other Authors: Paixão, José Manuel, Rosa, Mário Silva, Santos, José Luis
Format: Other
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://hdl.handle.net/10316/11301
Summary: 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.
id RCAP_3ebe126fddfefb26feca4b6828f552d2
oai_identifier_str oai:estudogeral.uc.pt:10316/11301
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Ranking multiobjective shortest pathsMultiple objective programmingCombinatorial optimizationRanking algorithmTotal orderNon-dominated pathThis 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.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.Centro de Matemática da Universidade de Coimbra2007info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/otherhttps://hdl.handle.net/10316/11301https://hdl.handle.net/10316/11301engPré-Publicações DMUC. 07-11 (2007)Martins, Ernesto QueirósPaixão, José ManuelRosa, Mário SilvaSantos, José Luisinfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2021-10-20T14:54:52Zoai:estudogeral.uc.pt:10316/11301Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T05:23:21.029744Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Ranking multiobjective shortest paths
title Ranking multiobjective shortest paths
spellingShingle Ranking multiobjective shortest paths
Martins, Ernesto Queirós
Multiple objective programming
Combinatorial optimization
Ranking algorithm
Total order
Non-dominated path
title_short Ranking multiobjective shortest paths
title_full Ranking multiobjective shortest paths
title_fullStr Ranking multiobjective shortest paths
title_full_unstemmed Ranking multiobjective shortest paths
title_sort Ranking multiobjective shortest paths
author Martins, Ernesto Queirós
author_facet Martins, Ernesto Queirós
Paixão, José Manuel
Rosa, Mário Silva
Santos, José Luis
author_role author
author2 Paixão, José Manuel
Rosa, Mário Silva
Santos, José Luis
author2_role author
author
author
dc.contributor.author.fl_str_mv Martins, Ernesto Queirós
Paixão, José Manuel
Rosa, Mário Silva
Santos, José Luis
dc.subject.por.fl_str_mv Multiple objective programming
Combinatorial optimization
Ranking algorithm
Total order
Non-dominated path
topic Multiple objective programming
Combinatorial optimization
Ranking algorithm
Total order
Non-dominated path
description 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.
publishDate 2007
dc.date.none.fl_str_mv 2007
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/other
format other
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/10316/11301
https://hdl.handle.net/10316/11301
url https://hdl.handle.net/10316/11301
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Pré-Publicações DMUC. 07-11 (2007)
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Centro de Matemática da Universidade de Coimbra
publisher.none.fl_str_mv Centro de Matemática da Universidade de Coimbra
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833602338973024256

Similar Items