2007 | OriginalPaper | Buchkapitel
Application of the Agamogenetic Algorithm to Solve the Traveling Salesman Problem
verfasst von : Yinghui Zhang, Zhiwei Wang, Qinghua Zeng, Haolei Yang, Zhihua Wang
Erschienen in: Bio-Inspired Computational Intelligence and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Based on the biologic agamogenesis mechanism, the agamogenetic algorithm (AGA), which is similar to classical genetic algorithms except the agamogenesis and highly converging speed, is presented to solve the optimization problems. In order to solve the traveling salesman problem (TSP) by AGA, one agamogenetic operator R-Edge and one mutation operator NI-Dot are given by introducing the conception of the relative distance between cities. The validity of the AGA to solve the traveling salesman problem is shown by simulative experiments.