Publikace UTB
Repozitář publikační činnosti UTB

Santa Fe trail for artificial ant with analytic programming and three evolutionary algorithms

Repozitář DSpace/Manakin

Zobrazit minimální záznam


dc.title Santa Fe trail for artificial ant with analytic programming and three evolutionary algorithms en
dc.contributor.author Komínková Oplatková, Zuzana
dc.contributor.author Zelinka, Ivan
dc.relation.ispartof AMS 2007: First Asia International Conference on Modelling & Simulation Asia Modelling Symposium, Proceedings
dc.identifier.isbn 978-1-4244-0325-7
dc.date.issued 2007
dc.citation.spage 334
dc.citation.epage 339
dc.event.title 1st Asia International Conference on Modelling and Simulation
dc.event.location Phuket
utb.event.state-en Thailand
utb.event.state-cs Thajsko
dc.event.sdate 2007-03-27
dc.event.edate 2007-03-30
dc.type conferenceObject
dc.language.iso en
dc.publisher IEEE Computer Society en
dc.identifier.doi 10.1109/AMS.2007.85
dc.relation.uri http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4148682
dc.description.abstract The paper deals with a novelty tool for symbolic regression - Analytic Programming (AP) which is able to solve various problems from the symbolic regression domain. One of the tasks for it can be a setting an optimal trajectory for an artificial ant on Santa Fe trail which is the main application of Analytic Programming in this paper. In this contribution main principles of AP are described and explained. In the second part of the article how AP was used for a setting an optimal trajectory for the artificial ant according the user requirements is in detail described. An ability to create so called programs, as well as Genetic Programming (GP) or Grammatical Evolution (GE) do, is shown in that part. AP is a superstructure of evolutionary algorithms which are necessary to run AP. In this contribution 3 evolutionary algorithms were used - Self Organizing Migrating Algorithm, Differential Evolution and Simulated Annealing. The results show that the first two used algorithms were more successful than not so robust Simulated Annealing. en
utb.faculty Faculty of Applied Informatics
dc.identifier.uri http://hdl.handle.net/10563/1001920
utb.identifier.obdid 15553127
utb.identifier.scopus 2-s2.0-84963967726
utb.identifier.wok 000247397200059
utb.source d-wok
dc.date.accessioned 2011-08-09T07:34:14Z
dc.date.available 2011-08-09T07:34:14Z
utb.contributor.internalauthor Komínková Oplatková, Zuzana
utb.contributor.internalauthor Zelinka, Ivan
Find Full text

Soubory tohoto záznamu

Zobrazit minimální záznam