Evolutionary approach to optimize the assignment of cells to switches in personal communication networks

Authors:
Alejandro Quintero;Samuel Pierre
Affiliations:
Mobile Computing and Networking Research Laboratory (LARIM), Department of Computer Engineering, ícole Polytechnique de Montréal,C.P. 6079, succ. Centre-Ville, Montréal, Que., Canad ...;Mobile Computing and Networking Research Laboratory (LARIM), Department of Computer Engineering, ícole Polytechnique de Montréal,C.P. 6079, succ. Centre-Ville, Montréal, Que., Canad ...
Venue:
Computer Communications
Year:
2003

Citing 18
Cited 6

A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function

SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Economic aspects of configuring cellular networks

Wireless Networks
Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
Modeling PCS networks under general call holding time and cell residence time distributions

IEEE/ACM Transactions on Networking (TON)
Hybrid Genetic Algorithms for Telecommunications Network Back-Up Routeing

BT Technology Journal
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

Wireless Personal Communications: An International Journal
A Study of Genetic Algorithm Hybrids for Facility Layout Problems

Proceedings of the 6th International Conference on Genetic Algorithms
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm

Journal of Artificial Intelligence Research
Genetic algorithms with a robust solution searching scheme

IEEE Transactions on Evolutionary Computation
Hybrid genetic algorithms for constrained placement problems

IEEE Transactions on Evolutionary Computation
Evolutionary algorithms and gradient search: similarities anddifferences

IEEE Transactions on Evolutionary Computation
An evolutionary strategy for global minimization and its Markovchain analysis

IEEE Transactions on Evolutionary Computation
Integrating fuzzy knowledge by genetic algorithms

IEEE Transactions on Evolutionary Computation
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem

IEEE Transactions on Evolutionary Computation
A tabu search approach for assigning cells to switches in cellular mobile networks

Computer Communications
The cost structure of personal communication services

IEEE Communications Magazine

Ant colony optimization for the cell assignment problem in PCS networks

Computers and Operations Research
Network partition for switched industrial Ethernet using genetic algorithm

Engineering Applications of Artificial Intelligence
Assignment of cells to switches in a cellular mobile network using a hybrid Hopfield network-genetic algorithm approach

Applied Soft Computing
Ant colony optimization for the cell assignment problem in PCS networks

Computers and Operations Research
Evolutionary algorithms for location area management

EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Handoff Cost Minimization and Planning of Next Generation Heterogeneous Integrated Overlay Networks: Meta Heuristics Based Approach

International Journal of Business Data Communications and Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper proposes an evolutionary approach to solve the problem of assigning cells to switches in the planning phase of mobile cellular networks. Well-known in the literature as an NP-hard combinatorial optimization problem, this problem requires the recourse to heuristic methods, which can practically lead to good feasible solutions, not necessarily optimal, the objective being rather to reduce the convergence time toward these solutions. Computational results obtained from extensive tests confirm the effectiveness of this approach to provide good solutions to problems of a certain size. This approach can be used to solve NP-hard problems, like designing and planning, in the next generation networking systems.