Author dc.contributor.author | Ács, Botond | |
Author dc.contributor.author | Dóra, László | |
Author dc.contributor.author | Jakab, Olivér | |
Author dc.contributor.author | Jüttner, Alpár | |
Author dc.contributor.author | Madarasi, Péter | |
Author dc.contributor.author | Varga, László Z. | |
Availability Date dc.date.accessioned | 2023-07-03T09:22:38Z | |
Availability Date dc.date.available | 2023-07-03T09:22:38Z | |
Release dc.date.issued | 2022 | |
uri dc.identifier.uri | http://hdl.handle.net/10831/89791 | |
Abstract dc.description.abstract | 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 minimize the total wage cost, and to minimize the irritation of the workers because of conflicts in their tasks. We define a heuristic for the optimizations for splitting the orders into warehouse carts, defining the sequence of the products within the carts, and the assignment of the carts to workers. We extend Multi-Agent Path Finding (MAPF) solution techniques. Furthermore, 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 optimization, however the heuristic optimization considerably reduces the irritation of the workers. We conclude our work with a guideline for the warehouse. | |
Language dc.language | Angol | |
dc.rights | Nevezd meg! | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
Title dc.title | Optimizations of a Multi-Agent System for a Real-World Warehouse Problem | |
Type dc.type | folyóiratcikk | |
Date Change dc.date.updated | 2023-07-03T09:21:47Z | |
Scope dc.format.page | 431 | |
Doi ID dc.identifier.doi | https://doi.org/10.1007/s42979-022-01296-6 | |
MTMT ID dc.identifier.mtmt | 33043065 | |
Issue Number dc.identifier.issue | 6 | |
abbreviated journal dc.identifier.jabbrev | SN COMP SCI | |
Journal dc.identifier.jtitle | SN COMPUTER SCIENCE | |
Volume Number dc.identifier.volume | 3 | |
Release Date dc.description.issuedate | 2022 | |
department of Author dc.contributor.institution | Operációkutatási Tanszék | |
department of Author dc.contributor.institution | Programozáselmélet és Szoftvertechnológiai Tanszék | |
department of Author dc.contributor.institution | ELKH-ELTE Egerváry Jenő Kombinatorikus Optimalizálási Kutatócsoport | |
department of Author dc.contributor.institution | MTA-ELTE Egerváry Jenő Kombinatorikus Optimalizálási Kutatócsoport | |
Author institution dc.contributor.department | Operációkutatási Tanszék | |
Author institution dc.contributor.department | ELKH-ELTE Egerváry Jenő Kombinatorikus Optimalizálási Kutatócsoport | |
Author institution dc.contributor.department | Programozáselmélet és Szoftvertechnológiai Tanszék |