{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/learning-to-solve-the-min-max-mixed-shelves","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","arxiv_id":"2502.10233","date":"2025-02-14","proceeding":null,"authors":["Laurin Luttmann","Lin Xie"],"abstract":"The Mixed-Shelves Picker Routing Problem (MSPRP) is a fundamental challenge in warehouse logistics, where pickers must navigate a mixed-shelves environment to retrieve SKUs efficiently. Traditional heuristics and optimization-based approaches struggle with scalability, while recent machine learning methods often rely on sequential decision-making, leading to high solution latency and suboptimal agent coordination. In this work, we propose a novel hierarchical and parallel decoding approach for solving the min-max variant of the MSPRP via multi-agent reinforcement learning. While our approach generates a joint distribution over agent actions, allowing for fast decoding and effective picker coordination, our method introduces a sequential action selection to avoid conflicts in the multi-dimensional action space. Experiments show state-of-the-art performance in both solution quality and inference speed, particularly for large-scale and out-of-distribution instances. Our code is publicly available at http://github.com/LTluttmann/marl4msprp.","url_abs":"https://arxiv.org/abs/2502.10233v1","url_pdf":"https://arxiv.org/pdf/2502.10233v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-to-solve-the-min-max-mixed-shelves","repo_url":"https://github.com/ltluttmann/marl4msprp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"multi-agent-reinforcement-learning","task_name":"Multi-agent Reinforcement Learning"},{"task_slug":"navigate","task_name":"Navigate"},{"task_slug":"sequential-decision-making","task_name":"Sequential Decision Making"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2502.10233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10233"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ltluttmann/marl4msprp","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":7},"by_repo_kind":{"official":{"samples":7,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"e20008abe077c140","entry":"calc_adv_weights","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"marlprp/algorithms/losses.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/marlprp/algorithms/losses.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e20008abe077c140"}},{"code_sha256_prefix":"2e769f511bdda9c4","entry":"ce_loss","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"marlprp/algorithms/losses.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/marlprp/algorithms/losses.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2e769f511bdda9c4"}},{"code_sha256_prefix":"8a3fcdb29215a0c7","entry":"environment_distribution","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"marlprp/algorithms/utils.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/marlprp/algorithms/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8a3fcdb29215a0c7"}},{"code_sha256_prefix":"f5dbd88c723068aa","entry":"flatten_data_to_storage_locations","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"gurobi/mip.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/gurobi/mip.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f5dbd88c723068aa"}},{"code_sha256_prefix":"20d5d850c99eb57e","entry":"get_environment_distribution_for_current_epoch","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"marlprp/algorithms/utils.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/marlprp/algorithms/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"20d5d850c99eb57e"}},{"code_sha256_prefix":"a7b40b7d14b5fe0e","entry":"simple_listnet_loss","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"marlprp/algorithms/losses.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/marlprp/algorithms/losses.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a7b40b7d14b5fe0e"}},{"code_sha256_prefix":"ac55cffac19610f3","entry":"transform_data_for_solver_input","repo":"ltluttmann/marl4msprp","repo_kind":"official","path":"gurobi/mip.py","file_url":"https://github.com/ltluttmann/marl4msprp/blob/HEAD/gurobi/mip.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ac55cffac19610f3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}