loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Anabela Moreira Bernardino 1 ; Eugénia Moreira Bernardino 1 ; Juan Manuel Sánchez-Pérez 2 ; Juan Antonio Gómez-Pulido 2 and Miguel Angel Vega-Rodríguez 2

Affiliations: 1 Polytechnic Institute of Leiria, Portugal ; 2 University of Extremadura, Spain

ISBN: 978-989-8425-31-7

Keyword(s): Communication Networks, Weighted Ring Arc-Loading Problem, Scatter Search Algorithm, Bio-inspired Algorithms.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Bio-inspired Hardware and Networks ; Co-Evolution and Collective Behavior ; Computational Intelligence ; Evolutionary Computing ; Genetic Algorithms ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing ; Swarm/Collective Intelligence

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. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.210.23.15

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Moreira Bernardino, A.; Moreira Bernardino, E.; Manuel Sánchez-Pérez, J.; Antonio Gómez-Pulido, J. and Angel Vega-Rodríguez, M. (2010). SOLVING THE RING ARC-LOADING PROBLEM USING A HYBRID SCATTER SEARCH ALGORITHM.In Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010) ISBN 978-989-8425-31-7, pages 60-69. DOI: 10.5220/0003076200600069

@conference{icec10,
author={Anabela Moreira Bernardino. and Eugénia Moreira Bernardino. and Juan Manuel Sánchez{-}Pérez. and Juan Antonio Gómez{-}Pulido. and Miguel Angel Vega{-}Rodríguez.},
title={SOLVING THE RING ARC-LOADING PROBLEM USING A HYBRID SCATTER SEARCH ALGORITHM},
booktitle={Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)},
year={2010},
pages={60-69},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003076200600069},
isbn={978-989-8425-31-7},
}

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation - Volume 1: ICEC, (IJCCI 2010)
TI - SOLVING THE RING ARC-LOADING PROBLEM USING A HYBRID SCATTER SEARCH ALGORITHM
SN - 978-989-8425-31-7
AU - Moreira Bernardino, A.
AU - Moreira Bernardino, E.
AU - Manuel Sánchez-Pérez, J.
AU - Antonio Gómez-Pulido, J.
AU - Angel Vega-Rodríguez, M.
PY - 2010
SP - 60
EP - 69
DO - 10.5220/0003076200600069

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.