By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vieira, R.V. ; Dept. de Inf., Univ. Fed. de Pernambuco, Recife, Brazil ; Lopes, M.A.

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.

Published in:

Computer Science Society, 1999. Proceedings. SCCC '99. XIX International Conference of the Chilean

Date of Conference:

13-13 Nov. 1999