Warianty tytułu
Języki publikacji
Abstrakty
Genetic algorithms represent an up-to-date method of process optimalization, where other solutions have failed or havent given any satisfactory results. One of these processes is automatic placement of map symbols in such a way so that no symbols should mutually overlay. A genetic algorithm solving this task including an exact formulation and a definition of the initial conditions has been described in this paper. The algorithm efficiency will be tested in diploma works in Institute of Geodesy, Faculty of Civil Engineering, Brno University of Technology.
Wydawca
Rocznik
Tom
Numer
Opis fizyczny
http://www.ejpau.media.pl/volume6/issue1/geodesy/art-01.html
Twórcy
autor
- University of Technology, Veveri 95 662 37 Brno, Czech Republic
Bibliografia
- Goldberg D. E., 1989. Genetic Algorithms in Search, Optimisation and Machine Learning. Addisson-Wesley.
- Omera P., 2001. Genetic algorithms and theirs application. Habilitation thesis. Faculty of Mechanical Engineering, University of Technology Brno.
- Manna Z., 1981. Mathematical theory of computation. SNTL Prague, 1981, 468 pp. [in Czech].
- ára J., Bene B., Felkel P., 1998. Modern computer graphics. Computer Press Prague, 448 pp. [in Czech].
- Hudec B., 1993. Basics of Computer Graphics. Scriptum CTU, Prague, 222 pp. [in Czech].
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.agro-article-b576c675-632a-497a-ba46-95c501d2bd66