19th International Conference of the Chilean Computer Science Society An Application of Abstract Data Types in the Genetic Algorithms Construction: The Example of the Traveling Salesman Problem Talca, Chile November 11-November 13 ISBN: 0-7695-0296-2
This article presents the specification of a system for the traveling salesman problem through a genetic algorithm developed from abstract types of data [1]. It is intended with this to demonstrate the efficiency of the genetic algorithms in the solution of evolution problems, but mainly to show genetic algorithm AG, developed in [1], as a general, correct genetic algorithm for construction, from which other algorithms can be reproduced, obviously correct, depending in each case on the adopted representation.
Citation:
Roberta Vilhena Vieira, Manoel Agamemnon Lopes, "An Application of Abstract Data Types in the Genetic Algorithms Construction: The Example of the Traveling Salesman Problem," sccc, pp.144, 19th International Conference of the Chilean Computer Science Society, 1999 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||