Elastic Net Application: Case Study to Find Solutions for the TSP in a Beowulf Cluster Architecture

Simple item page
datacite.alternateIdentifier.citationENGINEERING APPLICATIONS OF NEURAL NETWORKS, EANN 2016,Vol.629,123-133,2016
datacite.alternateIdentifier.doi10.1007/978-3-319-44188-7_9
datacite.creatorLévano Huamaccto, Marcos
datacite.creatorAlbornoz, Andrea
datacite.creatorJayne, C
datacite.creatorIliadis, L
datacite.date2016
datacite.subject.englishElastic net
datacite.subject.englishParallel strategy
datacite.subject.englishInternal energy
datacite.subject.englishTSP
datacite.subject.englishAlgorithm
datacite.titleElastic Net Application: Case Study to Find Solutions for the TSP in a Beowulf Cluster Architecture
dc.date.accessioned2021-04-30T16:30:29Z
dc.date.available2021-04-30T16:30:29Z
dc.description.abstractThis study aims to apply the Durbin-Willshaw elastic net using parallel algorithms in order to solve the Traveling Salesman Problem (TSP) through a Beowulf cluster architecture for High-Performance Computing. The solutions for the TSP for the different number of cities are achieved by the minimization of the internal energy and by the maximization of the entropy in the information system. In this way, approximate solutions to the TSP can be determined. This work proposes a framework to implement a parallel algorithm to the Beowulf cluster. In order to find solutions for the TSP, we worked with 5000 cities with a net of 12500 nodes up to 10000 cities with 25000 nodes.
dc.identifier.urihttp://repositoriodigital.uct.cl/handle/10925/2791
dc.language.isoen
dc.publisherSPRINGER INT PUBLISHING AG
dc.sourceENGINEERING APPLICATIONS OF NEURAL NETWORKS, EANN 2016
oaire.resourceTypeMeeting
uct.catalogadorWOS
uct.indizacionISTP
Files
Collections
Migración Web of Science