Ant colony optimization for the cell assignment problem in PCS networks
Computers and Operations Research
A heuristics based approach for cellular mobile network planning
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Fault-aware communication mapping for NoCs with guaranteed latency
International Journal of Parallel Programming
ACM Transactions on Embedded Computing Systems (TECS)
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
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Ant colony optimization for the cell assignment problem in PCS networks
Computers and Operations Research
Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
IEEE Transactions on Signal Processing
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
International Journal of Business Data Communications and Networking
International Journal of Business Data Communications and Networking
International Journal of Mobile Network Design and Innovation
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.00 |
The design of wireless telecommunications networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems. We propose a taboo-search approach dedicated to one of the aforementioned design optimization problems, namely the cell assignment problem. Our approach defines a series of moves applicable to an initial solution in order to improve the cost and establish the feasibility of the solution. For this purpose, we identify a gain structure with update procedures to efficiently choose the best solution in the current neighborhood. The results are generally good in comparison with those obtained through other heuristic methods