Traveling Salesman Problem optimization implemented in Excel and Excel VBA
$30-250 USD
Ολοκληρώθηκε
Αναρτήθηκε περίπου 6 χρόνια πριν
$30-250 USD
Πληρωμή κατά την παράδοση
Hello,
I want an implementation of the traveling salesman problem (the shortest path that connects all points) that I can use to study how algorithms can quickly find a near-optimal solution when an exact solution is much harder or impossible.
Since, I am using this for personal study, the code should be HEAVILY commented with what is happening.
Input: lists of up to 200 X and Y coordinates
Output: The input coordinates reordered to minimize total distance point successlive point. Near-optimum solution to the path that connects all points together.
Solution should use a method that is known to quickly converge on a near-optimum solution.
Hello
I am Excel Expert and VBA Developer
Actually I am Classical coder so can deliver desirable result with comments all over the code
So,
If interested, let me know
Thanks
$235 USD σε 1 ημέρα
4,9 (163 αξιολογήσεις)
6,9
6,9
3 freelancers δίνουν μια μέση προσφορά $328 USD για αυτή τη δουλειά
Hi there, I am good in vba and numbers, I understand Travelling Salesman Problem and can implement an optimum solution near to perfect. I will build my own algorithm. But it needs more budget. Thanks