CSCI 470
Assigned Date: Monday, November 8, 2004
Due Date: Monday, November 15, 2004
Due Time: 3pm

In-Class Presentations: Wednesday, November 17, 2004


Updated: Monday, November 8, 2004.



This assignment focuses on solving optimization problems through genetic algorithms.



See previous assignment.



Write a Python program that solves the following instance of the traveling salesperson problem, using a genetic algorithm:

Your header comments should describe carefully your

1.      representation (semantics of genotype);

2.      fitness evaluation; and

3.      termination condition. 

Also, in a Notes subsection (of your header comments), describe your observations regarding the performance of your solution, such as:

1.      how well it works;

2.      its speed;

3.      quality of solutions;

4.      any unresolved issues;

5.      anything else worth mentioning that you noticed.


Bonus:  For extra points refine your code to be generic/scalable, that is to be easy to set up for different (e.g., larger, non-fully connected) instances of the problem.  



  1. Your code should make use of (import)   Do not modify  
  2. Assignment grade will be based on documentation, design, “correctness” of result, and presentation.  This assignment includes a presentation grade.
  3. No late days may be used for the presentation.



You should submit your source file on a floppy disk, as per syllabus instructions. 

Source filename to be submitted:  A directory named <firstName_lastName_fourLastDigitsofSSN>_hmwk3 (for example, Bill_Manaris_2308_hmwk1).  This directory should contain the following file(s):

·        (Required)

·        (Optional)