IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v37y2025i3d10.1007_s10696-024-09563-9.html
   My bibliography  Save this article

Benchmark for multi-agent pickup and delivery problem in a robotic mobile fulfillment system

Author

Listed:
  • Yangjun Sun

    (University of Science and Technology)

  • Ning Zhao

    (University of Science and Technology)

Abstract

The Robotic Mobile Fulfillment System (RMFS) is a "goods-to-worker" system that utilizes pods to store goods and employs robots for pods movement. In the RMFS, the multi-agent pickup and delivery (MAPD) problem which robots complete pickup and delivery tasks and ensure that there are no conflicts has been extensively studied. Several studies have made varying assumptions and layouts to address the MAPD problem, making it challenging to compare their proposed algorithms. This study presents a benchmark for MAPD based on eight factors that influence robot conflicts such as layout scale, pillar, cross-aisle, direction, storage strategy, the number of robots, the number of tasks, and dynamic events. The 12800 instances with 256 different combinations are designed based on 8 parameters with 2 levels that affect the number of conflicts. Identical task-set was used for 8 combinations with different numbers of robots, directions, and with or without cross-aisle. The robot and layout configurations ensure scalability for subsequent research. The objective of MAPD is to minimize the total completion time to demonstrate the robotic efficiency. Three different rules and algorithms were used to determine the lower bound and upper bound. The selection method based on hardness is proposed to obtain a more discriminant benchmark. The 2560 instances are selected to constitute the benchmark considering hardness, exhaustiveness, scalability, and amenity of statistical analysis. This benchmark can be utilized by researchers and practitioners for comparing different methods, rules, and algorithms for the MAPD problem in RMFS, and can be extended according to research problems, objectives, and actual system requirements, such as increasing conflicts for more challenging instances or decreasing conflicts for enhanced safety in the actual system. In conclusion, this paper proposes a benchmark for MAPD in RMFS to be utilized by researchers and practitioners through the analysis of conflicts, robots, and layout.

Suggested Citation

  • Yangjun Sun & Ning Zhao, 2025. "Benchmark for multi-agent pickup and delivery problem in a robotic mobile fulfillment system," Flexible Services and Manufacturing Journal, Springer, vol. 37(3), pages 697-729, September.
    • Handle: RePEc:spr:flsman:v:37:y:2025:i:3:d:10.1007_s10696-024-09563-9
    DOI: 10.1007/s10696-024-09563-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-024-09563-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-024-09563-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Adrien Rimélé & Michel Gamache & Michel Gendreau & Philippe Grangier & Louis-Martin Rousseau, 2022. "Robotic mobile fulfillment systems: a mathematical modelling framework for e-commerce applications," International Journal of Production Research, Taylor & Francis Journals, vol. 60(11), pages 3589-3605, June.
    2. Gréanne Leeftink & Erwin W. Hans, 2018. "Case mix classification and a benchmark set for surgery scheduling," Journal of Scheduling, Springer, vol. 21(1), pages 17-33, February.
    3. Tadumadze, Giorgi & Wenzel, Julia & Emde, Simon & Weidinger, Felix & Elbert, Ralf, 2023. "Assigning orders and pods to picking stations in a multi-level robotic mobile fulfillment system," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 136885, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Giorgi Tadumadze & Julia Wenzel & Simon Emde & Felix Weidinger & Ralf Elbert, 2023. "Assigning orders and pods to picking stations in a multi-level robotic mobile fulfillment system," Flexible Services and Manufacturing Journal, Springer, vol. 35(4), pages 1038-1075, December.
    5. Tim Lamballais Tessensohn & Debjit Roy & René B.M. De Koster, 2020. "Inventory allocation in robotic mobile fulfillment systems," IISE Transactions, Taylor & Francis Journals, vol. 52(1), pages 1-17, January.
    6. Bingqian WANG & Xiuqing YANG & Mingyao QI, 2023. "Order and rack sequencing in a robotic mobile fulfillment system with multiple picking stations," Flexible Services and Manufacturing Journal, Springer, vol. 35(2), pages 509-547, June.
    7. Vallada, Eva & Ruiz, Rubén & Framinan, Jose M., 2015. "New hard benchmark for flowshop scheduling problems minimising makespan," European Journal of Operational Research, Elsevier, vol. 240(3), pages 666-677.
    8. Xie, Lin & Thieme, Nils & Krenzler, Ruslan & Li, Hanyi, 2021. "Introducing split orders and optimizing operational policies in robotic mobile fulfillment systems," European Journal of Operational Research, Elsevier, vol. 288(1), pages 80-97.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yang, Xiying & Hua, Guowei & Zhang, Li & Cheng, Tai Chiu Edwin & Choi, Tsan-Ming, 2025. "Joint optimization of order- and rack-scheduling in KIVA picking systems," Omega, Elsevier, vol. 135(C).
    2. Wu, Jingwen & Yang, Zhiyuan & Zhen, Lu & Li, Wenxin & Ren, Yiran, 2025. "Joint optimization of order picking and replenishment in robotic mobile fulfillment systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    3. Jiang, Zhong-Zhong & Zhao, Jinlong & Sun, Minghe, 2024. "Joint optimization of order picking and delivery in ergonomic picking systems with due dates for sustainability and resilience," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 191(C).
    4. Zhang, Zhengmin & Gong, Yeming & Yuan, Zhe & Chen, Wanying, 2024. "Robotic warehouse systems considering dynamic priority," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    5. Zhuang, Yanling & Zhou, Yun & Yuan, Yufei & Hu, Xiangpei & Hassini, Elkafi, 2022. "Order picking optimization with rack-moving mobile robots and multiple workstations," European Journal of Operational Research, Elsevier, vol. 300(2), pages 527-544.
    6. Zhuang, Yanling & Zhou, Yun & Hassini, Elkafi & Yuan, Yufei & Hu, Xiangpei, 2024. "Improving order picking efficiency through storage assignment optimization in robotic mobile fulfillment systems," European Journal of Operational Research, Elsevier, vol. 316(2), pages 718-732.
    7. Zhuang, Yanling & Zhou, Yun & Hassini, Elkafi & Yuan, Yufei & Hu, Xiangpei, 2022. "Rack retrieval and repositioning optimization problem in robotic mobile fulfillment systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    8. Ding, Tianrong & Zhang, Yuankai & Wang, Zheng & Hu, Xiangpei, 2024. "Velocity-based rack storage location assignment for the unidirectional robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    9. Justkowiak, Jan-Erik & Pesch, Erwin, 2023. "Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1063-1078.
    10. Constantin Wildt & Felix Weidinger & Nils Boysen, 2025. "Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(1), pages 35-66, March.
    11. Qin, Zhizhen & Kang, Yuexin & Yang, Peng, 2024. "Making better order fulfillment in multi-tote storage and retrieval autonomous mobile robot systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    12. Cristiano Arbex Valle & John E. Beasley, 2025. "A two stage approach for order and rack allocation with order backlog in a mobile rack environment," Annals of Operations Research, Springer, vol. 351(1), pages 167-201, August.
    13. Giorgi Tadumadze & Julia Wenzel & Simon Emde & Felix Weidinger & Ralf Elbert, 2023. "Assigning orders and pods to picking stations in a multi-level robotic mobile fulfillment system," Flexible Services and Manufacturing Journal, Springer, vol. 35(4), pages 1038-1075, December.
    14. Chen, Wanying & Wu, Peng & Gong, Yeming & Zhang, Zhengmin & Wang, Kun, 2025. "The role of energy consumption in robotic mobile fulfillment systems: Performance evaluation and operating policies with dynamic priority," Omega, Elsevier, vol. 130(C).
    15. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    16. Ma, Benedict Jun & Pan, Shenle & Zou, Bipan & Kuo, Yong-Hong & Huang, George Q., 2025. "Operating policies for robotic cellular warehousing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    17. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    18. Roshanaei, Vahid & Booth, Kyle E.C. & Aleman, Dionne M. & Urbach, David R. & Beck, J. Christopher, 2020. "Branch-and-check methods for multi-level operating room planning and scheduling," International Journal of Production Economics, Elsevier, vol. 220(C).
    19. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    20. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:flsman:v:37:y:2025:i:3:d:10.1007_s10696-024-09563-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.