Question 1. Consider the problem from the previous assignment, in which you are designing a control...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
Question 1. Consider the problem from the previous assignment, in which you are designing a control software for a robot that moves packages ariving via automated lines. The number of packages that arrive in a period t = 1,..., N is a random variable and the number of packages arriving in each period is independent of the number of those arriving in other periods. Suppose that pi denotes the probability that i packages arrive in a period (i = 0, 1, ..., m), where i=0 Pi = 1. The expected number of arriving packages in a period is positive. At the end of each period, the robot may move packages to the shipping dock. If the robot takes packages for moving, then it takes all packages that have arrived so far and have not yet been moved. The maximal number of packages that the robot can move in one load is M > m. The cost of moving is K > 0 and the moving time is negligible. The cost incurred in each period is w > 0 for each package that has not been moved. All packages, if any, must be moved to the shipping dock in period N. (Q1.1) Formulate an infinite horizon problem to determine an optimal moving policy that minimizes the combined doscounted expected costs of moving and waiting. The discount factor is 0.9. (Q1.2) Argue that the optimal moving policy for the problem in (Q1.1) is a stationary Markov policy with a threshold decision rule: move if x > x* and wait (do not move) if x x*. Question 2. You are designing a control software for a robot moving packages that arrive via automated lines in a storage room. The number of packages that arrive in one period t = 1,..., N is a random variable and the number of packages arriving in each period is independent of the number of those arriving in other periods. Suppose that p; denotes the probability that i packages arrive in a period (i=0,1,...,m), where o Pi = 1. The expected number of arriving packages in a period is positive. At the end of each period, the robot may move packages to the shipping dock. If the robot takes packages for moving, then it takes all packages that have arrived so far and have not yet been moved. The maximal number of packages that the robot can move in one load is M > 1. The cost of moving is K > 0 and the moving time is negligible. The cost incurred in each period is w > 0 for each package that has not been moved. All packages, if any, must be moved to the shipping dock in period N. Formulate a Markov decision problem to determine an optimal moving policy that minimizes the combined expected costs of moving and waiting over N periods. Question 1. Consider the problem from the previous assignment, in which you are designing a control software for a robot that moves packages ariving via automated lines. The number of packages that arrive in a period t = 1,..., N is a random variable and the number of packages arriving in each period is independent of the number of those arriving in other periods. Suppose that pi denotes the probability that i packages arrive in a period (i = 0, 1, ..., m), where i=0 Pi = 1. The expected number of arriving packages in a period is positive. At the end of each period, the robot may move packages to the shipping dock. If the robot takes packages for moving, then it takes all packages that have arrived so far and have not yet been moved. The maximal number of packages that the robot can move in one load is M > m. The cost of moving is K > 0 and the moving time is negligible. The cost incurred in each period is w > 0 for each package that has not been moved. All packages, if any, must be moved to the shipping dock in period N. (Q1.1) Formulate an infinite horizon problem to determine an optimal moving policy that minimizes the combined doscounted expected costs of moving and waiting. The discount factor is 0.9. (Q1.2) Argue that the optimal moving policy for the problem in (Q1.1) is a stationary Markov policy with a threshold decision rule: move if x > x* and wait (do not move) if x x*. Question 2. You are designing a control software for a robot moving packages that arrive via automated lines in a storage room. The number of packages that arrive in one period t = 1,..., N is a random variable and the number of packages arriving in each period is independent of the number of those arriving in other periods. Suppose that p; denotes the probability that i packages arrive in a period (i=0,1,...,m), where o Pi = 1. The expected number of arriving packages in a period is positive. At the end of each period, the robot may move packages to the shipping dock. If the robot takes packages for moving, then it takes all packages that have arrived so far and have not yet been moved. The maximal number of packages that the robot can move in one load is M > 1. The cost of moving is K > 0 and the moving time is negligible. The cost incurred in each period is w > 0 for each package that has not been moved. All packages, if any, must be moved to the shipping dock in period N. Formulate a Markov decision problem to determine an optimal moving policy that minimizes the combined expected costs of moving and waiting over N periods.
Expert Answer:
Related Book For
Operations management processes and supply chain
ISBN: 978-0136065760
9th edition
Authors: Lee J Krajewski, Larry P Ritzman, Manoj K Malhotra
Posted Date:
Students also viewed these mathematics questions
-
Obtain the transfer functions X(s)/F(s) and Y(s)/F(s) for the following model: 3x = y y = f(t) -3y- 15x
-
Some bacteria catabolize glucose by the Entner-Doudoroff pathway, a variant of glycolysis in which glucose-6-phosphate is converted to 6-phosphogluconate (as in the pentose phosphate pathway) and...
-
If total costs for a commodity are given by C(x) = 900 + 25x and total revenues are given by R(x) = 100x - x2, find the break-even quantities?
-
What prevents food from going into the trachea after it is swallowed?
-
(Stock Dividends and Splits) The directors of Merchant Corporation are considering the issuance of a stock dividend. They have asked you to discuss the proposed action by answering the following...
-
3/ x18 AB Express as a fraction 3/4y C
-
6. Conceptually, NP represents the class of decision problems whose "yes" answers can be ver- ified efficiently. In this problem, we will consider its counterpart: coNP {L | L NP}, representing the...
-
After Frank stopped making the loan payments on his office building, his lender foreclosed on the property. The loan was was checked. If the building is sold for the FMV, how much of Frank's personal...
-
You plan to invest $10,000 in a general partnership. There will be four other general partners, each contributing $10,000 . So, the total contributed by the general partners is $50,000 and each...
-
You purchased 357 shares of PQR, Inc., stock on 64% margin when the stock was selling fo $33.9 a share. The stock is currently selling for $36.18 a share. What is your current equity position (in $)?...
-
DS corporation has a profit before tax of 5 5 0 0 0 0 and an income taxcrate of 3 5 % . what is SD corp.profit?
-
III. GregIFER inc., a Spain-based company, imports merchandise produced in Argentina. The price in the factory is 2,000,000. The expenses incurred during the transaction are: Transport costs from...
-
Write about invading your privacy and create an argument on behalf of the employer's use of monitoring technologies.
-
For the following arrangements, discuss whether they are 'in substance' lease transactions, and thus fall under the ambit of IAS 17.
-
For coordinates \(\left(x^{1}, x^{2} ight)\) and metric \(g=\operatorname{diag}\left(g_{11}, g_{22} ight)\), the Gaussian curvature is For a sphere with coordinates defined in the following figure,...
-
Consider the holonomic basis defined in Box 26.1 . Using that the tangent vector for a curve can be written \(t=t^{\mu} e_{\mu}=\left(d x^{\mu} / d \lambda ight) e_{\mu}\), show that Thus, \(g_{\mu...
-
The Lie bracket of vector fields \(A\) and \(B\) is defined as their commutator, \([A, B]=\) \(A B-B A\). The Lie bracket of two basis vectors vanishes for a coordinate basis but not for a...
Study smarter with the SolutionInn App