Telecommunications network design algorithms
Telecommunications network design algorithms
Terminal assignment in a communications network using genetic algorithms
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for the terminal assignment problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A Bionomic Approach to the Capacitated p-Median Problem
Journal of Heuristics
An efficient heuristic for the expansion problem of cellular wireless networks
Computers and Operations Research
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization)
Enhancing genetic feature selection through restricted search and Walsh analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Assigning cells to switches in cellular mobile networks using taboosearch
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A two-phase genetic K-means algorithm for placement of radioports in cellular networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Assigning cells to switches in cellular mobile networks: a comparative study
Computer Communications
Solving assignment problem of cellular mobile network using iterative local search algorithm
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
A hybrid grouping genetic algorithm for the multiple-type access node location problem
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Targeting cells to switch assignment of cellular mobile network using heuristic algorithm
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Computers and Operations Research
A novel grouping harmony search algorithm for the multiple-type access node location problem
Expert Systems with Applications: An International Journal
International Journal of Mobile Network Design and Innovation
A hybrid metaheuristic approach for the capacitated p-median problem
Applied Soft Computing
| Hi-index | 0.00 |
The optimal positioning of switches in a mobile communication network is an important task, which can save costs and improve the performance of the network. In this paper we propose a model for establishing which are the best nodes of the network for allocating the available switches, and several hybrid genetic algorithms to solve the problem. The proposed model is based on the so-called capacitated p-median problem, which have been previously tackled in the literature. This problem can be split in two subproblems: the selection of the best set of switches, and a terminal assignment problem to evaluate each selection of switches. The hybrid genetic algorithms for solving the problem are formed by a conventional genetic algorithm, with a restricted search, and several local search heuristics. In this work we also develop novel heuristics for solving the terminal assignment problem in a fast and accurate way. Finally, we show that our novel approaches, hybridized with the genetic algorithm, outperform existing algorithms in the literature for the p-median problem.