<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Decisions versus Deep Reinforcement Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Francesco Stranieri</string-name>
          <email>francesco.stranieri@polito.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto Archetti</string-name>
          <email>alberto.archetti@polito.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Enrico Robbiano</string-name>
          <email>enrico.robbiano@bms.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chaaben Kouki</string-name>
          <email>chaaben.kouki@essca.fr</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabio Stella</string-name>
          <email>fabio.stella@unimib.it</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ESSCA School of Management</institution>
          ,
          <addr-line>Angers (49000)</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Polytechnic of Milan</institution>
          ,
          <addr-line>Milan (20133)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Polytechnic of Turin</institution>
          ,
          <addr-line>Turin (10129)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Milano-Bicocca</institution>
          ,
          <addr-line>Milan (20126)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <abstract>
        <p>We investigate whether and how deep reinforcement learning (DRL) can be exploited for managing inventory systems with a specific reference to perishable pharmaceutical products. A real-world case study is formulated as a Markov decision process, where states, actions, and rewards are defined. We then developed a DRL agent based on the Proximal Policy Optimization algorithm and compared its performance with a human decision-maker with several years of experience. Our findings reveal that the DRL agent outperforms the human policy by 11%, optimizing storage space and leading to growing profitability. Such incremental improvements can translate into substantial value for pharmaceutical companies operating in complex scenarios, and patients also stand to benefit. Finally, the study highlights the strategic advantage of integrating DRL into inventory management business operations, particularly for its ability to estimate uncertainty and manage corresponding supply chain risks.</p>
      </abstract>
      <kwd-group>
        <kwd>inventory management</kwd>
        <kwd>perishable products</kwd>
        <kwd>deep reinforcement learning</kwd>
        <kwd>business operations</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>CEUR
ceur-ws.org</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>With the advent of artificial intelligence in transforming business operations, its potential in
inventory management is worth exploring. In this study, we consider an inventory control
system for perishable products. In detail, the product in question is a perishable pharmaceutical
Myers Squibb (BMS) 1, a pharmaceutical company ofering several types of drugs.
drug, and the system under consideration is derived from a real-world case study at Bristol</p>
      <p>The case we investigate involves a product manufactured by a third party, thereby resulting
in longer replenishment lead times compared to direct production, and sold to one of BMS’s
primary markets through a central warehouse. Our study primarily focuses on various research
3rd Italian Workshop on Artificial Intelligence and Applications for Business and Industries - AIABI | co-located with
AI*IA 2023
trends. On one hand, we explore inventory management of perishable products. On the other
hand, due to product disturbances, we are also in the context of inventory management with
random yields.</p>
      <p>The collaboration with BMS has two main objectives. The first is to evaluate the potential
of deep reinforcement learning (DRL) in deriving competitive inventory policies. Should this
approach prove cost-efective, BMS plans to exploit DRL to build simulations that mimic
humanlike intelligence. The second goal of the collaboration consists of objectively evaluating the
probability and impact of supply chain risk. This assessment considers a range of uncertain
factors, including forecast accuracy, supply reliability, quality issues, and external disruptions.
The aim of these objectives is not only to minimize significant waste of time and human resources
but also to overcome performance limitations, thus aligning with the principles of Industry 4.0.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Background and Related Work</title>
      <p>
        DRL has been increasingly applied in inventory management [
        <xref ref-type="bibr" rid="ref1">1, 2, 3</xref>
        ], ofering prominent
solutions that dynamically adapt to varying supply chain settings and efectively address
inherent limitations associated with traditional mathematical models [4].
      </p>
      <p>However, since the 1970s, it has been recognized that determining an optimal inventory
control policy for perishable products with a fixed lifetime is a significant challenge [
5, 6]. While
various studies have attempted to develop and characterize the optimal policy, the necessity
of tracking the lifetime of items usually complicates the derivation of an efective solution [ 7].
As a result, numerous studies have focused on approximate solutions that perform closely to
the optimal policy but often involve making several assumptions that may not correspond to
real-world scenarios [8].</p>
      <p>Considering the recent development of algorithms based on reinforcement learning (RL), it
with  ∈ [0, 1) , by learning and exploiting an optimal policy [9].
would be worthwhile to investigate their performance in comparison to traditional reordering
policy and human decisions. RL algorithms are designed on the Markov decision process (MDP),
which provides a mathematical framework for addressing sequential decision-making problems.
Within this framework, an agent interacts with an environment at each time step  , observing a
ultimate goal of the agent is thus to maximize the long-term cumulative reward ∑=−0−1
state   and responding with an action   guided by its policy  (  ). Following the action, the
environment transitions to the next state  +1 , rewarding the agent with a scalar value   . The

 
++1 ,</p>
      <p>Specifically, RL constitutes a class of algorithms used for solving MDPs which has been
significantly enhanced by the advent of deep learning. In DRL, neural networks are employed
to handle high-dimensional state and action spaces through function approximation. In this
study, we utilized a DRL algorithm known as Proximal Policy Optimization (PPO) due to its
benefits such as training stability, high performance, and scalability [ 10].</p>
      <p>In the field of periodic inventory control systems for perishable products with a fixed lifetime,
there is limited research utilizing DRL. The study by [11] compares the performance of the Deep
Q-Network (DQN) algorithm with a fixed reordering policy and other existing heuristics. They
demonstrated that DQN outperforms all other methods in most of the considered experiments,
underscoring the efectiveness of this class of algorithms. When considering pharmaceutical
perishable products in a healthcare supply chain, [12] found that DRL policies not only result
in a reduced probability of product shortage and reduced risk of product expiration but also
ensure a higher service level for patients.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Supply Chain Case Study</title>
      <p>In our case study provided by BMS, orders for drugs produced by the third-party plant are
dispatched to the central warehouse in batches of  , where  ranges from 0 to 6, while 
represents a fixed quantity of 20 items per batch. In this respect, the ordering costs are nonlinear.
In particular, a single batch order incurs a cost of 5, a double batch order costs 8, a triple batch
order is priced at 9, and orders ranging from four to six batches are fixed at 10. We assume the
warehouse has infinite storage capacity and incurs a holding cost of 1 per item at each time step.</p>
      <p>It is crucial to note that not every order received by the warehouse is flawless. In fact, items
can be subject to product disturbances during production, rendering them unsaleable. Data
provided by BMS suggest that up to 10% of each order can be deemed unsaleable. Items in stock
are sold to customers at a price of 30, while any lost sale due to a shortage of items incurs a
penalty cost of 10. The replenishment lead time  from the plant to the warehouse is 12 time
steps, where each time step corresponds to one month. Items have a lifetime  of 12 time steps
after which they expire, resulting in an expiration cost of 3 per item.</p>
      <p>One of the main challenges of this study lies in formulating the system as an MDP and
consequently identifying an inventory policy through DRL that maximizes cumulative reward.
We define the reward   at time step  as the profit, calculated as sales revenue minus ordering,
holding, penalties, and expiration costs. The purpose of the DRL agent is thus to determine,
for each time step  , the optimal action   , which ranges from 0 to 6 (i.e., the domain of  ). We
designed the state of the MDP,   , as a vector composed of: (i) the current time step  ; (ii) a vector
of length  , where the  -th element indicates how many items have a lifetime of  time steps;
(iii) a vector of length  , where the  -th element indicates how many items were shipped  time
steps in the past; and (iv) a vector of length  which predicts the demand forecast between  + 
and  + 2 (for simplicity, we assume that the forecast value amounts to the average demand
value provided by the company). We made this choice for the vector of length  because the
actions taken at time  only afect the system at time step  +  . Therefore, considering previous
forecasts does not provide useful information to the DRL agent.</p>
      <p>Note that all the information contained within the state is also accessible to the human
decision-maker. Hence, our research aims to compare the performance of the PPO policy with
the human one. It is worth noting that the latter mainly relies on the material requirement
planning calculation under the supervision of a human decision-maker, i.e., a planning manager
operating at BMS, who can override the suggested actions based on their expertise.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Experimental Setup and Results</title>
      <p>To test the efectiveness of the DRL agent, we compare it against a human inventory control
policy by simulating a demand function that mirrors a specific scenario, that is, a pharmaceutical
drug entering the market, as illustrated in Figure 1. Each simulation covered a duration of 6
years, which is equivalent to 72 months (i.e.,  = 72 ). The demand at time step  equals the
company-provided average value, with a 15% standard deviation. To obtain this average value,
the company supplied us with synthetic and anonymized data corresponding to a real-world
case study.</p>
      <p>Time Steps</p>
      <p>Regarding the results, we calculated the average cumulative profit simulating, for each of
the two policies, the same 1000 independent episodes. However, during the evaluation phase,
we excluded the first and last 12 months not to consider the efects of initial stocks and final
actions. As reported in Table 1, the human policy yielded a profit of 26367 ± 688. In contrast,
the DRL agent, optimized using the PPO algorithm, achieved a profit of 29249 ± 1044. Further
analysis of the data indicates that the DRL agent outperforms the human policy by 11% ± 4, as
the average gap suggests.</p>
      <p>We then analyzed the behavior of the two policies to understand the reasons behind this
diference in terms of profit. As Figure 2 illustrates, the improvement achieved by the DRL agent
appears to be rooted in its ability to optimize the available storage space, leading to reduced
storage costs. In fact, under the human policy, stocks consistently remain above 100, whereas
they fall below this level when using the PPO policy (Figures 2a and 2b). This results the human
policy experiencing more expired stocks than PPO, even though the values for both algorithms
remain restricted to a few time steps (Figures 2c and 2d). Regarding unsatisfied demand,
the human policy fully meets all customer demands for every single time step (Figure 2e).
Conversely, during the final peak, PPO falls to entirely satisfying the demand, albeit by a margin
that never exceeds 10 units (Figure 2f). From a practical perspective, this diference is both
expected and intentional. Indeed, in the pharmaceutical market, it is generally more acceptable
to incur additional storage costs than to risk failing to meet customer demand.</p>
      <p>dn 40 dn 40
tttttttttkcskckscsckssksckcksksccsckendanaeodoondeaooooooSSSSSSSSSDDDmmm iiiiiiiiiillliilliliiftfItftItttI())(r)()r()(r(r())r())()()r()ssssxxxsssvvsvseadnpeeddeppdadneannadennbaabeaebeaananaaTTTEEEAAAUUreenaednadeaDDDmmm 25212212552102002255550500000005011124224.........0000000000000500550000000000550055000 (a(c))AEvxapiliarebdlesstotTTTTTTTTociiiiiiiimmmmmmmmckkeeeeeeeessSSSSSSSS(tttttttteeeeeeeeh(hppppppppussssssssummaann).). tttttttttkcskscskcckssksckckscskcsckednanaedoooendaooooooSSSSSSSSSDDDmmm iiiiiiiiiillliillliiiftftIftItttI())()r()r()r((r)(r)())()())(rssssxxxsssvvvssdneaapdeeddepnpeddnaneannabaeaebaaaebnaanTTTEEEAAAUUreenadeandeaDDDmmm 22512212152502052025555000000005011124224.........0000000000000500505000000000550550000 (b(d))AEvxapiliarebdlessTTTTTTTTtotiiiiiiiimmmmmmmmoceeeeeeeeckSSSSSSSSksttttttttseeeeeeee(ppppppppP(ssssssssPPPOO).).</p>
      <p>(UrrsdeO (05e) Unsatisfied de mTimaenSdte(phsuman). (UrrsdeO 050 (f) Unsatisfied deTmimeanStdep(sPPO).</p>
      <p>Figure 2rd: Av0erage value per time step of available stockrds (F5igures 2a and 2b), expired stocks (Figures 2c</p>
      <p>O 5 O 0
and 2d), rseand0 unsatisfied demand (Figures 2e and 2f) forrse the human and PPO policies, respectively.</p>
      <p>iitfftrrodPO110000000 iiffttrrodPO110050000000</p>
    </sec>
    <sec id="sec-6">
      <title>5. CoroPnc0lusions roP 500</title>
      <p>WInet hfoisrliilttvvaueeuauCmmsiiitfftftrrroooPP22tu001u000ld000a000000yte,dwtehienpvreosbtilgeamteadstahne MapDpPli,cdaetifinoinngofstDaililttvvaeeuuuaCmtReiiifttftfrrroooPP22L001s0005,0000t00000aocatiorenasl,-awnodrlrde winavrednstaonrdy icmonptleromlesnytsitnegm.
the PPvemOP algorithm. Our goal was to benchmark iveumDPRL performance to the one achieved by an
u
itC ift20000 m frP
expertluaprolanning manager with several years of exltuaCpito2e0r00ie00nce in the field.</p>
      <p>TheuCmrPesu0lts indicate a significant improvemenuCt in0 financial performance –about an 11%
increase–when employing a DRL agent due to its ability to optimize the available storage
space, consequently reducing storage and expiration costs. In contexts like pharmaceuticals,
where products have expiration dates and notable replenishment lead times, even minor
performance improvements can translate into substantial value, yielding considerable benefits for
both patients and companies. In fact, reduced obsolescence makes the product more financially
sustainable and allows the company to invest more resources in research and development.</p>
      <p>For future research, diferent demand functions could be tested, such as those pertaining to
drugs already on the market or nearing the end of their exclusivity.</p>
      <p>Lastly, to enhance the interplay between decision-making and artificial intelligence,
integrating DRL policies into inventory management business operations would be a valuable next step;
this represents a strategic advantage over traditional material requirement planning calculation,
which often lacks accurate estimation of uncertainty and related risks associated with external
disruptions, quality issues, and supply reliability.
Automation Congress (CAC), IEEE, 2019. URL: http://dx.doi.org/10.1109/CAC48633.2019.
8997498. doi:10.1109/cac48633.2019.8997498.
[2] J. Gijsbrechts, R. N. Boute, J. A. Van Mieghem, D. J. Zhang, Can deep reinforcement learning
improve inventory management? performance on lost sales, dual-sourcing, and
multiechelon problems, Manufacturing &amp; Service Operations Management 24 (2022) 1349–1368.</p>
      <p>URL: http://dx.doi.org/10.1287/msom.2021.1064. doi:10.1287/msom.2021.1064.
[3] F. Stranieri, F. Stella, Comparing deep reinforcement learning algorithms in two-echelon
supply chains, 2022. URL: https://arxiv.org/abs/2204.09603. doi:10.48550/ARXIV.2204.
09603.
[4] F. Stranieri, E. Fadda, F. Stella, Combining deep reinforcement learning and multi-stage
stochastic programming to address the supply chain inventory management problem,
International Journal of Production Economics 268 (2024) 109099. URL: http://dx.doi.org/
10.1016/j.ijpe.2023.109099. doi:10.1016/j.ijpe.2023.109099.
[5] S. Nahmias, Optimal ordering policies for perishable inventory—II, Operations Research 23
(1975) 735–749. URL: https://doi.org/10.1287/opre.23.4.735. doi:10.1287/opre.23.4.735.
[6] B. E. Fries, Optimal ordering policy for a perishable commodity with fixed lifetime,
Operations Research 23 (1975) 46–61. URL: https://doi.org/10.1287/opre.23.1.46. doi:10.
1287/opre.23.1.46.
[7] S. Nahmias, Perishable inventory theory: A review, Operations Research 30 (1982) 680–708.</p>
      <p>URL: https://doi.org/10.1287/opre.30.4.680. doi:10.1287/opre.30.4.680.
[8] V. Chaudhary, R. Kulshrestha, S. Routroy, State-of-the-art literature review on
inventory models for perishable products, Journal of Advances in Management
Research 15 (2018) 306–346. URL: https://doi.org/10.1108/jamr-09-2017-0091. doi:10.1108/
jamr-09-2017-0091.
[9] R. S. Sutton, A. G. Barto, Reinforcement Learning: An Introduction, MIT press, 2018. URL:
http://incompleteideas.net/book/the-book-2nd.html.
[10] J. Schulman, F. Wolski, P. Dhariwal, A. Radford, O. Klimov, Proximal policy optimization
algorithms, 2017. URL: https://arxiv.org/abs/1707.06347. doi:10.48550/ARXIV.1707.06347.
[11] B. J. D. Moor, J. Gijsbrechts, R. N. Boute, Reward shaping to improve the performance of
deep reinforcement learning in perishable inventory management, European Journal of
Operational Research 301 (2022) 535–545. URL: https://doi.org/10.1016/j.ejor.2021.10.045.
doi:10.1016/j.ejor.2021.10.045.
[12] E. Ahmadi, H. Mosadegh, R. Maihami, I. Ghalehkhondabi, M. Sun, G. A. Süer, Intelligent
inventory management approaches for perishable pharmaceutical products in a healthcare
supply chain, Computers &amp; Operations Research 147 (2022) 105968. URL: https://doi.org/
10.1016/j.cor.2022.105968. doi:10.1016/j.cor.2022.105968.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <article-title>Deep reinforcement learning approach for capacitated supply chain optimization under demand uncertainty</article-title>
          , in: 2019 Chinese
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>