"P(GA102/04/0469)" . "1"^^ . . . "15-23" . "A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY" . "A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY"@en . . "9"^^ . . . "RIV/00216305:26110/05:PU58257!RIV08-GA0-26110___" . . "A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY"@en . . "RIV/00216305:26110/05:PU58257" . "[5A3DB1B99D1A]" . "Genetic algorithm, cluster analysis, shape, fragments, shape boundary, string code, optimization, fitness function, cartograms"@en . . . . "Genetick\u00FD algoritmus pro skl\u00E1d\u00E1n\u00ED celku ze seg ment\u016F"@cs . "2005" . "26110" . . . . "Barton\u011Bk, Dalibor" . . "A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY" . . . "510859" . "4 (2)" . . . . "Genetick\u00FD algoritmus pro skl\u00E1d\u00E1n\u00ED celku ze seg ment\u016F"@cs . "Genetick\u00E9 algoritmy se pou\u017E\u00EDvaj\u00ED pro optimalizaci proces\u016F, kde jin\u00E9 algoritmy pracuj\u00ED obt\u00ED\u017En\u011B nebo neefektivn\u011B. Do t\u00E9to skupiny \u00FAloh pat\u0159\u00ED i skl\u00E1d\u00E1n\u00ED segment\u016F do p\u0159edem ur\u010Den\u00E9ho obrazce, jeho\u017E tvar je zn\u00E1m. V \u010Dl\u00E1nku je pops\u00E1no jedno z mo\u017En\u00FDch \u0159e\u0161en\u00ED pomoc\u00ED genetick\u00E9ho algoritmu vych\u00E1zej\u00EDc\u00ED z popisu segment\u016F \u0159et\u011Bzcov\u00FDmi k\u00F3dy. Metody bylo prakticky vyu\u017Eito pro tvorbu kartogram\u016F v diplomov\u00FDch prac\u00EDch na \u00DAstavu geod\u00E9zie FAST VUT v Brn\u011B."@cs . "1644-0668" . "Genetic algorithms represent an up-to-date method of process optimization, where other solutions have failed or haven't given any satisfactory results. One of these processes is puzzle solving, where fragments have to be placed into the defined shape in such a way so that no fragment should mutually overlay and the whole shape area will be filled with all of these fragments. A genetic algorithm solving this task including an exact formulation and a definition of the initial conditions based on cluster analysis has been described in this paper. The algorithm efficiency will be tested in diploma works in Institute of Geodesy, Faculty of Civil Engineering, University of Technology, Brno. The results will be used in the application for cartograms creation." . "Genetic algorithms represent an up-to-date method of process optimization, where other solutions have failed or haven't given any satisfactory results. One of these processes is puzzle solving, where fragments have to be placed into the defined shape in such a way so that no fragment should mutually overlay and the whole shape area will be filled with all of these fragments. A genetic algorithm solving this task including an exact formulation and a definition of the initial conditions based on cluster analysis has been described in this paper. The algorithm efficiency will be tested in diploma works in Institute of Geodesy, Faculty of Civil Engineering, University of Technology, Brno. The results will be used in the application for cartograms creation."@en . "PL - Polsk\u00E1 republika" . "ACTA SCUENTIARUM POLONORUM" . . "1"^^ . .