Assigning cells to switches in cellular networks by incorporating a pricing mechanism into Simulated annealing

Authors:
S. Menon;R. Gupta
Affiliations:
Sch. of Manage., Univ. of Texas, Richardson, TX, USA;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2004

Citing 0
Cited 16

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
Time efficient heuristics for cell-to-switch assignment in quasi-static/dynamic location area planning of mobile cellular networks

Computer Communications
Assignment of cells to switches in a cellular mobile network using a hybrid Hopfield network-genetic algorithm approach

Applied Soft Computing
A hybrid greedy-simulated annealing algorithm for the optimal location of controllers in wireless networks

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
Ant colony optimization for the cell assignment problem in PCS networks

Computers and Operations Research
A beam search method to solve the problem of assignment cells to switches in a cellular mobile network

MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
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
A tabu search approach for assigning node Bs to switches in UMTS networks

IEEE Transactions on Wireless Communications
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
A novel grouping harmony search algorithm for the multiple-type access node location problem

Expert Systems with Applications: An International Journal
On cost-efficient optimisation of universal mobile telecommunications system access subsystem using extended evolutionary heuristic algorithm

International Journal of Mobile Network Design and Innovation
A local search heuristic to solve the planning problem of 3G UMTS all-IP release 4 networks with realistic traffic

International Journal of Autonomous and Adaptive Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Handoff and cabling costs play key roles in the design of cellular telecommunications networks. Efficient homing of cells to switches can have a significant impact on each of these costs. In the presence of capacity constraints at the switches, the problem of assigning cells to switches becomes a difficult one to solve, with all effective solution approaches being based on heuristic techniques. This paper presents a hybrid heuristic which integrates ideas from linear programming into a simulated annealing framework. Extensive computational results are presented comparing the performance of the heuristic with the lower bound obtained from the linear programming relaxation. These results indicate that this price influenced simulated annealing (PISA) procedure is extremely efficient, usually providing solutions with gaps around 1% in less than 1 s.