A Hybrid Grouping Genetic Algorithm for the Multiple-Type Access Node Location Problem
This paper presents a new model for the access node location problem (ANLP) in communications networks, in which the access nodes (concentrators) can be chosen from different types (with different capacity and cost). The paper also proposes a hybrid grouping genetic algorithm which is able to efficiently solve the problem. In the paper, the main characteristics of the algorithm (encoding, operators and fitness function) are fully described, and its performance has been shown by solving different ANLP instances incorporating the new model.
Unable to display preview. Download preview PDF.
- 3.Krishnamachari, B., Wicker, S.: Base station location optimization in cellular wireless networks using heuristic search algorithms. In: Wang, L. (ed.) Soft Computing in Communications. Springer, Heidelberg (2003)Google Scholar
- 5.Abuali, F.N., Schoenefeld, D.A., Wainwright, R.L.: Terminal assignment in a communications network using genetic algorithms. In: Proc. 22nd Annual ACM Computer Science Conference, pp. 74–81. ACM Press, New York (1994)Google Scholar