This repository was created to develop a university work on Algorithm Optimization using Genetic Algorithm. The algorithm developed in this repository did some genetic mutations to find a shorter way to "visit" all cities defined in data.txt file . You can find more information about the problem in the T4 file in this repository.
- Java
- text file with the coordinates like the data.txt file
2009
65.6478 68.3254 Cid1000
89.0871 36.2876 Cid2000
64.1672 69.7815 Cid1100
74.5157 38.6061 Cid100
61.4885 72.8648 Cid1200
83.9234 43.4349 Cid200
55.6619 80.0086 Cid1300
58.7336 49.7081 Cid300
54.0667 85.0806 Cid1400
58.9828 54.6119 Cid400
....
First, you need compile the project using:
javac Main.java
After, run the project with:
java Main
So, you will be getting the best paths as the algorithm finds them.