Hard handoff minimization using genetic algorithms

Authors:
T. M. Chan;S. Kwong;K. F. Man;K. S. Tang
Affiliations:
Department of Electronic Engineering, City University of Hong Kong, 83 Tatchee Ave., Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, 83 Tatchee Ave., Kowloon, Hong Kong;Department of Electronic Engineering, City University of Hong Kong, 83 Tatchee Ave., Kowloon, Hong Kong;Department of Electronic Engineering, City University of Hong Kong, 83 Tatchee Ave., Kowloon, Hong Kong
Venue:
Signal Processing
Year:
2002

Citing 5
Cited 3

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms: Concepts and Designs with Disk

Genetic Algorithms: Concepts and Designs with Disk
Natural and simulated annealing

Computing in Science and Engineering
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Blind linear channel estimation using genetic algorithm and SIMO model

Signal Processing
A hybrid grouping genetic algorithm for the registration area planning problem

Computer Communications
Survey: A survey of repair methods used as constraint handling techniques in evolutionary algorithms

Computer Science Review

Quantified Score

Hi-index	0.08

Visualization

Abstract

To set up personal communication services networks using code division multiple access cellular system standard, cost is always an important factor for consideration. In this paper, we aim to present a genetic algorithm-based method to reduce the cost of facilities as much as possible while the service performance is guaranteed. Handoff induces a cost to the investment significantly; thus, hard handoff minimization is desired. We formulate a combinatorial optimization problem to minimize the weighted-distance costs and hard handoff cost. Also, an efficient searching technique, genetic algorithms (GA), is adopted in this minimization problem. Both single objective and multiple objective approaches of GA are applied to the problem. It is found that the results obtained by the single objective approach can provide small weighted distance costs and hard handoff cost while the network partition is still balanced.