## Using Teamwork for the Distribution of Approximately Solving the Traveling Salesman Problem with Genetic Algorithms

• We present a distributed system, Dott, for approximately solving the Trav-eling Salesman Problem (TSP) based on the Teamwork method. So-calledexperts and specialists work independently and in parallel for given time pe-riods. For TSP, specialists are tour construction algorithms and experts usemodified genetic algorithms in which after each application of a genetic operatorthe resulting tour is locally optimized before it is added to the population. Aftera 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 spe-cialist, 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 specialistsworking alone. Also results comparable to those of single runs can be found muchfaster by a team.

### Weitere Dienste

Verfasserangaben: Jörg Denzinger, Stephan Scholz urn:nbn:de:hbz:386-kluedo-3757 SEKI Report (97,4) Preprint Englisch 1997 1997 Technische Universität Kaiserslautern 03.04.2000 Fachbereich Informatik 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$