Loading...
Publication
GRASP and grid computing to solve the location area problem
| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| In this paper we present a new approach based on the GRASP (Greedy Randomized Adaptive Search Procedure) metaheuristic to solve the Location Area (LA) problem over a grid computing environment. All the experiments carried out to complete this study were executed in a real grid environment provided by a virtual organization of the European project EGEE. These experiments were divided into sequential and parallel executions with the intention of analyzing the behavior of the different variants of GRASP when applied to the LA problem. We have used four distinct test networks and also decided to compare the results obtained by this new approach with those achieved through other algorithms from our previous work and also by other authors. The experimental results show that this GRASP based approach is very encouraging because, with the grid computing, the execution time is much more reduced and the results obtained are very similar to those of other techniques proposed in the literature. | 1.42 MB | Adobe PDF |
Advisor(s)
Abstract(s)
In this paper we present a new approach based on the GRASP (Greedy Randomized Adaptive Search Procedure) metaheuristic to solve the Location Area (LA) problem over a grid computing environment. All the experiments carried out to complete this study were executed in a real grid environment provided by a virtual organization of the European project EGEE. These experiments were divided into sequential and parallel executions with the intention of analyzing the behavior of the different variants of GRASP when applied to the LA problem. We have used four distinct test networks and also decided to compare the results obtained by this new approach with those achieved through other algorithms from our previous work and also by other authors. The experimental results show that this GRASP based approach is very encouraging because, with the grid computing, the execution time is much more reduced and the results obtained are very similar to those of other techniques proposed in the literature.
Description
Article number 5393648 - 2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009, 9 December 2009 through 11 December 2009 - Code 79534
Keywords
location area problem location management GRASP algorithm evolutionary algorithms grid computing
Pedagogical Context
Citation
S. M. Almeida-Luz, M. M. Rodríguez-Hermoso, M. A. Vega-Rodríguez, J. A. Gómez-Pulido and J. M. Sánchez-Pérez, "GRASP and grid computing to solve the location area problem," 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), Coimbatore, India, 2009, pp. 164-169, doi: https://doi.org/10.1109/NABIC.2009.5393648.
Publisher
IEEE Canada
CC License
Without CC licence