{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:14:02Z","timestamp":1761664442664,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["EFOP-3.6.3-VEKOP-16-2017-00002","EFOP-3.6.3-VEKOP-16-2017-00002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00002","EFOP-3.6.3-VEKOP-16-2017-00002"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["EFOP-3.6.3-VEKOP-16-2017-00002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00002"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["GINOP-2.2.1-15-2017-00085","GINOP-2.2.1-15-2017-00085"],"award-info":[{"award-number":["GINOP-2.2.1-15-2017-00085","GINOP-2.2.1-15-2017-00085"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["TKP2020-NKA-06"],"award-info":[{"award-number":["TKP2020-NKA-06"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009934","name":"E\u00f6tv\u00f6s Lor\u00e1nd University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009934","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s42979-022-01296-6","type":"journal-article","created":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T16:05:31Z","timestamp":1659974731000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimizations of a Multi-Agent System for a Real-World Warehouse Problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Botond","family":"\u00c1cs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"D\u00f3ra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliv\u00e9r","family":"Jakab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alp\u00e1r","family":"J\u00fcttner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Madarasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8088-4528","authenticated-orcid":false,"given":"L\u00e1szl\u00f3 Z.","family":"Varga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,8]]},"reference":[{"issue":"1","key":"1296_CR1","first-page":"9","volume":"29","author":"PR Wurman","year":"2008","unstructured":"Wurman PR, D\u2019Andrea R, Mountz M. Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 2008;29(1):9.","journal-title":"AI Mag."},{"key":"1296_CR2","unstructured":"Stern R, Sturtevant NR, Felner A, Koenig S, Ma H, Walker TT, Li J, Atzmon D, Cohen L, Kumar T K S, Bart\u00e1k R, Boyarski E. Multi-agent pathfinding: Definitions, variants, and benchmarks. In: Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019, pp. 151\u2013159. AAAI Press, Palo Alto, California (2019)"},{"key":"1296_CR3","unstructured":"Ma H, Li J, Kumar T K S, Koenig S. Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S\u00e3o Paulo, Brazil, May 8-12, 2017, pp. 837\u2013845. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2017)"},{"issue":"2","key":"1296_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/tssc.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart P, Nilsson N, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybernet. 1968;4(2):100\u20137. https:\/\/doi.org\/10.1109\/tssc.1968.300136.","journal-title":"IEEE Trans Syst Sci Cybernet."},{"key":"1296_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon G, Stern R, Felner A, Sturtevant NR. Conflict-based search for optimal multi-agent pathfinding. Artificial Intell. 2015;219:40\u201366.","journal-title":"Artificial Intell."},{"key":"1296_CR6","doi-asserted-by":"crossref","unstructured":"Yu J, LaValle S. Structure and intractability of optimal multi-robot path planning on graphs. Proceedings of the AAAI Conference on Artificial Intelligence 27(1) (2013)","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"1296_CR7","doi-asserted-by":"crossref","unstructured":"Silver D. Cooperative pathfinding. In: Proceedings of the First AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. AIIDE\u201905, pp. 117\u2013122. AAAI Press, Palo Alto, California (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"issue":"01","key":"1296_CR8","first-page":"7643","volume":"33","author":"H Ma","year":"2019","unstructured":"Ma H, Harabor D, Stuckey PJ, Li J, Koenig S. Searching with consistent prioritization for multi-agent path finding. Proc AAAI Conf Artificial Intell. 2019;33(01):7643\u201350.","journal-title":"Proc AAAI Conf Artificial Intell."},{"key":"1296_CR9","first-page":"961","volume":"263","author":"B Max","year":"2014","unstructured":"Max B, Guni S, Roni S, Ariel F. Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. Front Artificial Intell Appl. 2014;263:961\u20132.","journal-title":"Front Artificial Intell Appl."},{"key":"1296_CR10","unstructured":"H\u00f6nig W, Kiesel S, Tinka A, Durham JW, Ayanian N. Conflict-based search with optimal task assignment. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS \u201918, pp. 757\u2013765, Richland, SC (2018)"},{"key":"1296_CR11","unstructured":"Li J, Tinka A, Kiesel S, Durham JW, Kumar TKS, Koenig S. Lifelong Multi-Agent Path Finding in Large-Scale Warehouses, pp. 1898\u20131900. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2020)"},{"key":"1296_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen V, Obermeier P, Son TC, Schaub T, Yeoh W. Generalized target assignment and path finding using answer set programming. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 1216\u20131223 (2017)","DOI":"10.24963\/ijcai.2017\/169"},{"key":"1296_CR13","doi-asserted-by":"crossref","unstructured":"Grenouilleau F, van Hoeve W, Hooker JN. A multi-label A* algorithm for multi-agent pathfinding. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2018, Berkeley, CA, USA, July 11-15, 2019, pp. 181\u2013185. AAAI Press, Palo Alto, California (2019)","DOI":"10.1609\/icaps.v29i1.3474"},{"key":"1296_CR14","doi-asserted-by":"crossref","unstructured":"Wan Q, Gu C, Sun S, Chen M, Huang H, Jia X. Lifelong multi-agent path finding in a dynamic environment. In: 2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV), pp. 875\u2013882. IEEE, not identified (2018)","DOI":"10.1109\/ICARCV.2018.8581181"},{"key":"1296_CR15","unstructured":"Liu M, Ma H, Li J, Koenig S. Task and path planning for multi-agent pickup and delivery. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS \u201919, pp. 1152\u20131160. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2019)"},{"key":"1296_CR16","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P. Knapsack problems: algorithms and computer implementations. New York, United States: Wiley; 1990."},{"issue":"4","key":"1296_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"WF de la Vega","year":"1981","unstructured":"de la Vega WF, Lueker GS. Bin packing can be solved within 1 + $$\\epsilon$$ in linear time. Combinatorica. 1981;1(4):349\u201355.","journal-title":"Combinatorica"},{"key":"1296_CR18","volume-title":"Traveling Salesman Prob.","author":"DL Applegate","year":"2007","unstructured":"Applegate DL, Bixby RE, Chv\u00e1tal V. Traveling Salesman Prob. Princeton, New Jersey, United States: Princeton University Press; 2007."},{"key":"1296_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: problems, methods, and applications","author":"P Toth","year":"2014","unstructured":"Toth P, Vigo D. Vehicle routing: problems, methods, and applications. Philadelphia, USA: SIAM; 2014."},{"issue":"10","key":"1296_CR20","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S. Computer solutions of the traveling salesman problem. Bell SystTech J. 1965;44(10):2245\u201369.","journal-title":"Bell SystTech J."},{"key":"1296_CR21","doi-asserted-by":"publisher","unstructured":"Forrest J, Ralphs T, Santos HG, Vigerske S, Hafer L, Forrest J, Kristjansson B, jpfasano EdwinStraver Lubin M, rlougee jpgoncal1 Jan-Willem, h-i-gassmann, Brito S, Cristina Saltzman M, tosttost, MATSUSHIMA F, to-st: coin-or\/Cbc: Release releases\/2.10.7. Zenodo (2022). https:\/\/doi.org\/10.5281\/zenodo.5904374.","DOI":"10.5281\/zenodo.5904374"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01296-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01296-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01296-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T21:51:50Z","timestamp":1668030710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01296-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,8]]},"references-count":21,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["1296"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01296-6","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,8,8]]},"assertion":[{"value":"31 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"431"}}