<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Reinforcement learning relocation assignment in the multiple-deep storage system</dc:title><dc:creator>Marolt,	Jakob	(Avtor)
	</dc:creator><dc:creator>Rosi,	Bojan	(Avtor)
	</dc:creator><dc:creator>Lerher,	Tone	(Avtor)
	</dc:creator><dc:subject>relocation problem</dc:subject><dc:subject>reinforcement learning</dc:subject><dc:subject>DQN</dc:subject><dc:subject>multiple-deep</dc:subject><dc:subject>storage system</dc:subject><dc:description>The field of reinforcement learning shows promising results in recent publications for solving complex combinatorial problems. In this paper, an agent is trained to tackle the relocation problem that appears in various logistics systems. The relocation problem was formulated as an array that is accessible only from the top side. The agent has to relocate blocking SKUs and thus enable access to the SKU with the highest dispatch priority. We utilised the Deep Q-learning Network (DQN) to train the agent. Two case studies are presented – one with 1.2 ∙ 10 and another with 2 ∙ 10 possible states. The results display that the agents made a significantly better decision toward the learning process’s end than at the beginning</dc:description><dc:date>2022</dc:date><dc:date>2023-03-14 14:31:56</dc:date><dc:type>Neznano</dc:type><dc:identifier>83934</dc:identifier><dc:identifier>UDK: 004.85:164</dc:identifier><dc:identifier>OceCobissID: 123843331</dc:identifier><dc:identifier>COBISS_ID: 126076419</dc:identifier><dc:language>sl</dc:language></metadata>
