The participants in a competitive supply chain take their decisions individually in a distributed environment and independent of one another. At the same time, they must coordinate their actions so that the total profitability of the supply chain is safeguarded. This decision problem is known to be a difficult one and the decisions at different stages of the supply chain may lead to large oscillations if not coordinated properly. In this paper, we consider reinforcement learning agents in a multi-echelon supply chain and study under which conditions they are able to manage the supply chain. Q-learning in the well-known beer game is used as a case. It is found that the reinforcement learning agents can learn better policies than humans, although they do not always converge to the optimal policy.
|Autori interni:||NASO, David|
|Titolo:||Q-Learning in a Competitive Supply Chain|
|Data di pubblicazione:||2007|
|Nome del convegno:||IEEE International Conference on Systems, Man, and Cybernetics, SMC 2007|
|Digital Object Identifier (DOI):||10.1109/ICSMC.2007.4414132|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|