Solving the traveling salesman problem

Question

1.00/5 (2 votes)

See more:

The Traveling Salesman Problem (TSP) is a classic optimization problem in computer science. Given a list of cities and the distances between each pair of cities, the goal is to find the shortest possible route that visits each city exactly once and returns to the starting city.

What I have tried:

Your task is to write an algorithm to solve the TSP for a large number of cities efficiently. The current algorithm you have implemented has a time complexity that grows exponentially with the number of cities, making it impractical for larger datasets.

Posted 10-Oct-23 2:17am

MD Samiul Islam

Add a Solution

Comments

Graeme_Grant 10-Oct-23 8:22am

Lol, are you asking us to do your homework assignment for you?

If you want someone to write code for you, then there are these services:
* fiverr[^]
* Upwork[^]
* Freelancer[^]
* Guru[^]
* PeoplePerHour[^]
* TaskRabbit[^]
* Karat[^]

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Mike Hankey · Answer 1 · 2023-10-10T02:44:00

Solution 1

If you google "Traveling Salesman Problem" you get 20,200,000 hits.

This is just one of them;
Travelling Salesman Problem using Dynamic Programming - GeeksforGeeks[^]
This will get you started.

Posted 10-Oct-23 2:44am

Mike Hankey

Comments

CPallini 10-Oct-23 9:08am

Indeed. My 5.