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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ansari, N., Hou, E.: Computational Intelligence for Optimization. Kluwer Academic Publishers, Boston (1997)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation-Combinatorial Optimization Problems and Their Approximability. Springer-Verlag, Berlin Heidelberg New York (1999)
Bierwirth, C., Mattfeld, D. C., Kopfer, H.: On Permutation Representations for Scheduling Problems. In Proceedings of Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 1141Springer-Verlag, Berlin Heidelberg New York (1996) 310–318
Calégari, P. R.: Parallelization of population-based evolutionary algorithms for combinatorial optimization problems. PhD thesis, number 2046. Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland (1999)
Galota, M., Glaβer, C., Reith, S., Vollmer, H.: A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks. Technical Report, Universitat Wurzburg (2000)
Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, New York (1979)
Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization. John Wiley & Sons, New York (2000)
Glaβer, C., Reith, S., Vollmer, H.: The Complexity of Base Station Positioning in Cellular Networks. ICALP Workshops 2000. Proceedings in Informatics, Vol. 8 (2000) 167–177
Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1997)
Krishnamachari, B., Wicker, S. B.: Experimental analysis of local search algorithms for optimal base station location. In Proceedings of International Conference on Evolutionary Computing for Computer, Communication, Control and Power. Chennai, India (2000)
Mathar, R., Niessen, T.: Optimum positioning of base stations for cellular radio networks. Wireless Networks, Vol. 6. John Wiley & Sons, New York (2000) 421–428
Merchant, A., Sengupta, B.: Assignment of Cells to Switches in PCS Networks. IEEE/ACM Transactions on Networking, Vol. 3 No. 5. IEEE Press (1995) 521–526
Meunier, H., Talbi, E., Reininger, P.: A Multiobjective Genetic Algorithm for Radio Network Optimization. In Proceedings of the 2000 Congress on Evolutionary Computation CEC00 (2000) 317–324
Murphey, R. A., Pardalos, P., Resende, M. G. C.: Frequency Assignment Problem. In Du, D.-Z., Pardalos, P. M. (eds.). Handbook of Combinatorial Optimization. Kluwer Academic Publishers (1999) 295–377
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brizuela, C.A., Gutiérrez, E. (2003). An Experimental Comparison of Two Different Encoding Schemes for the Location of Base Stations in Cellular Networks. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-36605-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive