欧亿3官网

  • <mark id="rlog8"><ol id="rlog8"></ol></mark><mark id="rlog8"><u id="rlog8"></u></mark>
    1. <listing id="rlog8"></listing>

        <output id="rlog8"><button id="rlog8"></button></output>
        <output id="rlog8"><ruby id="rlog8"></ruby></output>
          <small id="rlog8"><dfn id="rlog8"></dfn></small>
        1. <tt id="rlog8"><u id="rlog8"></u></tt>
          <small id="rlog8"></small>


        2. Approximate Dynamic Programming for lateral transshipment problems in multi-location inventory systems

          Olga Rusyaeva, Joern Meissner

          Abstract Companies commonly allocate their inventories across multiple locations based on their historical sales rates. However, random fluctuations in customer purchases, such as those caused by weather conditions and other external factors, might cause significant deviations from expected demand, leading to excess stock in some locations and stockouts in others. To fix this mismatch, companies often turn to lateral transshipments, e.g., the movement of stock between locations of the same echelon.

          In this paper, we examine multi-location inventory systems under periodic review with multiple opportunities for proactive transshipments within one order cycle. If stockouts occur, demand is lost with no opportunity to backorder. The objective of our model is to find an optimal policy that indicates the sources and the destinations of transshipments as well as the number of units, to maximise the profit of the network. We create a dynamic program that can, in principal, be solved to optimality using Bellman's equation. However, the size of the state and decision spaces makes it impossible to find the optimal policy for real-world sized problem instances. Thereby, we use forward approximate dynamic programming to find a near-optimal transshipment policy.

          Finally, we conduct an extensive numerical study to gauge the performance of our transshipment policy. For small size instances, we compare our policy to the optimal one. For larger scale instances, we consider other practically oriented heuristics. Our numerical experiments show that our proposed algorithm performs very well compared to state-of-the-art methods in the literature.
          Keywords

          Multi-Location Inventory, Proactive Transshipments, Lost Sales, Dynamic Programming, Concave Piecewise-Linear Approximation

          Status Working Paper
          Download 3g.yorsan.com.cn/download/ADP-Lateral-Transshipment-Problems.pdf
          (1,038 kb)
          Reference BibTeX, Plain Text
          Back to Publications


        3. <mark id="rlog8"><ol id="rlog8"></ol></mark><mark id="rlog8"><u id="rlog8"></u></mark>
          1. <listing id="rlog8"></listing>

              <output id="rlog8"><button id="rlog8"></button></output>
              <output id="rlog8"><ruby id="rlog8"></ruby></output>
                <small id="rlog8"><dfn id="rlog8"></dfn></small>
              1. <tt id="rlog8"><u id="rlog8"></u></tt>
                <small id="rlog8"></small>

              2. 中国福彩手机app官方下载

                cc9彩票注册

                ag真人平台

                两元彩票网

                广东体彩手机

                ub8娱wz乐

                九州体育app注册

                网投网官网

                365首页娱乐