An experimental comparison of two different encoding schemes for the location of base stations in cellular networks

Authors:
Carlos A. Brizuela;Everardo Gutiérrez
Affiliations:
Computer Science Department, CICESE Research Center, Ensenada, B.C., México;Computer Science Department, CICESE Research Center, Ensenada, B.C., México
Venue:
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Year:
2003

Citing 8
Cited 0

Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Optimum positioning of base stations for cellular radio networks

Wireless Networks
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Genetic Algorithms

Genetic Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Permutation Representations for Scheduling Problems

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Computational Intelligence for Optimization

Computational Intelligence for Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents preliminary results on the comparison of binary and integer based representations for the Base Stations Location (BSL) problem. The simplest model of this problem, which is already NP-complete, is dealt with to compare also different crossover operators. Experimental results support the hypothesis that the integer based representation with a specific crossover operator outperforms the more traditional binary one for a very specific set of instances.