I was just wondering if all algorithms for the TSP will give the same optimum routes? I thought that this would be the case but ive implemented branch and bound and A* and they both give very different results to the same input, I was just wondering if this is normal?
Will all TSP algorithms give the same optimum route?
522 Views Asked by thrash At
2
There are 2 best solutions below
0
Martín Valdés de León
On
No. Provided more than one optimal route exists, different algorithms will not necesarily find the same path. It will depend on the implementation, and I assume it will also depend on how you label the graph, so that different labelings will make the same algorithm find different routes.
Related Questions in A-STAR
- Hospital route finding ai project
- Struggling with A* Pathfinding in C#
- Simplify 2D map to optimize pathfinding
- Applying Dijkstra Algorithm To Find Lowest Energy Path
- Implementing A star algorithm to sliding tile puzzle game using C# forms
- How does this specific version of A-star algorithm work?
- I'm having troubles with the A* Algorithim implementation in Java, why is it being infinite?
- How to solve 8-Puzzle Using A* (a-star) Algorithm with Manhattan Distance as heuristic
- A star Pathfinding algorithm with Lego Mindstorms ev3
- Having trouble with delaunay, minimum spanning tree and astar for level generation
- Why does this implementation of the A* algorithm use only one queue?
- Fill a list to use the A* (a-star) algorithm with python
- I'm trying to solve, Advent of Code Day 17 Part 2. I get the correct answer to Part 1 but when i modified to solve P2 I get the wrong answer for input
- Why my A* algorithm isn't working when I specify a node weight?
- Choosing proper heuristic for A* algorithm in subway network
Related Questions in TRAVELING-SALESMAN
- TSP optimization using K-means recursively in python: clusters connections problem
- How to show multiple roads using leaflet in R
- Parallelizing Traveling Salesman Problem Code in C using OpenMP
- Obtaining the resulting graph from ShortestPathsDijkstra
- Shortest path from A to B
- How to approach this optimization/scheduling problem? (Similar to Traveling Salesman Problem)
- How to get python to deal with very small numbers?
- How to extend TSP to MTSP using Pulp
- Optimise waypoints to reach the destination
- Explain the "Decision" element in salesflow
- Constructing result for given word's order and overlapping in Shortest Superstring Problem
- How to track path in Travelling Salesman Problem solved using DP and bitmasking
- What are some good resources for genetic algorithm pathing that aren't JUST shortest distance?
- Variation of TSP which needs to visit only a set of cities but can visit cities outside the set if necessary
- How to output the lexicographically smallest one shortest superstring?
Related Questions in BRANCH-AND-BOUND
- How To Optimize A Branch-And-Bound Optimization With Constraints
- Vanilla BnB on 0/1 knapsack using Python
- Timetable assign slot and room to classes
- Best initial - final position associations problem in c++ with branch and bound algorithm
- Can I write Gurobi log file in csv form?
- Solving Linear Program with Branch-and-Bound
- R leaps package error in coef when collinear variables
- Modified TSP with Branch-and-Bound algorithm
- Do dynamic programming and branch and bound give same result when solving 0/1 knapsack problem?
- Create custom branches for cplex
- Branch and bound method for rcpsp
- GRBCallback for nodes count and LP relaxation of a MILP
- Can Cplex prioritize a variable over the others when branching?
- Getting the reason why a node in SCIP was pruned
- Changing a parameter while branching in SCIP
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The route my differ, but the cost of all optimal solution should be the same.
If your A* solution is more expensive, than your heuristic is wrong. Have a look at wikipedia A* algorithm for proofs that it always finds an optimal solution.