k-Shortest path algorithms

Bibliographic Details
Main Author: Santos, José Luis
Publication Date: 2007
Format: Other
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://hdl.handle.net/10316/11305
Summary: This paper focuses on algorithms to solve the k-shortest path problem. Three codes are described and compared on random generated and real-world networks. One million paths were ranked in less than 3 seconds (3 microseconds per path), with at most 1 second of preprocessing, on random generated networks with 10 000 nodes. For real-world instances with more than one million nodes, the preprocessing time rises up to 2,7 hours and the CPU time to rank one million paths is less than 30 seconds (30 microseconds per path).
id RCAP_7dec8fb5fd7502bed4fb38ca2836e21d
oai_identifier_str oai:estudogeral.uc.pt:10316/11305
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 k-Shortest path algorithmsShortest pathRanking pathDeviation pathThis paper focuses on algorithms to solve the k-shortest path problem. Three codes are described and compared on random generated and real-world networks. One million paths were ranked in less than 3 seconds (3 microseconds per path), with at most 1 second of preprocessing, on random generated networks with 10 000 nodes. For real-world instances with more than one million nodes, the preprocessing time rises up to 2,7 hours and the CPU time to rank one million paths is less than 30 seconds (30 microseconds per path).Centro de Matemática da Universidade de CoimbraCentro de Matemática da Universidade de Coimbra2007info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/otherhttps://hdl.handle.net/10316/11305https://hdl.handle.net/10316/11305engPré-Publicações DMUC. 07-07 (2007)Santos, 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:RCAAP2020-05-25T13:11:51Zoai:estudogeral.uc.pt:10316/11305Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T05:23:21.172894Repositó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 k-Shortest path algorithms
title k-Shortest path algorithms
spellingShingle k-Shortest path algorithms
Santos, José Luis
Shortest path
Ranking path
Deviation path
title_short k-Shortest path algorithms
title_full k-Shortest path algorithms
title_fullStr k-Shortest path algorithms
title_full_unstemmed k-Shortest path algorithms
title_sort k-Shortest path algorithms
author Santos, José Luis
author_facet Santos, José Luis
author_role author
dc.contributor.author.fl_str_mv Santos, José Luis
dc.subject.por.fl_str_mv Shortest path
Ranking path
Deviation path
topic Shortest path
Ranking path
Deviation path
description This paper focuses on algorithms to solve the k-shortest path problem. Three codes are described and compared on random generated and real-world networks. One million paths were ranked in less than 3 seconds (3 microseconds per path), with at most 1 second of preprocessing, on random generated networks with 10 000 nodes. For real-world instances with more than one million nodes, the preprocessing time rises up to 2,7 hours and the CPU time to rank one million paths is less than 30 seconds (30 microseconds per path).
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/11305
https://hdl.handle.net/10316/11305
url https://hdl.handle.net/10316/11305
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Pré-Publicações DMUC. 07-07 (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_ 1833602338976169984

Similar Items