DocumentCode
1931766
Title
Solving the Location Areas problem with Strength Pareto Evolutionary Algorithm
Author
Berrocal-Plaza, Victor ; Vega-Rodriguez, Miguel A. ; Sanchez-Perez, Juan M. ; Gomez-Pulido, Juan A.
Author_Institution
Dept. Technol. of Comput. & Commun., Univ. of Extremadura, Caceres, Spain
fYear
2012
fDate
20-22 Nov. 2012
Firstpage
49
Lastpage
54
Abstract
In the last few years, the management systems which control the mobile location are becoming more important due to the increase in the number of mobile users. From among the location management techniques, the use of Location Areas is an important strategy which defines the location management task as an optimization problem with two conflicting costs that must be minimized: subscriber location update and paging. In this work, we resort to a multi-objective evolutionary algorithm, Strength Pareto Evolutionary Algorithm 2 (SPEA2), to obtain quasi-optimal solutions of this optimization problem. Furthermore, we compare our results with those obtained by mono-objective algorithms of other authors because, at present, there is not any previous work that tackles the problem with a multi-objective approach. Results show the advantages of solving the Location Areas scheme by using a multi-objective approach.
Keywords
Pareto optimisation; evolutionary computation; mobility management (mobile radio); SPEA2; location areas problem; location management technique; mobile location; multiobjective evolutionary algorithm; optimization problem; quasioptimal solution; strength Pareto evolutionary algorithm; Location Areas Problem; Mobile Location Management; Multi-Objective Optimization; Strength Pareto Evolutionary Algorithm 2;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Informatics (CINTI), 2012 IEEE 13th International Symposium on
Conference_Location
Budapest
Print_ISBN
978-1-4673-5205-5
Electronic_ISBN
978-1-4673-5210-9
Type
conf
DOI
10.1109/CINTI.2012.6496808
Filename
6496808
Link To Document