Multi-agent Techniques to Solve a Real-World Warehouse Problem

Autor:	Botond Ács, Olivér Jakab, László Dóra, László Zsolt Varga
Rok vydání:	2021
Předmět:	Focus (computing) Operations research Computer science Heuristic media_common.quotation_subject Wage Mobile robot computer.software_genre Simulation software Warehouse Work (electrical) Path (graph theory) computer media_common
Zdroj:	Lecture Notes in Computer Science ISBN: 9783030857387 PAAMS
DOI:	10.1007/978-3-030-85739-4_1
Popis:	In recent years, many warehouses applied mobile robots to move products from one location to another. We focus on a traditional warehouse where agents are humans and they are engaged with tasks to navigate to the next destination one after the other. The possible destinations are determined at the beginning of the daily shift. Our real-world warehouse client asked us to minimise the total wage cost, and to minimise the irritation of the workers because of conflicts in their tasks. We extend Multi-Agent Path Finding (MAPF) solution techniques. We define a heuristic optimisation for the assignment of the packages. We have implemented our proposal in a simulation software and we have run several experiments. According to the experiments, the make-span and the wage cost cannot be reduced with the heuristic optimisation, however the heuristic optimisation considerably reduces the irritation of the workers. We conclude our work with a guideline for the warehouse.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f3b01ec1f28160d06f5f488504c7051c https://doi.org/10.1007/978-3-030-85739-4_1 Zobrazit plný text záznamu