Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Traveling Salesman (& J ) Peter G. Anderson,
 

Summary:  The Traveling Salesman (& J )
Peter G. Anderson,
Computer Science Department
Rochester Institute of Technology,
Rochester, New York
anderson@cs.rit.edu http://www.cs.rit.edu/
June 11, 2003
pg. 1
Abstract
The traveling salesman problem (TSP) and its variations and
disguises.
Also, introducing the J programming language, showing that it is
highly suitable for GA programming, and demonstrating an ordered
greed implementation for the traveling salesman.
pg. 2
TSP
Given a symmetric N N matrix of positive values (costs), C.
(This is an edge weighted complete graph.)
Find the permutation, p, of {0, 1, 2, , N - 1} so that the following cost
is minimized:

  

Source: Anderson, Peter G. - Department of Computer Science, Rochester Institute of Technology

 

Collections: Computer Technologies and Information Sciences