確率計画法による在庫融通問題  [in Japanese] Stochastic Programming Model for Inventory Distribution Problem  [in Japanese]

Access this Article

Author(s)

Abstract

拠点間の在庫融通に関する従来の研究では,予防的在庫転送,緊急的在庫転送という2つの在庫転送方策が別々に研究されているが,それぞれ一長一短があり,これら二つの方策を併用することでより高いサービスレベルを達成できると考えられる.本研究ではこれらの方策の併用を考え,需要を確率変数として与え確率計画法によって定式化し,効率的な解法の検証を行いつつ予防型・緊急型併用方策の有効性の検証を行う.

Two different types of transshipments which are called preventive or emergency transshipment, have been studied separately in the inventory distribution problem. The transshipment in inventory distribution system is important to improve customer service and reduce total cost. In this paper the inventory distribution problem using both transshipments is formulated as the stochastic programming problem in which customer demand is defined as random variables. The algorithm using L-shaped method is developed and the numerical experiments show that the proposed algorithm is quite efficient. Finally, the advantage using both of transshipments is shown.

Journal

  • Journal of Japan Society for Fuzzy Theory and Intelligent Informatics

    Journal of Japan Society for Fuzzy Theory and Intelligent Informatics 24(6), 1119-1127, 2012

    Japan Society for Fuzzy Theory and Intelligent Informatics

Codes

  • NII Article ID (NAID)
    130003368199
  • Text Lang
    JPN
  • ISSN
    1347-7986
  • Data Source
    J-STAGE 
Page Top