A multi-objective approach to solve the location areas problem

  • Authors:
  • Víctor Berrocal-Plaza;Miguel A. Vega-Rodríguez;Juan M. Sánchez-Pérez;Juan A. Gómez-Pulido

  • Affiliations:
  • Dept. Technologies of Computers & Communications, University of Extremadura Escuela Politécnica, Cáceres, Spain;Dept. Technologies of Computers & Communications, University of Extremadura Escuela Politécnica, Cáceres, Spain;Dept. Technologies of Computers & Communications, University of Extremadura Escuela Politécnica, Cáceres, Spain;Dept. Technologies of Computers & Communications, University of Extremadura Escuela Politécnica, Cáceres, Spain

  • Venue:
  • TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Public Land Mobile Networks (PLMN) are designed to provide anywhere, any kind, and anytime services to either static or moving users, therefore mobile location management is a fundamental tool in these systems. One of the techniques used in mobile location management is the location areas strategy, which set out the problem as an optimization problem with two costs, location update and paging. In this paper we resort to a multi-objective evolutionary algorithm, Non-dominated Sorting Genetic Algorithm II (NSGA-II), for finding quasi-optimal solutions of this optimization problem. At present, there is not any previous work that addresses the problem in a multi-objective manner, so we compare our results with those obtained by mono-objective algorithms from other authors. Results show that, for this problem, better solutions are achieved when each objective is treated separately.