Evolving feasible linear ordering problem solutions

5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings

Volumn , Issue , 2008, Pages 337-342

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

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Genetic algorithms; Linear ordering problem

Indexed keywords

LINEAR ORDERING PROBLEM; LINEAR ORDERINGS; NP-HARD PROBLEM; OPTIMIZATION PROBLEMS; REAL-WORLD APPLICATION; TESTING DATA;

SET THEORY; SOFT COMPUTING;

GENETIC ALGORITHMS;

EID: 77951582502     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1456223.1456293     Document Type: Conference Paper

References (16)

1. Abraham, A., Krömer, P., Snášel, V., and Ouddane, N. Evolving turbo code interleavers by genetic algorithms. In Proceedings of the International Conference on Complex, Intelligent and Software Intesive Systems (CISIS'08), Barcelona, Spain (Los Alamitos, CA, USA, October 2008), IEEE Computer Society.
2. Bertacco, L., Brunetta, L., and Fischetti, M. The linear ordering problem with cumulative costs. European Journal of Operational Research 127, 3 (September 2008), 1345-1357. (Pubitemid 351400571)
3. Bodenhofer, U. Genetic Algorithms: Theory and Applications. Lecture notes, Fuzzy Logic Laboratorium Linz-Hagenberg, Winter 2003/2004.
4. Campos, V., Glover, F., Laguna, M., and Martí, R. An experimental evaluation of a scatter search for the linear ordering problem. J. of Global Optimization 21, 4 (2001), 397-414. (Pubitemid 33672376)
5. Dianati, M., Song, I., and Treiber, M. An introduction to genetic algorithms and evolution strategies. Technical report, University of Waterloo, Ontario, N2L 3G1, Canada, July 2002.
6. Huang, G., and Lim, A. Designing a hybrid genetic algorithm for the linear ordering problem. In GECCO (2003), pp. 1053-1064.
7. Jones, G. Genetic and evolutionary algorithms. In Encyclopedia of Computational Chemistry, P. von Rague, Ed. John Wiley and Sons, 1998.
8. Mitchell, J. E., and Borchers, B. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. Tech. rep., Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180-3590, September 1997. Accepted for publication in Proceedings of HPOPT97, Rotterdam, The Netherlands.
9. Mitchell, M. An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA, 1996.
10. Ouddane, N., Krömer, P., and Snášel, V. Interleaver design for parallel convolutive turbo codes by the genetic algorithms. In Radioelektronika 2007 (Brno, Czech Republic, April 2007), Faculty of Electrical Engineering and Communication, Brno University of Technology.
11. Proakis, J. G. Digital Communications, 4th ed. McGraw-Hill, New York, 2001.
12. Reinelt, G. The Linear Ordering Problem : Algorithms and Applications, vol. 8 of Research and Exposition in Mathematics. Heldermann Verlag Berlin, 1985.
13. Schiavinotto, T., and Stützle, T. Search space analysis for the linear ordering problem. In Applications of Evolutionary Computing (Berlin, Germany, 2003),
14. 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, Springer-Verlag, pp. 322-333.
15. Schiavinotto, T., and Stützle, T. The linear ordering problem: Instances, search space analysis and algorithms. Journal of Mathematical Modelling and Algorithms 3, 4 (2004), 367-402.
16. Snášel, V., Krömer, P., and Ouddane, N. 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, October 2007), IEEE Computer Society.