Detail publikace

A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY

BARTONĚK, D.

Originální název

A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Genetic algorithm, cluster analysis, shape, fragments, shape boundary, string code, optimization, fitness function, cartograms

Autoři

BARTONĚK, D.

Rok RIV

2005

Vydáno

1. 12. 2005

Nakladatel

ACTA Scientiarum Polonorum Geodezja i Kartografia

Místo

Bydgoszcz Kraków Lublin Olsztyn Poznaň Siedlce Szczecin Warszawa Wroclaw

ISSN

1644-0668

Periodikum

ACTA SCUENTIARUM POLONORUM

Ročník

2005

Číslo

4 (2)

Stát

Polská republika

Strany od

15

Strany do

23

Strany počet

9

BibTex

@article{BUT43175,
  author="Dalibor {Bartoněk}",
  title="A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY",
  journal="ACTA SCUENTIARUM POLONORUM",
  year="2005",
  volume="2005",
  number="4 (2)",
  pages="15--23",
  issn="1644-0668"
}