A Neural Network for Shortest Path Computation

Detalhes bibliográficos
Autor(a) principal: Araújo, Filipe
Data de Publicação: 2000
Outros Autores: Ribeiro, Bernardete, Rodrigues, Luís
Tipo de documento: Relatório
Idioma: por
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10451/14147
Resumo: This paper presents a new neural network to solve the shortest path problem for internetwork routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations of previous solutions, in particular the lack of reliability in what concerns succeeded and valid convergence. Experimental results show that a clear improvement in well-succeeded convergence can be achieved. Additionally, computation performance is also improved at the expense of slightly worse results
id RCAP_845d1f462ef661a3251acde36b33b930
oai_identifier_str oai:repositorio.ul.pt:10451/14147
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A Neural Network for Shortest Path ComputationNeural NetworksCombinatorial Optimization ProblemsShortest Path ProblemHopfield Neural NetworksThis paper presents a new neural network to solve the shortest path problem for internetwork routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations of previous solutions, in particular the lack of reliability in what concerns succeeded and valid convergence. Experimental results show that a clear improvement in well-succeeded convergence can be achieved. Additionally, computation performance is also improved at the expense of slightly worse resultsDepartment of Informatics, University of LisbonRepositório da Universidade de LisboaAraújo, FilipeRibeiro, BernardeteRodrigues, Luís2009-02-10T13:12:02Z2000-042000-04-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportapplication/pdfhttp://hdl.handle.net/10451/14147porinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-08T15:59:47Zoai:repositorio.ul.pt:10451/14147Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:35:59.531826Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A Neural Network for Shortest Path Computation
title A Neural Network for Shortest Path Computation
spellingShingle A Neural Network for Shortest Path Computation
Araújo, Filipe
Neural Networks
Combinatorial Optimization Problems
Shortest Path Problem
Hopfield Neural Networks
title_short A Neural Network for Shortest Path Computation
title_full A Neural Network for Shortest Path Computation
title_fullStr A Neural Network for Shortest Path Computation
title_full_unstemmed A Neural Network for Shortest Path Computation
title_sort A Neural Network for Shortest Path Computation
author Araújo, Filipe
author_facet Araújo, Filipe
Ribeiro, Bernardete
Rodrigues, Luís
author_role author
author2 Ribeiro, Bernardete
Rodrigues, Luís
author2_role author
author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Araújo, Filipe
Ribeiro, Bernardete
Rodrigues, Luís
dc.subject.por.fl_str_mv Neural Networks
Combinatorial Optimization Problems
Shortest Path Problem
Hopfield Neural Networks
topic Neural Networks
Combinatorial Optimization Problems
Shortest Path Problem
Hopfield Neural Networks
description This paper presents a new neural network to solve the shortest path problem for internetwork routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations of previous solutions, in particular the lack of reliability in what concerns succeeded and valid convergence. Experimental results show that a clear improvement in well-succeeded convergence can be achieved. Additionally, computation performance is also improved at the expense of slightly worse results
publishDate 2000
dc.date.none.fl_str_mv 2000-04
2000-04-01T00:00:00Z
2009-02-10T13:12:02Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/report
format report
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10451/14147
url http://hdl.handle.net/10451/14147
dc.language.iso.fl_str_mv por
language por
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Department of Informatics, University of Lisbon
publisher.none.fl_str_mv Department of Informatics, University of Lisbon
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799134258559713280

Registros relacionados