Optimal Loading, a company in logistics and supply chain management makes profit out of cargo packing...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
Optimal Loading, a company in logistics and supply chain management makes profit out of cargo packing operations. Optimal Loading owns a container with a capacity of 50 tons. Part I: In this question, Optimal Loading has the possibility to choose from 5 different pre-arranged cargo, each of different weight (in tons) and value (in $). The cargoes cannot be split, they must either be packed or be left out the container. Optimal Loading earns profit out of each cargo packed in the container. The sum of the values all the cargoes packed in the container is the value of the container. Cargo 1 2 3 4 5 Weight 10 25 5 15 30 (in tons) Value 20 80 15 40 75 (in $) a) (10 points) What is the value-to-weight ratio of each cargo? Apply the greedy algorithm for the fractional knapsack problem to the packing problem faced by Optimal Loading without splitting cargoes. Which cargoes are packed in the container, what is the weight of the container, and what is the total profit earned by Optimal Loading? b) (10 points) Solve the packing problem of Optimal Loading using Dynamic Programming. Divide the weights of cargoes by their greatest common denominator to reduce the number of operations, and report the table used for the calculations of the algorithm. What is the optimal value of the container? Which cargoes should be packed to achieve this optimal value? c) (5 points) Is the solution found at Question a) optimal? Justify your answer. Part II: The greedy algorithm is very to use compared to the dynamic programming algorithm. This can be useful when decisions have to be made in the field in real-time. Hence, Optimal Loading is now trying to reverse engineer the problem and find situations where the greedy algorithm is optimal. d) (10 points) Assuming the capacity of the container remains 50 tons,. construct an instance of the binary knapsack problem with 3 items named A, B and C, such that the sum of weights of the items is strictly greater than 50 tons and for which the greedy algorithm is optimal. Justify your answer. Report the weights, the value and the value to weight ratio of each item. Report the solution obtained by applying the greedy algorithm to this instance and discuss why this solution is optimal. Optimal Loading, a company in logistics and supply chain management makes profit out of cargo packing operations. Optimal Loading owns a container with a capacity of 50 tons. Part I: In this question, Optimal Loading has the possibility to choose from 5 different pre-arranged cargo, each of different weight (in tons) and value (in $). The cargoes cannot be split, they must either be packed or be left out the container. Optimal Loading earns profit out of each cargo packed in the container. The sum of the values all the cargoes packed in the container is the value of the container. Cargo 1 2 3 4 5 Weight 10 25 5 15 30 (in tons) Value 20 80 15 40 75 (in $) a) (10 points) What is the value-to-weight ratio of each cargo? Apply the greedy algorithm for the fractional knapsack problem to the packing problem faced by Optimal Loading without splitting cargoes. Which cargoes are packed in the container, what is the weight of the container, and what is the total profit earned by Optimal Loading? b) (10 points) Solve the packing problem of Optimal Loading using Dynamic Programming. Divide the weights of cargoes by their greatest common denominator to reduce the number of operations, and report the table used for the calculations of the algorithm. What is the optimal value of the container? Which cargoes should be packed to achieve this optimal value? c) (5 points) Is the solution found at Question a) optimal? Justify your answer. Part II: The greedy algorithm is very to use compared to the dynamic programming algorithm. This can be useful when decisions have to be made in the field in real-time. Hence, Optimal Loading is now trying to reverse engineer the problem and find situations where the greedy algorithm is optimal. d) (10 points) Assuming the capacity of the container remains 50 tons,. construct an instance of the binary knapsack problem with 3 items named A, B and C, such that the sum of weights of the items is strictly greater than 50 tons and for which the greedy algorithm is optimal. Justify your answer. Report the weights, the value and the value to weight ratio of each item. Report the solution obtained by applying the greedy algorithm to this instance and discuss why this solution is optimal.
Expert Answer:
Answer rating: 100% (QA)
a The valuetoweight ratio for each cargo is as follows Cargo 1 20 10 2 Cargo 2 80 25 32 Cargo 3 15 5 ... View the full answer
Related Book For
Supply Chain Logistics Management
ISBN: 978-0078024054
4th edition
Authors: Donald Bowersox, David Closs, M. Bixby Cooper
Posted Date:
Students also viewed these general management questions
-
1. How do Amazon.coms logistics and supply chain management activieites help the company create value for its customers? 2. What systems did Amazon develop to improve the flow of products from...
-
Describe the role that logistics and supply chain management should take in complying with C-TPAT, CSI, AMR, and ACI security initiatives.
-
Technology has improved logistics processes and supply chain management in the last decade. Explain how information systems or Internet technology has improved inventory management, order processing,...
-
Crystal Cleaners dry cleans industrial clothing. The following excerpt from its PPE Subledger shows the component details regarding the dry cleaning equipment: Calculate depreciation on the dry...
-
Over the course of Young & Youngs audit of SQL Group, a publicly traded company, Young & Young concluded that SQLs financial statements presented fairly according to U.S. GAAP, but its internal...
-
Repeat Exercise 23 for the integral 11 4 x3 dx.
-
Electrons are made to flow through the copper strip of Figure P27.57. The strip's cross section is \(1.00 \mathrm{~mm}\) high and \(30.5 \mathrm{~mm}\) wide, and the strip is placed in a...
-
James Streets son, Harold, is 10 years old today. Harold, a studious young fellow, is already making plans to go to college on his 18th birthday, and his father wants to start putting money away now...
-
(a) During the audit of the Weak Bank (W), RBI has suggested that the Bank should either merge with another bank or may close down. Strong Bank (S) has submitted a proposal of merger of Weak Bank...
-
Using the Public MACRO BITCOIN scorecard spreadsheet (linked in its associated masterclass lesson - Long Term 32), create a COPY of it and perform a complete analysis for the date 22/2/2022....
-
A. Semi-strong form of market efficiency requires that the price does not drift prior to the announcement. B. Strong form of market efficiency implies that one cannot forecast where the price will...
-
Explain custodial model of US prison system.?
-
The late 1990s saw a huge number of initial offerings of common stock by Internet start-up companies. How might the lemons model be applied to these initial offerings? Did subsequent events bear out...
-
Describe what the conclusion was from this "consideration" process. Identify and provide details on at least two of the benefits Sam anticipates by pursuing an enterprise architecture approach.
-
Teacher pay and liquor sales A study found a strong positive correlation between average teacher salaries and liquor sales over a 12-month period. Does this suggest that we should not pay teachers...
-
Explain the importance of consistent branding. Next, give an example of a brand or company you feel does an effective job in carrying through it's brand identity through its IMC campaign components...
-
Weights -0.2289 0.0130 0.1657 0.0840 0.5749 -0.0958 0.5285 -0.0415 1.0000 "ort Var "ort S.D. "ort Mean Mean 20 23 26 29 32 35 38 41 44 47 -0.229 63.47 -1.39 -10.71 -8.07 -42.18 6.77 -29.01 4.19...
-
Why can wastewater treatment requirements in Hawaii be less stringent than those in most locations on the U.S. mainland?
-
What is the primary value proposition of Kane Is Ables collaborative distribution service? Be specific concerning how this collaborative distribution service differs from traditional services offered...
-
Distinguish between reliability and character-based trust. Why is character-based trust critical in collaborative relationships?
-
Why are customer operations typically more erratic than manufacturing support and procurement operations?
-
On rare occasions, an organism may have three copies of a chromosome and therefore three copies of the genes on that chromosome (instead of the usual number of two copies). The alleles for each gene...
-
Explain how the miR-200 family of miRNAs behave as tumorsuppressor genes. What happens when their expression is blocked or decreased?
-
Outline the steps that occur when piRITS or piRISC silences transposable elements by repressing transcription and by directly inhibiting TE RNAs, respectively. What is the role of piRNAs in this...
Study smarter with the SolutionInn App