1 Ocak 2022 Dergi makalesi Açık Erişim

Neghab, Davood Pirayesh; Khayyati, Siamak; Karaesmen, Fikri

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <controlfield tag="001">255121</controlfield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">302</subfield>
    <subfield code="p">EUROPEAN JOURNAL OF OPERATIONAL RESEARCH</subfield>
    <subfield code="n">2</subfield>
    <subfield code="c">482-496</subfield>
  </datafield>
  <controlfield tag="005">20230729032222.0</controlfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">We consider a single-period inventory problem with random demand with both directly observable and unobservable features that impact the demand distribution. With the recent advances in data collection and analysis technologies, data-driven approaches to classical inventory management problems have gained traction. Specially, machine learning methods are increasingly being integrated into optimization problems. Although data-driven approaches have been developed for the newsvendor problem, they often consider learning from the available data and optimizing the system separate tasks to be performed in sequence. One of the setbacks of this approach is that in the learning phase, costly and cheap mistakes receive equal attention and, in the optimization phase, the optimizer is blind to the confidence of the learner in its estimates for different regions of the problem. To remedy this, we consider an integrated learning and optimization problem for optimizing a newsvendor's strategy facing a complex correlated demand with additional information about the unobservable state of the system. We give an algorithm based on integrating optimization, neural networks and hidden Markov models and use numerical experiments to show the efficiency of our method. In an empirical experiment, the method outperforms the best competitor benchmark by more than 27%, on average, in terms of the system cost. We give further analyses of the performance of the method using a set of numerical experiments. (C) 2021 Published by Elsevier B.V.</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">An integrated data-driven method using deep learning for a newsvendor problem with unobservable features</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:aperta.ulakbim.gov.tr:255121</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Ryerson Univ, Dept Mech &amp; Ind Engn, Toronto, ON, Canada</subfield>
    <subfield code="a">Neghab, Davood Pirayesh</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:4af65edde3c024a6aa46219a51d9287b</subfield>
    <subfield code="s">213</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/255121/files/bib-4c2079e9-9e8b-468a-a26e-c59ef32c9f3d.txt</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="2">doi</subfield>
    <subfield code="a">10.1016/j.ejor.2021.12.047</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Koc Univ, Coll Engn, Rumeli Feneri Yolu, TR-34450 Istanbul, Turkey</subfield>
    <subfield code="a">Khayyati, Siamak</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Koc Univ, Coll Engn, Rumeli Feneri Yolu, TR-34450 Istanbul, Turkey</subfield>
    <subfield code="a">Karaesmen, Fikri</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2022-01-01</subfield>
  </datafield>
</record>