Logo do repositório
 
Publicação

Solving the ring arc-loading problem using a hybrid scatter search algorithm

datacite.subject.fosCiências Naturais::Ciências da Computação e da Informação
datacite.subject.fosCiências Naturais::Matemáticas
datacite.subject.sdg08:Trabalho Digno e Crescimento Económico
datacite.subject.sdg09:Indústria, Inovação e Infraestruturas
datacite.subject.sdg10:Reduzir as Desigualdades
dc.contributor.authorBernardino, Anabela Moreira
dc.contributor.authorBernardino, Eugénia Moreira
dc.contributor.authorSánchez-Pérez, Juan Manuel
dc.contributor.authorGómez-Pulido, Juan Antonio
dc.contributor.authorVega-Rodríguez, Miguel Angel
dc.date.accessioned2025-10-31T18:00:38Z
dc.date.available2025-10-31T18:00:38Z
dc.date.issued2010
dc.descriptionConference name - International Conference on Evolutionary Computation, ICEC 2010; Conference date - 24 October 2010 - 26 October 2010; Conference code - 83493
dc.descriptionFontes: https://scholar.google.com/scholar?q=Solving%20the%20ring%20arc-loading%20problem%20using%20a%20hybrid%20scatter%20search%20algorithm https://www.scitepress.org/papers/2010/30762/30762.pdf
dc.description.abstractResilient Packet Ring (RPR) is a standard that uses Ethernet switching and a dual counter-rotating ring topology to provide SONET-like network resiliency and optimised bandwidth usage, while it delivers multipoint Ethernet/IP services. An important optimisation problem arising in this context is the Weighted Ring Arc Loading Problem (WRALP). That is the design of a direct path for each request in a communication network, in such a way that high load on the arcs will be avoided, where an arc is an edge endowed with a direction. The load of an arc is defined as the total weight of those requests routed through the arc in its direction. WRALP ask for a routing scheme such that the maximum load on the arcs will be minimum. In this paper we study the loading problem without demand splitting and for solving it we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to WRALP instances, improving the results obtained by previous approaches.eng
dc.identifier.citationBernardino, A. M., Bernardino, E. M., Sánchez-Pérez, J. M., Pulido, J. A. G., & Rodríguez, M. Á. V. (2010). Solving the Ring Arc-Loading Problem using a Hybrid Scatter Search Algorithm. In IJCCI (ICEC) (pp. 60-69). DOI: https://doi.org/10.5220/0003076200600069.
dc.identifier.doi10.5220/0003076200600069
dc.identifier.isbn978-989-8425-31-7
dc.identifier.urihttp://hdl.handle.net/10400.8/14455
dc.language.isoeng
dc.peerreviewedyes
dc.publisherSciTePress - Science and Technology Publications
dc.relation.hasversionhttps://ecta.scitevents.org/ICEC2010/home.asp
dc.relation.ispartofProceedings of the International Conference on Evolutionary Computation
dc.rights.uriN/A
dc.subjectCommunication Networks
dc.subjectWeighted Ring Arc-Loading Problem
dc.subjectScatter Search Algorithm
dc.subjectBio-inspired Algorithms
dc.titleSolving the ring arc-loading problem using a hybrid scatter search algorithmeng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2010-10
oaire.citation.conferencePlaceValencia, Spain
oaire.citation.endPage69
oaire.citation.startPage60
oaire.citation.titleICEC 2010 - Proceedings of the International Conference on Evolutionary Computation
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameMoreira Bernardino
person.familyNameBernardino
person.givenNameAnabela
person.givenNameEugénia
person.identifier.ciencia-id081E-F3B8-316A
person.identifier.ciencia-id9616-F1BC-D8BD
person.identifier.orcid0000-0002-6561-5730
person.identifier.orcid0000-0001-5301-5853
person.identifier.scopus-author-id24402754700
relation.isAuthorOfPublication375ebe15-f84c-46a4-a3d9-6e4935a92187
relation.isAuthorOfPublication893cf15c-eff8-4e43-949c-c1de6eb87599
relation.isAuthorOfPublication.latestForDiscovery375ebe15-f84c-46a4-a3d9-6e4935a92187

Ficheiros

Principais
A mostrar 1 - 1 de 1
A carregar...
Miniatura
Nome:
Solving the ring arc-loading problem using a hybrid scatter search algorithm.pdf
Tamanho:
756.69 KB
Formato:
Adobe Portable Document Format
Descrição:
Resilient Packet Ring (RPR) is a standard that uses Ethernet switching and a dual counter-rotating ring topology to provide SONET-like network resiliency and optimised bandwidth usage, while it delivers multipoint Ethernet/IP services. An important optimisation problem arising in this context is the Weighted Ring Arc Loading Problem (WRALP). That is the design of a direct path for each request in a communication network, in such a way that high load on the arcs will be avoided, where an arc is an edge endowed with a direction. The load of an arc is defined as the total weight of those requests routed through the arc in its direction. WRALP ask for a routing scheme such that the maximum load on the arcs will be minimum. In this paper we study the loading problem without demand splitting and for solving it we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to WRALP instances, improving the results obtained by previous approaches.
Licença
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
license.txt
Tamanho:
1.32 KB
Formato:
Item-specific license agreed upon to submission
Descrição: