Publication detail

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

BARTONĚK, D.

Original Title

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

Type

journal article - other

Language

English

Original Abstract

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.

Keywords

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

Authors

BARTONĚK, D.

RIV year

2005

Released

1. 12. 2005

Publisher

ACTA Scientiarum Polonorum Geodezja i Kartografia

Location

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

ISBN

1644-0668

Periodical

ACTA SCUENTIARUM POLONORUM

Year of study

2005

Number

4 (2)

State

Republic of Poland

Pages from

15

Pages to

23

Pages count

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"
}