A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem

This article presents the application of a Parallel Evolutionary Algorithm to solve the Minimum Interference Frequency Assignment Problem (MI-FAP). This is a capital problem in the mobile telecommunication field, which proposes to find an assignation of a set of frequencies to minimize the communica...

Descripción completa

Detalles Bibliográficos
Autores principales: Mora, Gerardo, Perfumo, Cristian, Rojas, Lucas, Nesmachnow, Sergio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22625
Aporte de:
id I19-R120-10915-22625
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
minimum interference
frequency assignment problem
Parallel algorithms
Cellular architecture (e.g., mobile)
spellingShingle Ciencias Informáticas
minimum interference
frequency assignment problem
Parallel algorithms
Cellular architecture (e.g., mobile)
Mora, Gerardo
Perfumo, Cristian
Rojas, Lucas
Nesmachnow, Sergio
A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
topic_facet Ciencias Informáticas
minimum interference
frequency assignment problem
Parallel algorithms
Cellular architecture (e.g., mobile)
description This article presents the application of a Parallel Evolutionary Algorithm to solve the Minimum Interference Frequency Assignment Problem (MI-FAP). This is a capital problem in the mobile telecommunication field, which proposes to find an assignation of a set of frequencies to minimize the communication interference. MI-FAP is a NP-Complete optimization problem; so traditional exact algorithms are useless for solving real-life problem instances in reasonable execution times. This work proposes to use a metaheuristic approach to find good quality solutions for real-life MIFAP instances never faced before using Evolutionary Algorithms. Evaluation experiments performed on those real-life instances report promising numerical results for both serial and parallel models of the algorithm proposed. In addition, the parallel version shows high levels of computational efficiency, demonstrating a superlinear speedup behavior for the instances studied
format Objeto de conferencia
Objeto de conferencia
author Mora, Gerardo
Perfumo, Cristian
Rojas, Lucas
Nesmachnow, Sergio
author_facet Mora, Gerardo
Perfumo, Cristian
Rojas, Lucas
Nesmachnow, Sergio
author_sort Mora, Gerardo
title A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
title_short A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
title_full A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
title_fullStr A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
title_full_unstemmed A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
title_sort parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/22625
work_keys_str_mv AT moragerardo aparallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT perfumocristian aparallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT rojaslucas aparallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT nesmachnowsergio aparallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT moragerardo parallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT perfumocristian parallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT rojaslucas parallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
AT nesmachnowsergio parallelevolutionaryalgorithmappliedtotheminimuminterferencefrequencyassignmentproblem
bdutipo_str Repositorios
_version_ 1764820466146476032