IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v316y2022i1d10.1007_s10479-021-04190-1.html
   My bibliography  Save this article

Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs

Author

Listed:
  • Zheng Wang

    (Dalian Maritime University)

  • Wei Xu

    (Dalian Maritime University)

  • Xiangpei Hu

    (Dalian University of Technology)

  • Yong Wang

    (Chongqing Jiaotong University)

Abstract

A novel part-to-picker warehouse with robotic mobile racks is spreading recently because of its advantages in picking multi-item e-commerce orders. However, warehouse managers may suffer the situation that the new warehouse and an old one coexist in a distribution center. Due to their respective capacities, any warehouse cannot hold all the stock keeping units (SKUs). How to allocate SKUs to the two warehouses is an important decision. It has a significant influence on the cost of combining the SKUs that have to be picked from two warehouses for customer orders. The problem is formulated by using an innovative virtual-warehouse-based idea, the NP-hardness of the problem is proved, and a hybrid algorithm by alternating between the large neighborhood search and local search is developed. Some effective data-driven strategies are proposed to improve the most time-consuming modules of the algorithm. Extensive case studies are conducted and good performances of the algorithm are shown when it is compared with the MIP solver on small-sized cases, and an adapted tabu search and a simulated annealing algorithm on large-sized real-world cases. The sensitivity analyses on key parameters of the problem are made and related managerial insights are obtained.

Suggested Citation

  • Zheng Wang & Wei Xu & Xiangpei Hu & Yong Wang, 2022. "Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs," Annals of Operations Research, Springer, vol. 316(1), pages 467-491, September.
    • Handle: RePEc:spr:annopr:v:316:y:2022:i:1:d:10.1007_s10479-021-04190-1
    DOI: 10.1007/s10479-021-04190-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04190-1
    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/s10479-021-04190-1?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Mulvey, John M. & Beck, Michael P., 1984. "Solving capacitated clustering problems," European Journal of Operational Research, Elsevier, vol. 18(3), pages 339-348, December.
    2. Yuning Chen & Jin-Kao Hao, 2015. "Iterated responsive threshold search for the quadratic multiple knapsack problem," Annals of Operations Research, Springer, vol. 226(1), pages 101-131, March.
    3. Anna Martínez-Gavara & Vicente Campos & Micael Gallego & Manuel Laguna & Rafael Martí, 2015. "Tabu search and GRASP for the capacitated clustering problem," Computational Optimization and Applications, Springer, vol. 62(2), pages 589-607, November.
    4. Zhang, Yuankai & Lin, Wei-Hua & Huang, Minfang & Hu, Xiangpei, 2021. "Multi-warehouse package consolidation for split orders in online retailing," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1040-1055.
    5. Bo Yan & Chang Yan & Feng Long & Xing-Chao Tan, 2018. "Multi-objective optimization of electronic product goods location assignment in stereoscopic warehouse based on adaptive genetic algorithm," Journal of Intelligent Manufacturing, Springer, vol. 29(6), pages 1273-1285, August.
    6. Pisinger, David, 1999. "An exact algorithm for large multiple knapsack problems," European Journal of Operational Research, Elsevier, vol. 114(3), pages 528-541, May.
    7. Amaldi, Edoardo & Coniglio, Stefano, 2013. "A distance-based point-reassignment heuristic for the k-hyperplane clustering problem," European Journal of Operational Research, Elsevier, vol. 227(1), pages 22-29.
    8. Zhou, Qing & Benlic, Una & Wu, Qinghua & Hao, Jin-Kao, 2019. "Heuristic search to the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 464-487.
    9. Carlos García-Martínez & Fred Glover & Francisco Rodriguez & Manuel Lozano & Rafael Martí, 2014. "Strategic oscillation for the quadratic multiple knapsack problem," Computational Optimization and Applications, Springer, vol. 58(1), pages 161-185, May.
    10. David Pisinger & Stefan Ropke, 2010. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 399-419, Springer.
    11. Jack Brimberg & Nenad Mladenović & Raca Todosijević & Dragan Urošević, 2019. "Solving the capacitated clustering problem with variable neighborhood search," Annals of Operations Research, Springer, vol. 272(1), pages 289-321, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kaibo Liang & Li Zhou & Jianglong Yang & Huwei Liu & Yakun Li & Fengmei Jing & Man Shan & Jin Yang, 2023. "Research on a Dynamic Task Update Assignment Strategy Based on a “Parts to Picker” Picking System," Mathematics, MDPI, vol. 11(7), pages 1-29, March.

    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. Zhou, Qing & Benlic, Una & Wu, Qinghua & Hao, Jin-Kao, 2019. "Heuristic search to the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 464-487.
    2. Oliver G. Czibula & Hanyu Gu & Yakov Zinder, 2018. "Planning personnel retraining: column generation heuristics," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 896-915, October.
    3. David Bergman, 2019. "An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 477-492, July.
    4. Marcos J. Negreiros & Nelson Maculan & Pablor L. Batista & João A. Rodrigues & Augusto W. C. Palhano, 2022. "Capacitated clustering problems applied to the layout of IT-teams in software factories," Annals of Operations Research, Springer, vol. 316(2), pages 1157-1185, September.
    5. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    6. Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
    7. Liagkouras, Konstantinos & Metaxiotis, Konstantinos, 2021. "Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1019-1036.
    8. Lili Wang & Min Li & Guanbin Kong & Haiwen Xu, 2024. "Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints," Annals of Operations Research, Springer, vol. 338(2), pages 1157-1185, July.
    9. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 0. "An approximation algorithm for the uniform capacitated k-means problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    10. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    11. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    12. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    13. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    14. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    15. Majid Eskandarpour & Pierre Dejax & Olivier Péton, 2019. "Multi-Directional Local Search for Sustainable Supply Chain Network Design," Post-Print hal-02407741, HAL.
    16. Napoletano, Antonio & Martínez-Gavara, Anna & Festa, Paola & Pastore, Tommaso & Martí, Rafael, 2019. "Heuristics for the Constrained Incremental Graph Drawing Problem," European Journal of Operational Research, Elsevier, vol. 274(2), pages 710-729.
    17. Zhiyuan Yuan & Jie Gao, 2022. "Dynamic Uncertainty Study of Multi-Center Location and Route Optimization for Medicine Logistics Company," Mathematics, MDPI, vol. 10(6), pages 1-15, March.
    18. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    19. Lau, Kin-nam & Leung, Pui-lam & Tse, Ka-kit, 1999. "A mathematical programming approach to clusterwise regression model and its extensions," European Journal of Operational Research, Elsevier, vol. 116(3), pages 640-652, August.
    20. Daniela Guericke & Leena Suhl, 2017. "The home health care problem with working regulations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 977-1010, October.

    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:annopr:v:316:y:2022:i:1:d:10.1007_s10479-021-04190-1. 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.