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

Overview
Cite Work

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.0 INTRODUCTION

1.1 STATEMENT OF PROBLEM

1.2 PURPOSE OF STUDY

1.3 AIMS AND OBJECTIVES

1.4 SCOPE/DELIMITATIONS

1.5 LIMITATIONS/CONSTRAINTS

1.6 DEFINITION OF TERMS

CHAPTER TWO

2.0 LITERATURE REVIEW

CHAPTER THREE

3.0 METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM

3.1 METHODOLOGIES FOR FACT-FINDING

3.2 DISCUSSIONS

CHAPTER FOUR

4.0 FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM

4.1 FUTURES

4.2 IMPLICATIONS

4.3 CHALLENGES

CHAPTER FIVE

5.0 RECOMMENDATIONS, SUMMARY AND CONCLUSION

5.1 RECOMMENDATION

5.2 SUMMARY

5.3 CONCLUSION

REFERENCES

Read Download

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

Related Works