Some guidelines for genetic algorithms with penalty functions
Proceedings of the third international conference on Genetic algorithms
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals
IEEE Transactions on Computers
PCS mobility support over fixed ATM networks
IEEE Communications Magazine
Technologies on the horizon-deploying personal communication networks
IEEE Communications Magazine
A caching strategy to reduce network impacts of PCS
IEEE Journal on Selected Areas in Communications
ATM-based transport architecture for multiservices wireless personal communication networks
IEEE Journal on Selected Areas in Communications
Assuring the dependability of telecommunications networks and services
IEEE Network: The Magazine of Global Internetworking
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
Post deployment planning of 3G cellular networks through dual homing of NodeBs
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
International Journal of Business Data Communications and Networking
International Journal of Business Data Communications and Networking
Hi-index | 0.24 |
In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is model as dual-homing cell assignment problem, which is a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a stochastic search method, based on a genetic approach, is proposed to solve this problem. In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem. Simulation results show that GA is robust for this problem.