Repository logo
 
Publication

GRASP and grid computing to solve the location area problem

dc.contributor.authorAlmeida da Luz, Sónia Maria
dc.contributor.authorRodriguez-Hermoso, Manuel M.
dc.contributor.authorVega-Rodriguez, Miguel A.
dc.contributor.authorGomez-Pulido, Juan A.
dc.contributor.authorSanchez-Perez, Juan M.
dc.date.accessioned2025-06-05T10:05:18Z
dc.date.available2025-06-05T10:05:18Z
dc.date.issued2009-12
dc.descriptionArticle number 5393648 - 2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009, 9 December 2009 through 11 December 2009 - Code 79534
dc.description.abstractIn 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.eng
dc.description.sponsorshipThis work was partially funded by the Spanish Ministry of Science and Innovation and FEDER under the contract TIN2008-06491-C04-04 (the M* project). Thanks also to the CIIC and the Polytechnic Institute of Leiria, for the economic support offered to Sónia M. Almeida-Luz to make this research.
dc.identifier.citationS. 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.
dc.identifier.doi10.1109/nabic.2009.5393648
dc.identifier.isbn978-1-4244-5053-4
dc.identifier.urihttp://hdl.handle.net/10400.8/13118
dc.language.isoeng
dc.peerreviewedyes
dc.publisherIEEE Canada
dc.relationTIN2008-06491-C04-04
dc.relation.hasversionhttps://ieeexplore.ieee.org/document/5393648
dc.relation.ispartof2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)
dc.rights.uriN/A
dc.subjectlocation area problem
dc.subjectlocation management
dc.subjectGRASP algorithm
dc.subjectevolutionary algorithms
dc.subjectgrid computing
dc.titleGRASP and grid computing to solve the location area problemeng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2009-12
oaire.citation.conferencePlaceCoimbatore, India
oaire.citation.endPage169
oaire.citation.startPage164
oaire.citation.titleWorld Congress on Nature & Biologically Inspired Computing (NaBIC)
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameAlmeida da Luz
person.givenNameSónia Maria
person.identifier.orcid0000-0003-1065-852X
relation.isAuthorOfPublication0da424a1-c370-4f2e-b700-53b4906abaa6
relation.isAuthorOfPublication.latestForDiscovery0da424a1-c370-4f2e-b700-53b4906abaa6

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
GRASP and grid computing to solve the location area problem.pdf
Size:
1.42 MB
Format:
Adobe Portable Document Format
Description:
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.
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.32 KB
Format:
Item-specific license agreed upon to submission
Description: