Implementation of Genetic Algorithm to approximately solve the Euclidian Traveling Salesman Problem.
You will need .NET v4 installed on your machine.
To run the program follow these commands:
...> git clone https://github.com/wadoodislam/GeneticAlgorithm4TSP.git...> cd GeneticAlgorithm4TSP...> C:\Windows\Microsoft.NET\Framework\v4.0.30319\msbuild GeneticAlgorithm4TSP.csproj...> copy *.txt bin\Debug...> bin\Debug\GeneticAlgorithm4TSP
You will need dotnet-sdk-2.2 installed on your machine. you can find instructions for this here
To run the program follow these commands:
~$ git clone https://github.com/wadoodislam/GeneticAlgorithm4TSP.git~$ dotnet new console -o <name for new project>~$ cd GeneticAlgorithm4TSP~$ cp -r !(*.csproj|*.config) ../<name for new project>/~$ cd ../<name for new project>/~$ dotnet run
This was a week-long project built during Computational Intelligence course as a midterm project at the National University of Computer and Emerging Sciences. Project goals included acquiring practical hands-on experience on Genetic Algorithm and compare results changing its various parameters.
This project helped me understand and acquire in-depth knowledge of genetic algorithm dynamics and taught me how can we translate a problem to chromosomes to apply evolutionary algorithms and how different parameters of the algorithm like mutation rate, crossover, and selection methods play vital roles in the accuracy and completion time of the algorithm.
The language used to implement this project in C# (c-sharp). I choose C# because it is a sophisticated object-oriented language that allowed me to implement the genetic algorithm without giving to much high-level abstraction while keeping the code clean and modular.
Please fork this repository and contribute back using pull requests.
Any contributions, large or small, major features, bug fixes, additional language translations, unit/integration tests are welcomed and appreciated but will be thoroughly reviewed and discussed.