Constructing test cases for partitioning heuristics
IEEE Transactions on Computers
Annals of Operations Research - Special issue on Tabu search
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
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
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
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
Optimal switch location in mobile communication networks using hybrid genetic algorithms
Applied Soft Computing
Solving assignment problem of cellular mobile network using iterative local search algorithm
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Problem of assignment cells to switches in a cellular mobile network via Beam search method
WSEAS TRANSACTIONS on COMMUNICATIONS
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
Measurement-Based optimization of a 3g core network: a case study
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
International Journal of Business Data Communications and Networking
Hi-index | 0.24 |
Assigning cells to switches in cellular mobile networks is an NP-hard problem which, for realsize mobile networks, could not be solved by using exact methods. In this context, heuristic approaches like genetic algorithms, tabu search and simulated annealing can be used. This paper proposes a comparative study of three heuristics-tabu search, simulated annealing and Parallel Genetic Algorithms with Migrations (PGAM)-used to solve this problem. The implementation of these algorithms have been tested in order to measure the quality of solutions. The results obtained confirm the efficiency of the seheuristics to provide good solutions for medium- and large-sized cellular mobile networks, in comparison with the sequential genetic algorithm (SGA) and with other heuristic methods well known in the literature. The evaluation cost provided by tabu search, simulated annealing and PGAM are very similar. Those three algorithms provide better results than standard genetic algorithm and always find feasible solutions. In terms of CPU times, tabu search is the fastest method. Finally, the results have been compared with a lower bound on the global optimum; they confirm the effectiveness of the tabu search, simulated annealing and PGAM to solve this problem.