Abstract
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackled here with two related techniques, scatter search and memetic algorithms. The instantiation of these techniques for ECC design will be discussed. Specifically, the design of the local improvement strategy and the combination method will be treated. The empirical evaluation will show that these techniques can dramatically outperform previous approaches to this problem. Among other aspects, the influence of the update method, or the use of path relinking is also analyzed on increasingly large problem 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
Dorne, R., Hao, J.: An evolutionary approach for frequency assignment in cellular radio networks. In: 1995 IEEE International Conference on Evolutionary Computation, Perth, Australia, pp. 539–544. IEEE Press, Los Alamitos (1995)
Kapsalis, A., Rayward-Smith, V., Smith, G.: Using genetic algorithms to solve the radio link frequency assigment problem. In: Pearson, D., Steele, N., Albretch, R. (eds.) Artificial Neural Nets and Genetic Algorithms, Wien, New York, pp. 37–40. Springer, Heidelberg (1995)
Chu, C., Premkumar, G., Chou, H.: Digital data networks design using genetic algorithms. European Journal of Operational Research 127, 140–158 (2000)
Vijayanand, C., Kumar, M.S., Venugopal, K.R., Kumar, P.S.: Converter placement in all-optical networks using genetic algorithms. Computer Communications 23, 1223–1234 (2000)
Chen, H., Flann, N., Watson, D.: Parallel genetic simulated annealing: A massively parallel SIMD algorithm. IEEE Transactions on Parallel and Distributed Systems 9, 126–136 (1998)
Dontas, K., Jong, K.D.: Discovery of maximal distance codes using genetic algorithms. In: Proceedings of the Second International IEEE Conference on Tools for Artificial Intelligence, Herndon, VA, pp. 811–905. IEEE Press, Los Alamitos (1990)
Lin, S., Costello Jr., D.J.: Error Control Coding: Fundamentals and Applications. Prentice Hall, Englewood Cliffs (1983)
Gamal, A., Hemachandra, L., Shaperling, I., Wei, V.: Using simulated annealing to design good codes. IEEE Transactions on Information Theory 33, 116–123 (1987)
Alba, E., Cotta, C., Chicano, F., Nebro, A.: Parallel evolutionary algorithms in telecommunications: Two case studies. In: Proceedings of the CACIC 2002, Buenos Aires, Argentina (2002)
Laguna, M., Martí, R.: Scatter Search. Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)
Moscato, P.: Memetic algorithms: A short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 219–234. McGraw-Hill, London (1999)
Agrell, E., Vardy, A., Zeger, K.: A table of upper bounds for binary codes. IEEE Transactions on Information Theory 47, 3004–3006 (2001)
Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 105–144. Kluwer Academic Publishers, Boston (2003)
Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics 39, 653–684 (2000)
Lehmann, E.: Nonparametric Statistical Methods Based on Ranks. McGraw-Hill, New York (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cotta, C. (2004). Scatter Search and Memetic Approaches to the Error Correcting Code Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive