Bitte benutzen Sie diese Referenz, um auf diese Ressource zu verweisen:
doi:10.22028/D291-41607
Titel: | Using TEAMWORK for the Distribution of Approximately Solving the Traveling Salesman Problem with Genetic Algorithms |
VerfasserIn: | Denzinger, Jörg Scholz, Stephan |
Sprache: | Englisch |
Erscheinungsjahr: | 1997 |
Erscheinungsort: | Kaiserslautern |
DDC-Sachgruppe: | 004 Informatik |
Dokumenttyp: | Forschungsbericht (Report zu Forschungsprojekten) |
Abstract: | We present a distributed system, DOTT, for approximately solving the Traveling Salesman Problem (TSP) based on. the TEAMWORK method. So-called experts and specialists work independently and in parallel for given time periods. For TSP, specialists are tour construction algorithms and experts use modified genetic algorithms in which after each application of a genetic operator the resulting tour is locally optimized before it is added to the population. After a given time period the work of each expert and specialist is judged by a referee. A new start population, including selected individuals from each expert and specialist, is generated by the supervisor, based on the judgments of the referees. Our system is able to find better tours than each of the experts or specialists working alone. Also results comparable to those of single runs can be found much faster by a team. |
Link zu diesem Datensatz: | urn:nbn:de:bsz:291--ds-416076 hdl:20.500.11880/37810 http://dx.doi.org/10.22028/D291-41607 |
Schriftenreihe: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
Band: | 97,4 |
Datum des Eintrags: | 6-Jun-2024 |
Fakultät: | SE - Sonstige Einrichtungen |
Fachrichtung: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Professur: | SE - Sonstige |
Sammlung: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Dateien zu diesem Datensatz:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
SEKI-Report-SR-97-04_Denzinger-Scholz_Using-TEAMWORK-for-the-Distribution-of-Approximately-Solving-the-Traveling-Salesman-Problem-with-Genetic-Algorithms.pdf | 2,36 MB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.