Genetic Algorithms And The Traveling Salesman Problem Using C# And Atl Com

GENETIC ALGORITHMS AND THE TRAVELING SALESMAN PROBLEM USING C# AND ATL COM

Introduction

This project is about an application used by the Traveling 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 many things about genetic algorithm and please don't take take this code as demonstrating a problem to solve using only genetic algorithms (GA). This is just one approach. The C++ code for GA I got from the Internet.

Background (optional)

Disclaimer: I am not a GA and C# expert. I have reused C++ code to make it into a COM component and my goal was to show some visualisation effects using new kid on the block C#. It's only an example of GA coding.Any comments and criticism you have are most welcome.

TABLE CONTENTS

Title Page———i

Certification——–ii

Dedication———iii

Acknowledgement——-iv

Abstract ———vi

Table of Content——–vii

 

Chapter One

1.0 Introduction ——-1

1.1 Statement of Problem——4

1.2 Purpose of the Study——5

1.3 Significance of Study——8

1.4 Limitation——–9

1.5 Scope of Study——-11

 

Chapter Two

2.0 Review of Related Literature —-12

2.6 Summary of Literature Review—- 19

 

Chapter Three

3.0 Research Methodology and Procedure—22

3.1 Population ——–22

3.2 Sample and Sampling Technique—-22

3.3 Validation of the Instrument —-23

3.4 Reliability of the Instrument —–23

3.5 Data Analysis. 3.5 Data Analysis.. 3.5 Data Analysis.——-23

 

Chapter Four

4.0 Presentation and Discussion of Result—24

4.1 Analysis and interpretaion of Data—25

4.2 Discussion of Results——38

 

Chapter Five

5.0. Summary, Conclusion, and Recommendation  –40

5.1 Summary——–40

5.2 Conclusion——–41

5.3 Recommendation——42

References ———45

Appendix 1——–47

Appendix ———50

GET MORE COMPUTER SCIENCE MATERIALS HERE

Sharing is caring!

Leave a Reply

shares