TY  - RPRT
T1  - GeneTS : a relational-functional genetic algorithm for the traveling salesman problem 
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1997
A1  - Perling,Markus
Y1  - 2011/07/08
N2  - This work demonstrates a use of the relational-functional language RelFun for specifying and implementing genetic algorithms. Informal descriptions of the traveling salesman problem and a solution strategy are given. From these a running RelFun application is developed, whose most important parts are presented. This application achieves good approximations to traveling salesman problems by using a genetic algorithm variant with particularly tailored data representations. The feasibility of implementing sizable applications in RelFun is discussed. 
KW  - Künstliche Intelligenz
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3906
ER  -