Genetic algorithms searching for turbo code interleaver and solving linear ordering problem

Proceedings - 7th Computer Information Systems and Industrial Management Applications, CISIM 2008

Volumn , Issue , 2008, Pages 71-77

  Snášel, Václav ^a   Platoš, Jan ^a   Krömer, Pavel ^a   Ouddane, Nabil ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATIONS; CHROMOSOMES; CODES (SYMBOLS); COMPUTER NETWORKS; GENETIC ALGORITHMS; INDUSTRIAL ENGINEERING; INDUSTRIAL MANAGEMENT; INFORMATION MANAGEMENT; INFORMATION SCIENCE; INFORMATION SYSTEMS; NUCLEAR PROPULSION; OPTIMIZATION; PROJECT MANAGEMENT; SET THEORY;

LINEAR ORDERINGS;

PROBLEM SOLVING;

EID: 51749123367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISIM.2008.32     Document Type: Conference Paper

References (15)

1. M. Dianati, I. Song, and M. Treiber, "An introduction to genetic algorithms and evolution strategies," technical report, University of Waterloo, Ontario, N2L 3G1, Canada, July 2002.
2. G. Jones, "Genetic and evolutionary algorithms," in Encyclopedia of Computational Chemistry (P. von Rague, ed.), John Wiley and Sons, 1998.
3. M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1996.
4. U. Bodenhofer, "Genetic Algorithms: Theory and Applications," lecture notes, Fuzzy Logic Laboratorium Linz-Hagenberg, Winter 2003/2004.
5. A. S. Wu, R. K. Lindsay, and R. Riolo, "Empirical observations on the roles of crossover and mutation," in Proc. of the Seventh Int. Conf. on Genetic Algorithms (T. Bäck, ed.), (San Francisco, CA), pp. 362-369, Morgan Kaufmann, 1997.
6. L. V. Snyder and M. S. Daskin, "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, vol. 174, no. 1, pp. 38-53, 2006.
7. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: turbo codes," in Proc. Int. Conf. on Commun., pp. 1064-1070, 1993.
8. J. Hokfelt and T. Maseng, "Methodical interleaver design for turbo codes," International Symposium on Turbo Codes, 1997.
9. R. Garello, F. Chiaraluce, P. Pierleoni, M. Scaloni, and S. Benedetto, "On error floor and free distance of turbo codes," in IEEE International Conference on Communications (ICC 2001), vol. 1, pp. 45-49, 2001. ISBN 0-7803-7097-1.
10. T. Schiavinotto and T. Stützle, "Search space analysis for the linear ordering problem," in Applications of Evolutionary Computing (G. R. Raidl, J.-A. Meyer, M. Middendorf, S. Cagnoni, J. J. R. Cardalda, D. Corne, J. Gottlieb, A. Guillot, E. Hart, C. G. Johnson, and E. Marchiori, eds.), vol.2611 of Lecture Notes in Computer Science, (Berlin, Germany), pp. 322-333, Springer-Verlag, 2003.
11. T. Schiavinotto and T. Stützle, "The linear ordering problem: Instances, search space analysis and algorithms," Journal of Mathematical Modelling and Algorithms, vol. 3, no. 4, pp. 367-402, 2004.
12. V. Campos, F. Glover, M. Laguna, and R. Marti, "An experimental evaluation of a scatter search for the linear ordering problem," J. of Global Optimization, vol. 21, no. 4, pp. 397-414, 2001.
13. G. Reinelt, The Linear Ordering Problem : Algorithms and Applications, vol. 8 of Research and Exposition in Mathematics. Heldermann Verlag Berlin, 1985.
14. G. Huang and A. Lim, "Designing a hybrid genetic algorithm for the linear ordering problem," in GECCO, pp. 1053-1064, 2003.
15. V. Snášel, P. Krömer, and N. Ouddane, "Genetic algorithms for turbo code interleaver optimization," in Proceedings of the International Conference on Intelligent Systems Design and Applications (ISDA'07), Rio de Janeiro, Brazil, (Los Alamitos, CA, USA), IEEE Computer Society, October 2007. ISBN 0-7695-2976-3.