Genetic Algorithm And Travelling Salesmen Problem Using C# And Atl Com

ProjectStoc - 54 pages 5980 words 1699 views Project Diploma/Degree/Masters Level Computer Science ₦3000 Naira ($7.89 USD)

This is a Premium work, paid access only

Register/Login to Access Full 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

Disclaimer: Note this academic material is intended as a guide for your academic research work. Do not copy word for word. Note: For Computer or Programming related works, some works might not contain source codes

CITE THIS WORK

(2014, 08). Genetic Algorithm And Travelling Salesmen Problem Using C# And Atl Com.. ProjectStoc.com. Retrieved 08, 2014, from https://projectstoc.com/read/2852/genetic-algorithm-and-travelling-salesmen-problem-using-c-and-atl-com-985
"Genetic Algorithm And Travelling Salesmen Problem Using C# And Atl Com." ProjectStoc.com. 08 2014. 2014. 08 2014 <https://projectstoc.com/read/2852/genetic-algorithm-and-travelling-salesmen-problem-using-c-and-atl-com-985>.
"Genetic Algorithm And Travelling Salesmen Problem Using C# And Atl Com.." ProjectStoc.com. ProjectStoc.com, 08 2014. Web. 08 2014. <https://projectstoc.com/read/2852/genetic-algorithm-and-travelling-salesmen-problem-using-c-and-atl-com-985>.
"Genetic Algorithm And Travelling Salesmen Problem Using C# And Atl Com.." ProjectStoc.com. 08, 2014. Accessed 08, 2014. https://projectstoc.com/read/2852/genetic-algorithm-and-travelling-salesmen-problem-using-c-and-atl-com-985.

Connect with Us