Solving the Location Areas problem with Strength Pareto Evolutionary Algorithm
Solving the Location Areas problem with Strength Pareto Evolutionary Algorithm
复制标题
DOI：
10.1109/cinti.2012.6496808
复制
发表时间：
2012-11
期刊：
影响因子：
--
通讯作者：
Víctor Berrocal-Plaza;M. A. Vega-Rodríguez;J. M. Sánchez-Pérez;J. A. Gómez-Pulido
中科院分区：
文献类型：
--
作者：
Víctor Berrocal-Plaza;M. A. Vega-Rodríguez;J. M. Sánchez-Pérez;J. A. Gómez-Pulido
在过去的几年里，由于移动用户数量的增加，控制移动位置的管理系统变得越来越重要。在位置管理技术中，位置区域的使用是一种重要的策略，它将位置管理任务定义为具有必须最小化的两个冲突代价的优化问题：用户位置更新和寻呼。在这项工作中，我们求助于一个多目标进化算法，强度Pareto进化算法2(SPEA2)，以获得该优化问题的准最优解。此外，我们将我们的结果与其他作者的单目标算法的结果进行了比较，因为目前还没有任何以前的工作用多目标方法来解决这一问题。结果表明，用多目标方法求解选址区域方案具有一定的优越性。
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.