Please use this identifier to cite or link to this item: doi:10.22028/D291-25064
Title: GeneTS : a relational-functional genetic algorithm for the traveling salesman problem
Author(s): Perling, Markus
Language: English
Year of Publication: 1997
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1997
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: 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.
Link to this record: urn:nbn:de:bsz:291-scidok-39062
Series name: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Series volume: 97-01
Date of registration: 8-Jul-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
TM_97_01.pdf365,33 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.