Julia is a freelance hakers. She receives a few cake orders, for this Saturday. Since she got quite a number of orders on the same day, so she needs to deliver the cakes in an optimal way. She has studied the distance (in kilameter) to each location, as shown in Table 1. The data shown in upper triangular matrix only. This means that the distance between two locations is same from location a to location b and the other way round. While o means there is no direct route between two locations. Table 1: Distance of the locations 2 3 4 5 6 7 8 9 1 10 1 5.1 12.5 13.0 7.5 13.5 00 00 24.1 00 2 7.2 9.2 00 c0 ca 00 00 00 3 80 00 00 00 21.5 00 33.2 8.5 00 15.5 14.1 00 00 11.5 10.5 17.3 00 00 6 11.2 0 11.1 00 7 89 13.8 12.7 co 8.5 12.1 10 (a) In your opinion, what is the objective of this problem? (b) Propose an algorithm to solve the problem. () Solve the problem using the proposed algorithm. (d) Report the output of the problem.

Julia is a freelance hakers. She receives a few cake orders, for this Saturday. Since she got quite a number of orders on the same day, so she needs to deliver the cakes in an optimal way. She has studied the distance (in kilameter) to each location, as shown in Table 1. The data shown in upper triangular matrix only. This means that the distance between two locations is same from location a to location b and the other way round. While o means there is no direct route between two locations. Table 1: Distance of the locations 2 3 4 5 6 7 8 9 1 10 1 5.1 12.5 13.0 7.5 13.5 00 00 24.1 00 2 7.2 9.2 00 c0 ca 00 00 00 3 80 00 00 00 21.5 00 33.2 8.5 00 15.5 14.1 00 00 11.5 10.5 17.3 00 00 6 11.2 0 11.1 00 7 89 13.8 12.7 co 8.5 12.1 10 (a) In your opinion, what is the objective of this problem? (b) Propose an algorithm to solve the problem. () Solve the problem using the proposed algorithm. (d) Report the output of the problem.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 8RP

See similar textbooks

Similar questions

Can anyone help me with this question? Assume there is a villiage with 3 houses whose owner's strongly dislike eachother. So they wish to make sure not to run into each other on their daily shopping trips to the four different shops in the villiage. a, can they build a road from every house to every shop such that 2 roads never cross? (roads do not have to be straight) b, what is the maximal number of shops for which the house owners could build non intersecting roads? Justify the answer. Thank you
Given a matrix of dimension m*n where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0: Empty cell 1: Cells have fresh oranges 2: Cells have rotten oranges So we have to determine what is the minimum time required so that all the oranges become rotten. A rotten orange at index [i,j] can rot other fresh orange at indexes [i-1,j], [i+1,j], [i,j-1], [i,j+1] (up, down, left and right). If it is impossible to rot every orange then simply return -1. Examples: Input: arr[][C] = { {2, 1, 0, 2, 1}, {1, 0, 1, 2, 1}, {1, 0, 0, 2, 1}}; Output: All oranges cannot be rotten. Below is algorithm. 1) Create an empty Q. 2) Find all rotten oranges and enqueue them to Q. Also enqueue a delimiter to indicate beginning of next time frame. 3) While Q is not empty do following 3.a) While delimiter in Q is not reached (i) Dequeue an orange from queue, rot all adjacent oranges. While rotting the adjacents, make sure that time frame is incremented only once. And time frame is…
Correct answer will be upvoted else downvoted. Computer science. way from block u to impede v is an arrangement u=x0→x1→x2→⋯→xk=v, where there is a street from block xi−1 to obstruct xi for each 1≤i≤k. The length of a way is the amount of lengths over all streets in the way. Two ways x0→x1→⋯→xk and y0→y1→⋯→yl are unique, if k≠l or xi≠yi for some 0≤i≤min{k,l}. Subsequent to moving to another city, Homer just recollects the two unique numbers L and R yet fails to remember the numbers n and m of squares and streets, separately, and how squares are associated by streets. Be that as it may, he accepts the number of squares ought to be no bigger than 32 (on the grounds that the city was little). As the dearest companion of Homer, if it's not too much trouble, let him know whether it is feasible to view as a (L,R)- constant city or not. Input The single line contains two integers L and R (1≤L≤R≤106). Output In case it is difficult to track down a (L,R)- ceaseless city…
In this question you will explore the Traveling Salesperson Problem (TSP). (a) In every instance (i.e., example) of the TSP, we are given n cities, where each pair of cities is connected by a weighted edge that measures the cost of traveling between those two cities. Our goal is to find the optimal TSP tour, minimizing the total cost of a Hamiltonian cycle in G. Although it is NP-complete to solve the TSP, we found a simple 2-approximation by first generating a minimum-weight spanning tree of G and using this output to determine our TSP tour. Prove that our output is guaranteed to be a 2-approximation, provided the Triangle Inequality holds. In other words, if OP T is the total cost of the optimal solution, and AP P is the total cost of our approximate solution, clearly explain why AP P ≤ 2 × OP T.
Answer the given question with a proper explanation and step-by-step solution and don't copy past from online source. Find an optimal parenthesization and the minimum number of scalar multiplications needed for a matrix-chain product whose sequence of dimensions is (5,10,3,12,5,50. Show all the steps used to arrive at the solution.
Three products are manufactured on one machine. The preparation time of each product is 2,3 and 4 minutes respectively, and the process time of 3, 2 and 1 minutes. The benefit provided byeach product is respectively 12, 10 and 15 UM. There are 100 machine minutes and 200for its preparation. Determine the optimal number of units to manufacture of eacharticle.do it in Jupyter Notebook (.ipynb) with the code, the tables of the simplex method and the graphs of theoptimal solution.Identify the decision variables that will represent the quantity of each productto manufacture.Formulate the linear programming problem to maximize total profitsubject to the given restrictions.
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.
Solve part a using the given info
I want unique answer Apply the DP based MCM algorithm to determine optimal parenthesization among the following matrices: A17 x 1 A21 x 5 A35 x 4 A44 x 2
Use a computer to plot formula 2.22 directly, as follows. Define z = qA/q, so that (l-z) = qB/q. Then, aside from an overall constant that we'll ignore, the multiplicity function is [4z(1-z)]N, where z ranges from 0 to 1 and the factor of 4 ensures that the height of the peak is equal to 1 for any N. Plot this function for N = 1, 10, 100, 1000, and 10,000. Observe how the width of the peak decreases as N increases.
Develop a simulated annealing procedure in either R or Python to solve the following knapsack problem: (Note, this problem can be solved to optimality using integer programming; however, the focus of this question is on developing the simulated annealing method). Maximize: 12x1 + 16x2 + 22x3 + 8x4 S.T. 4x1 + 5x2 + 7x3 + 3x4 ≤ 14 xi ~ binary for all i
USE PIGEONHOLE PRINCIPLE, WITH A PIGEONHOLE FORMULA 1.1. Assuming no one has more than 1,000,000 hairs on the head of any person and that the population of Manila was 11,621,500 in 2009, there had to be at least _____ people in Manila in 2009 with the same number of hairs on their heads. 1.2. Choosing any ___ consecutive integers, we can guarantee that at least two of them have the same remainder when divided by 100