Publicação
Solving the ring arc-loading problem using a hybrid scatter search algorithm
| datacite.subject.fos | Ciências Naturais::Ciências da Computação e da Informação | |
| datacite.subject.fos | Ciências Naturais::Matemáticas | |
| datacite.subject.sdg | 08:Trabalho Digno e Crescimento Económico | |
| datacite.subject.sdg | 09:Indústria, Inovação e Infraestruturas | |
| datacite.subject.sdg | 10:Reduzir as Desigualdades | |
| dc.contributor.author | Bernardino, Anabela Moreira | |
| dc.contributor.author | Bernardino, Eugénia Moreira | |
| dc.contributor.author | Sánchez-Pérez, Juan Manuel | |
| dc.contributor.author | Gómez-Pulido, Juan Antonio | |
| dc.contributor.author | Vega-Rodríguez, Miguel Angel | |
| dc.date.accessioned | 2025-10-31T18:00:38Z | |
| dc.date.available | 2025-10-31T18:00:38Z | |
| dc.date.issued | 2010 | |
| dc.description | Conference name - International Conference on Evolutionary Computation, ICEC 2010; Conference date - 24 October 2010 - 26 October 2010; Conference code - 83493 | |
| dc.description | Fontes: 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.abstract | 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. | eng |
| dc.identifier.citation | Bernardino, 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.doi | 10.5220/0003076200600069 | |
| dc.identifier.isbn | 978-989-8425-31-7 | |
| dc.identifier.uri | http://hdl.handle.net/10400.8/14455 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | |
| dc.publisher | SciTePress - Science and Technology Publications | |
| dc.relation.hasversion | https://ecta.scitevents.org/ICEC2010/home.asp | |
| dc.relation.ispartof | Proceedings of the International Conference on Evolutionary Computation | |
| dc.rights.uri | N/A | |
| dc.subject | Communication Networks | |
| dc.subject | Weighted Ring Arc-Loading Problem | |
| dc.subject | Scatter Search Algorithm | |
| dc.subject | Bio-inspired Algorithms | |
| dc.title | Solving the ring arc-loading problem using a hybrid scatter search algorithm | eng |
| dc.type | conference paper | |
| dspace.entity.type | Publication | |
| oaire.citation.conferenceDate | 2010-10 | |
| oaire.citation.conferencePlace | Valencia, Spain | |
| oaire.citation.endPage | 69 | |
| oaire.citation.startPage | 60 | |
| oaire.citation.title | ICEC 2010 - Proceedings of the International Conference on Evolutionary Computation | |
| oaire.version | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |
| person.familyName | Moreira Bernardino | |
| person.familyName | Bernardino | |
| person.givenName | Anabela | |
| person.givenName | Eugénia | |
| person.identifier.ciencia-id | 081E-F3B8-316A | |
| person.identifier.ciencia-id | 9616-F1BC-D8BD | |
| person.identifier.orcid | 0000-0002-6561-5730 | |
| person.identifier.orcid | 0000-0001-5301-5853 | |
| person.identifier.scopus-author-id | 24402754700 | |
| relation.isAuthorOfPublication | 375ebe15-f84c-46a4-a3d9-6e4935a92187 | |
| relation.isAuthorOfPublication | 893cf15c-eff8-4e43-949c-c1de6eb87599 | |
| relation.isAuthorOfPublication.latestForDiscovery | 375ebe15-f84c-46a4-a3d9-6e4935a92187 |
Ficheiros
Principais
1 - 1 de 1
A carregar...
- 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
1 - 1 de 1
Miniatura indisponível
- Nome:
- license.txt
- Tamanho:
- 1.32 KB
- Formato:
- Item-specific license agreed upon to submission
- Descrição:
