.png){kind=icon}
.png){kind=icon}
Return
Hard handoff minimization using genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(02)00213-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
code division multiple access (CDMA)
personal communication services (PCS)
genetic algorithms
facility location problem
hard handoff
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
Organization
No organization information available