What is the best way to implement a map for solving the travelling salesman (tour) problem in ruby with about 25 cities? Is it best to use a graph and add each distance to each city as a vertex? Or does ruby have a better method for accomplishing this?
Related Questions in RUBY
- how to integrate cashfree payment gateway in ruby on rails project
- RSpec Capybara throwing Selenium error when trying to click a button with browser confirm
- Duplicate GET requests - Rails & Heroku
- convert csv file with json data inside to a column, rows table in 2nd csv file
- Installing dependencies from a gemspec file
- Verifying Google Identity OAuth2 token with Ruby
- Java code of AES/GCM/NoPadding encryption algorithm with authentication tag
- How to fix error in model with gem lockbox
- Cannot install Ruby Gem on Window
- use logstash filter ,aes gcm encrypted in ruby,but cannot decrypted in java
- In Rails 7, what is the right ActiveRecord callback to use if I need to prevent (or rollback) persistance on error?
- How can I go through an array and still remove elements from it
- Nokogiri only returning 5 results
- How do I get the fullscreen mode in firefox?
- undefined group option when using branch reset group regex in Ruby
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?
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?
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)
This is well-traveled territory. :)
"Itinerary for a Traveling Salesman (#142) - by Morton Goldberg
A salesman wants to call on his customers, each of which is located in a different city. He asks you to prepare an itinerary for him that will minimize his driving miles. The itinerary must take him to each city exactly once and return him to his starting point. Can you write a Ruby program to generate such an itinerary?
This problem is famous and known to be NP-complete. So how can you be expected to solve it as a weekend Ruby Quiz project? It's unreasonable isn't it? Yes, it is, unless the conditions are relaxed somewhat."
See the complete page plus multiple solutions in the sidebar on rubyquiz