Write a function that takes a cost matrix and uses the Minimum Spanning (Matching Approach) algorithm to produce a Travelling Salesman Problem solution. This function should output the TSP final tour as well as the cost of the tour. Comment your code appropriately to show an understanding of logic as well as the procedure. Demonstrate the performance of your code using CostMat.

Write a function that takes a cost matrix and uses the Minimum Spanning (Matching Approach) algorithm to produce a Travelling Salesman Problem solution. This function should output the TSP final tour as well as the cost of the tour. Comment your code appropriately to show an understanding of logic as well as the procedure. Demonstrate the performance of your code using CostMat.

Principles of Information Systems (MindTap Course List)

12th Edition

ISBN:9781285867168

Author:Ralph Stair, George Reynolds

Publisher:Ralph Stair, George Reynolds

Chapter10: Information And Decision Support Systems

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

You are organizing a big dinner party for your company retreat. To increase social interaction among the various departments in your company, you would like to set up a seating arrangement so that no two members of the same departments are at the same table. Show how to formulate the problem of finding a seating arrangement that meets this objective as a maximum flow problem. Assume that the company has n departments, and the ith department has mi members. Also assume that t tables are available and the jth table has a seating capacity of cj. Provide a step by step algorithm for this problem for maximizing the flow and analyze its running time.
Although the plot function is designed primarily for plotting standard xy graphs, it can be adapted for other kinds of plotting as well. b. Make a plot of the curve, which is defined parametrically by the equations x = 2cosθ + cos2θ, y = 2sinθ - sin2θ, where 0 < θ < 2π. Take a set of values of θ between zero and 2π and calculate x and y for each from the equations above, then plot y as a function of x. b. Taking this approach a step further, one can make a polar plot r = f(θ) for some function f by calculating r for a range of values of θ and then converting r and θ to Cartesian coordinates using the standard equations x = r cosθ, y = r sinθ. Use this method to make a plot of the function r = ecosθ – 2 cos(4θ) + sin5 (θ/12) in the range 0 <= θ <= 24π. use python code to answer the highlight one
4) What are the key components of a dynamic programming algorithm, and how do they work together to solve a problem? 5) How do you choose the appropriate data structures and algorithms to use when imple- menting a dynamic programming solution? 6) What are some common examples of problems that can be solved using dynamic pro- gramming, and what are the optimal solutions for these problems? (Providing examples from the class lectures is allowed.)
Consider the code of commission problem given below. List all du-paths for variables ‘sales’ and ‘commission’ . Which of the du paths are definition-clear? Are there any paths which are not feasible? If yes, why are they not feasible? Explain.
Answer the following: This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3=1 and −1 to any position with O3=1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)−(3O2(s)+O1(s)). a. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one O on the board), taking symmetry into account. b. Mark on your tree the evaluations of all the positions at depth 2. c .Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move. Provide original solutions including original diagram for part a!
Answer the following: This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3=1 and −1 to any position with O3=1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)−(3O2(s)+O1(s)). a. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one O on the board), taking symmetry into account. b. Mark on your tree the evaluations of all the positions at depth 2. c .Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move. Provide original solution!
For Hamming’s rule, d = 4 and m = 3 is a “perfect” solution to 2m = m + d + 1. For the next smaller perfect solution; that is, m<3, d<4, what is m? , what is d? Construct or imagine constructing the Hamming code (the table) for this new perfect solution. Using the same format as the table in the previous question, and leaving out the top 2 rows, how many rows in the table? How many columns? Leave out the column with D and the ? mark. What is another name for this code? (Besides Hamming (3,1) What is the hamming distance of this code?
Which of the following is true about divide and conquer approach for solving recurrence relations with overlapped sub-problems? a divide step does not work for such recurrence relations b overlapped sub-problems are ignored automatically c it tries to repeatedly solve common sub-problems d It avoids redundant work and works efficiently
Please don't use handwritting for this question How would you modify the dynamic programming algorithm for the coin collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X’s. How many optimal paths are there for this board? You need to provide 1) a modified recurrence relation, 2) a pseudo code description of the algorithm, and 3) a table that stores solutions to the subproblems.
how can we represent restaurant shop education etc in this problem?
A problem with optimization is specified:The input is one instance as a prerequisite.Postconditions: The result is one of the acceptable solutions in this situation, with the best (minimum or maximum, as appropriate) success metric. (The outputted solution need not be original.)
Write the general form of the ARIMA(p, d, q) model. What do the values p, d, and q representin this equation?