CANAVAN se401006 at
Tue Feb 26 11:22:03 EST 2002

Dear Sir,
	I am a student of Computer Science and Software Engineering here in NUI 
Maynooth. For my final year project I have undertaken to examine the use of 
Genetic Algorithms on certain problems. The main area I am investigating is the 
use of Evolutionary Divide-and-Conquer on the problems. 
	For this I am using your library, 'galib' from the University of 
Massachusetts(MIT). For the final problem, I am performing the EDC approach on a 
Travelling Salesman Problem (ex26). However, the input text file for this 
problem is very confusing. I have tried to make sense of it, but to no avail. I 
was wondering if you could help me.
	Attached is the relevant file. The file format is in accordance with the 
TSPLIB, and is rectilinear, but I have never come across anything like this 
before. It is quite urgent, as my thesis must be completed within the next two 
weeks, so I wish to finalise my results soon. I do not understand how the 
distances are calculated, nor do I understand which cities are visited, and 
when. These results are the most significant of the project, so your help would 
be greatly appreciated.
			Darragh Canavan

More information about the galib mailing list