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?
Best way to implement a map for TSP
343 Views Asked by Luminusss At
1
There are 1 best solutions below
Related Questions in RUBY
- Best way to make an HABTM association via console
- undefined method `namespace' for main:Object (NoMethodError) - active record / rakefile
- Ruby destroy is not working? Or objects still present?
- Trying to set the value of an input with mechanize
- How to split the logic in a ruby game
- How can I monitor an endpoint's status with Ruby?
- Why can a private class method be explicitly invoked in Ruby?
- Rails - Ajax do not work properly on production server
- syntax error, unexpected kEND
- Carrierwave file upload with different file types
- b.javascript_dialog().exists? is not working for me in WATIR 4.0.2
- Combine two arrays of hashes
- Building a simple calculator form in Rails 4
- How do I update create route from rails 3 to 4
- Comparison of Fixnum with nil failed - palindrome program Ruby
Related Questions in TRAVELING-SALESMAN
- How do I keep track of path in TSP?
- How to do a math optimization (TSP) in R, perhaps with optim()
- TSP taking into account shapes of cities
- How to modify this Held-Karp algorithm to search for Hamiltonian path instead of cycle?
- does OptaPlanner take care of TSPTW (or VRPTW ) with optional nodes?
- a variation of TSP : limit time, visit as many nodes as possible
- Best way to implement a map for TSP
- Traveling Salesman (TSP) variation
- Travelling salesman dynamic programming implementation
- Solving Travelling Salesman with Tabu Search
- c++: Access to private variables in abstract base class
- traveling salesman without return and with given start and end cities
- How to distribute points across the panel based on distance data?
- How do I read data from TSPLIB / tsp files?
- Understanding EUC_2D edge weighting
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 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?
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