An application of abstract data types in the genetic algorithms construction: the example of the travelling salesman problem

摘要

The article presents the specification of a system for the travelling salesman problem through a genetic algorithm developed from abstract data types (R.V. Vieira and M.A. Lopes, 1999). It is intended with this to demonstrate the efficiency of genetic algorithms in the solution of evolution problems. It mainly shows the genetic algorithm, AG, developed by Vieira and Lopes, as a general, correct genetic algorithm for construction, from which other algorithms can be correctly reproduced, depending in each case on the adopted representation.