SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY

Detalhes bibliográficos
Autor(a) principal: Ferone,Daniele
Data de Publicação: 2017
Outros Autores: Festa,Paola, Napoletano,Antonio, Pastore,Tommaso
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300487
Resumo: ABSTRACT This paper provides an overview of the state-of-the art and the current research trends concerning shortest paths problem on dynamic graphs. The discussion is divided in two main topics: reoptimization and time-dependent shortest paths. Reoptimization consists in the solution of a sequence of shortest path problems in which each instance slightly differs from the previous one. The reoptimization tackles this problem wisely using information stored in an optimal solution previously computed. On the other hand, shortest path problems on time-dependent graphs are characterized by a weight function which not only depends upon the arcs but changes in time according to a certain time horizon.
id SOBRAPO-1_507b467b4fe0bd1e1ca63208019877fe
oai_identifier_str oai:scielo:S0101-74382017000300487
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEYShortest PathNetwork OptimizationNetwork FlowsStructure path constraintsLabelling methodsAuction MethodABSTRACT This paper provides an overview of the state-of-the art and the current research trends concerning shortest paths problem on dynamic graphs. The discussion is divided in two main topics: reoptimization and time-dependent shortest paths. Reoptimization consists in the solution of a sequence of shortest path problems in which each instance slightly differs from the previous one. The reoptimization tackles this problem wisely using information stored in an optimal solution previously computed. On the other hand, shortest path problems on time-dependent graphs are characterized by a weight function which not only depends upon the arcs but changes in time according to a certain time horizon.Sociedade Brasileira de Pesquisa Operacional2017-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300487Pesquisa Operacional v.37 n.3 2017reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2017.037.03.0487info:eu-repo/semantics/openAccessFerone,DanieleFesta,PaolaNapoletano,AntonioPastore,Tommasoeng2018-03-01T00:00:00Zoai:scielo:S0101-74382017000300487Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2018-03-01T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
title SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
spellingShingle SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
Ferone,Daniele
Shortest Path
Network Optimization
Network Flows
Structure path constraints
Labelling methods
Auction Method
title_short SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
title_full SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
title_fullStr SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
title_full_unstemmed SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
title_sort SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
author Ferone,Daniele
author_facet Ferone,Daniele
Festa,Paola
Napoletano,Antonio
Pastore,Tommaso
author_role author
author2 Festa,Paola
Napoletano,Antonio
Pastore,Tommaso
author2_role author
author
author
dc.contributor.author.fl_str_mv Ferone,Daniele
Festa,Paola
Napoletano,Antonio
Pastore,Tommaso
dc.subject.por.fl_str_mv Shortest Path
Network Optimization
Network Flows
Structure path constraints
Labelling methods
Auction Method
topic Shortest Path
Network Optimization
Network Flows
Structure path constraints
Labelling methods
Auction Method
description ABSTRACT This paper provides an overview of the state-of-the art and the current research trends concerning shortest paths problem on dynamic graphs. The discussion is divided in two main topics: reoptimization and time-dependent shortest paths. Reoptimization consists in the solution of a sequence of shortest path problems in which each instance slightly differs from the previous one. The reoptimization tackles this problem wisely using information stored in an optimal solution previously computed. On the other hand, shortest path problems on time-dependent graphs are characterized by a weight function which not only depends upon the arcs but changes in time according to a certain time horizon.
publishDate 2017
dc.date.none.fl_str_mv 2017-09-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300487
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382017000300487
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/0101-7438.2017.037.03.0487
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.37 n.3 2017
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318018169143296

Registros relacionados