GENETIC ALGORITHM AND TRAVELLING SALESMEN PROBLEM USING C# AND ATL COM

ABSTRACT
This project is about an application used by the travelling salesman, given a finite number of “cities” (I have choosen cities from 1 to a finite number) along with the distance of travel (distance between two cities is randomly choosen) between each pair of them the aim is to find the cheapest distance of visiting all the cities and returning to the starting point. using GA we can get an optimal solution to solve this problem. This is only an example to look at calling COM components and accessing SAFEARRAY in C#. I don’t know any things about genetic algorithm and please don’t take this code as demonstrating a problem to solve suing only genetic algorithms (GA). This is just one approach. The C++ code for GA I got from the internet. 
TABLE OF CONTENT TITLE PAGE CERTIFICATION APPROVAL DEDICATION ACKNOWLEDGEMENT ABSTRACT TABLE OF CONTENT
CHAPTER ONE 1.0INTRODUCTION 1.1STATEMENT OF PROBLEM 1.2PURPOSE OF STUDY 1.3AIMS AND OBJECTIVES 1.4SCOPE/DELIMITATIONS 1.5LIMITATIONS/CONSTRAINTS 1.6DEFINITION OF TERMS
CHAPTER TWO 2.0LITERATURE REVIEW
CHAPTER THREE 3.0METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM 3.1 METHODOLOGIES FOR FACT-FINDING  3.2DISCUSSIONS
CHAPTER FOUR 4.0FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM  4.1FUTURES  4.2IMPLICATIONS 4.3CHALLENGES
CHAPTER FIVE 5.0RECOMMENDATIONS, SUMMARY AND CONCLUSION 5.1RECOMMENDATION 5.2SUMMARY 5.3CONCLUSION REFERENCES