Answer only 3.3 please. you need matlab for this. 3.31, Logistics: Route Planning Suppose we have a
Fantastic news! We've Found the answer you've been seeking!
Question:
Answer only 3.3 please. you need matlab for this.
Transcribed Image Text:
3.31, Logistics: Route Planning Suppose we have a business operating in six cities around the Pacific Rim: San Diego, San Francisco, Tokyo, Shanghai, Manila, and Honolulu. We are interested in counting the number of ways we can travel from one city to another with at most n stopovers. We look up all the direct flights and put them in a table: Destination San Diego San Francisco San Francisco San Diego, Tokyo, Shanghai, Manila, Honolulu Tokyo San Francisco, Shanghai, Manila Shanghai San Diego, San Francisco, Tokyo, Manila Manila Tokyo, Shanghai, Honolulu Honolulu San Francisco, Shanghai, Manila Let's say we want to get from San Diego to Manila with at most three stops along the way. For example, the trip going from San Diego through San Francisco, then Honolulu, then Shanghai, then Manila is a trip with exactly three stops.. Exercise 3.2 List all possible ways to get from San Diego to Manila with exactly three stops. Doing that last exercise by hand is a pain because there are so many cases to check, and this is a relatively simple example. If we want to do this efficiently, linear algebra is the perfect tool. We'll start by encoding the data from our table into what's called an adjacency matrix. The first step is to number our cities in the order they are listed: San Diego is 1, San Francisco is 2, and so on. We now determine the entries of our adjacency matrix, which we will call A, using the following rule: if there is a flight from city i to city, then the entry A, is set to 1. Otherwise, we set that entry to 0. We will also set all of the diagonal entries to 0. since you can't take a flight from a city to itself. This procedure gives us the following matrix A: 010000 101 111 010110 111010 001101 010110 What's neat about this is that the powers of A have useful information too. For example, take the entry (A) (ie, the entry of A in the third row and sixth column). We compute this as (A)6 AA+AA+AA+AA+AA + A6A6 Let's look at the terms here: AAs is 1 if and only if both A and As are 1. This means we get a 1 for the th term if and only if we can fly from Tokyo (city 3) to city k and from city k to Honolulu (city 6). Thus, (A) counts the number of ways to fly from Tokyo to Honolulu with exactly one stop. Similar reasoning shows that the number of ways of flying from city / to city with exactly n stops is just (A) Exercise 3.3 a. Enter the above adjacency matrix A into MATLAB. By looking at the entry of A in the first row and the fifth column, find the number of ways to get from San Diego to Manila with exactly three stops. Does your answer here agree with your explicit count in the previous exercise? If not, find the missing trips. Include your input and output in your document. b. Now use MATLAB find the number of ways to get from San Francisco to Tokyo with at most four stops. (This is not the same as finding the number of ways with exactly four stops!) Include all of your commands and output in your write-up. Note 3.1: As you may have realized, the method we've just used counts silly trips like San Francisco - Shanghai San Francisco - Shanghai as a trip with two stops. User beware! 3.31, Logistics: Route Planning Suppose we have a business operating in six cities around the Pacific Rim: San Diego, San Francisco, Tokyo, Shanghai, Manila, and Honolulu. We are interested in counting the number of ways we can travel from one city to another with at most n stopovers. We look up all the direct flights and put them in a table: Destination San Diego San Francisco San Francisco San Diego, Tokyo, Shanghai, Manila, Honolulu Tokyo San Francisco, Shanghai, Manila Shanghai San Diego, San Francisco, Tokyo, Manila Manila Tokyo, Shanghai, Honolulu Honolulu San Francisco, Shanghai, Manila Let's say we want to get from San Diego to Manila with at most three stops along the way. For example, the trip going from San Diego through San Francisco, then Honolulu, then Shanghai, then Manila is a trip with exactly three stops.. Exercise 3.2 List all possible ways to get from San Diego to Manila with exactly three stops. Doing that last exercise by hand is a pain because there are so many cases to check, and this is a relatively simple example. If we want to do this efficiently, linear algebra is the perfect tool. We'll start by encoding the data from our table into what's called an adjacency matrix. The first step is to number our cities in the order they are listed: San Diego is 1, San Francisco is 2, and so on. We now determine the entries of our adjacency matrix, which we will call A, using the following rule: if there is a flight from city i to city, then the entry A, is set to 1. Otherwise, we set that entry to 0. We will also set all of the diagonal entries to 0. since you can't take a flight from a city to itself. This procedure gives us the following matrix A: 010000 101 111 010110 111010 001101 010110 What's neat about this is that the powers of A have useful information too. For example, take the entry (A) (ie, the entry of A in the third row and sixth column). We compute this as (A)6 AA+AA+AA+AA+AA + A6A6 Let's look at the terms here: AAs is 1 if and only if both A and As are 1. This means we get a 1 for the th term if and only if we can fly from Tokyo (city 3) to city k and from city k to Honolulu (city 6). Thus, (A) counts the number of ways to fly from Tokyo to Honolulu with exactly one stop. Similar reasoning shows that the number of ways of flying from city / to city with exactly n stops is just (A) Exercise 3.3 a. Enter the above adjacency matrix A into MATLAB. By looking at the entry of A in the first row and the fifth column, find the number of ways to get from San Diego to Manila with exactly three stops. Does your answer here agree with your explicit count in the previous exercise? If not, find the missing trips. Include your input and output in your document. b. Now use MATLAB find the number of ways to get from San Francisco to Tokyo with at most four stops. (This is not the same as finding the number of ways with exactly four stops!) Include all of your commands and output in your write-up. Note 3.1: As you may have realized, the method we've just used counts silly trips like San Francisco - Shanghai San Francisco - Shanghai as a trip with two stops. User beware!
Expert Answer:
Answer rating: 100% (QA)
33 a Program code screen shot Sample Output Program code to copy define the Adjacency matrix as specified in the question that is each row is corresponds to the source city and each column specifies t... View the full answer
Related Book For
Understanding Basic Statistics
ISBN: 9781111827021
6th Edition
Authors: Charles Henry Brase, Corrinne Pellillo Brase
Posted Date:
Students also viewed these programming questions
-
Need MATLAB code for this. Please perform only on MATLAB. Attach the output also. R(s) C(s) G(s) H(s) Figure I1.1: Negative feedback system.
-
You have two choices for this written assignment; you only need to address one. Topic 1: The cost of healthcare has been a controversial subject for quite some time, both to businesses and employees....
-
You may need Table to answer the following questions. a. Which is the stronger acid, HCl or H2O? b. Which is the stronger acid, H2O or HNO2? c. Which is the stronger acid, HCN or HOC6H5? Table...
-
Incorporated in 1990, Raju Diary Ltd is one of the leading manufacturers and marketers of diary-based branded foods in India. In the initial years, its operations were restricted only to the...
-
KVS Pharmacy fills prescriptions for a popular childrens antibiotic, Amoxycilin. The daily demand for Amoxycilin is normally distributed with a mean of 200 ounces and a standard deviation of 80...
-
Crosley Corp. sold an investment on an installment basis. The total gain of $60,000 was reported for financial reporting purposes in the period of sale. The company qualifies to use the...
-
What questions to ask a witness in a deposition?
-
A rod of diameter D = 25 mm and thermal conductivity k = 60 W/m. K protrudes normally from a furnace wall that is at Tw = 200C and is covered by insulation of thickness L ins = 200 mm. The rod is...
-
1. Differentiate between micro-skills and macro-skills. 2. define "self-fulfilling prophecies". Provide an example. 3. Explain why the Pyramid Mode of Intercultural Competence is vital to our...
-
Pik Corporation acquired 80 percent of Sel Corporation's common stock on January 1, 2011, for $210,000 cash. The stockholders' equity of Sel at this time consisted of $150,000 capital stock and...
-
A diver dived 1 5 0 . 4 m deep in the sea. The density of the seawater is 1 0 2 0 kg / m 3 . The acceleration of gravity is 9 . 8 m / s 2 . Determine the gage pressure at the depth of H in the sea in...
-
The franchise organization is the most common type of contractual vertical marketing system. Vertical conflict, conflict between different levels of the same channel, is common in this channel....
-
According to the Fabletics company website, www. fabletics.com, JustFab Inc. co-CEOs Don Ressler and Adam Goldenberg launched Fabletics with Kate Hudson after they saw a gap in the activewear...
-
According to one survey, 92 percent of U.S. companies now claim that social media marketing is important for their businesses. Fashion designer Kenneth Cole took advantage of the trend in 2011 by...
-
In small groups, using the five core customer and marketplace concepts, discuss how the following companies address the first step in the marketing process: (a) Uber, (b) Dunkin, (c) Dannon, and (d)...
-
Identify the error in Table 3.10, showing consumer prices and the change in prices based on a price index equal to 100 in 2000. Table 3.10 Year Price Index Change from Previous Year Change from 2000...
-
What can someone learn or understand of what digital governance entails, and what can be examples on how it can be applied in the institutions or work environment?
-
Don Griffin worked as an accountant at a local accounting firm for five years after graduating from university. Recently, he opened his own accounting practice, which he operates as a corporation....
-
Case studies showed that out of 10,351 convicts who escaped from U.S. prisons, only 7867 were recaptured (The Book of Odds by Shook and Shook, Signet). (a) Let p represent the proportion of all...
-
Look at the following diagrams. Does each diagram show high linear correlation, moderate or low linear correlation, or no linear correlation? (a) (b) (c)
-
Categorize these measurements associated with a robotics company according to level: nominal, ordinal, interval, or ratio. (a) Salespersons performance: below average, average, above average (b)...
-
This is a simple exercise to familiarize you with the kind of information that is presented in the financial statements. Examine the three primary statements presented above to discover the following...
-
Outline the content and purpose of the statement of financial position.
-
The IASB acknowledges within the Conceptual Framework that general-purpose financial reports cannot provide all the information that users may need to make economic decisions. They suggest that users...
Study smarter with the SolutionInn App