. "SEARCH; LINEAR ORDERING PROBLEM"@en . . "Kr\u00F6mer, Pavel" . "[0C761BC9744C]" . . "RIV/61989100:27240/09:86075454!RIV11-GA0-27240___" . "NEW YORK" . "RIV/61989100:27240/09:86075454" . "P(GA102/09/1494)" . "326792" . "2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION" . "3"^^ . . "3"^^ . "Modeling Permutations for Genetic Algorithms" . . . "000277207700018" . . "Modeling Permutations for Genetic Algorithms" . "Modeling Permutations for Genetic Algorithms"@en . . "978-1-4244-5330-6" . . "Plato\u0161, Jan" . "IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA" . . "6"^^ . . "Modeling Permutations for Genetic Algorithms"@en . "Combinatorial optimization problems form a class of appealing theoretical and practical problems attractive for their complexity and known hardness. They are often NP-hard and as such not solvable by exact methods. Combinatorial optimization problems are subject to numerous heuristic and metaheuristic algorithms, including genetic algorithms. In this paper, we present two new permutation encodings for genetic algorithms and experimentally evaluate the influence of the encodings on the performance and result of genetic algorithm on two synthetic and real-world optimization problems." . "2009-12-04+01:00"^^ . . "Combinatorial optimization problems form a class of appealing theoretical and practical problems attractive for their complexity and known hardness. They are often NP-hard and as such not solvable by exact methods. Combinatorial optimization problems are subject to numerous heuristic and metaheuristic algorithms, including genetic algorithms. In this paper, we present two new permutation encodings for genetic algorithms and experimentally evaluate the influence of the encodings on the performance and result of genetic algorithm on two synthetic and real-world optimization problems."@en . "27240" . . . . "Sn\u00E1\u0161el, V\u00E1clav" . "Malacca, MALAYSIA" . . .