Looking for someone with experience in Evolutionary Algorithms and Python to develop an EA for the Travelling Salesman Problem (TSP). The algorithm must include:
The algorithm should apply these concepts above and any other additional functionality of your choosing to make the algorithm as efficient as possible. The goal output of the algorithm is to find the best solution to the TSP.
The focus is to get WesternSahara and Uruguay cities working efficiently and accurately, but if you can get Canada cities working well I will look into awarding a bonus.
The instance .txt files are named with the format TSP_[country]_[#cities]. In the instance files, each row provides the two-dimensional coordinates of a city. The fitness should be computed as the complete tour length (starting and ending at the same city). The distance of two cities is the Euclidean distance of their coordinates.
Attached are the .txt instance files and a description with a possible sample output for the algorithm.
8 pekerja bebas membida secara purata $194 untuk pekerjaan ini
Hi, We are a team of java and python developers who ensure on time task completion with complete customer satisfaction. Please find our portfolio below [login to view URL]
Hello, I am experienced python expert in optimsiation. I can help with this task with quick turnaorund. Looking to hearing from you. Kind regards PS: I have worked on EA before.