mlsanityData to 7 Oct 2026

Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search

arXiv 2408.16890 ↗First posted 29 Aug 2024cs.RO cs.LG math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

The rapid deployment of robotics technologies requires dedicated optimization algorithms to manage large fleets of autonomous agents. This paper supports robotic parts-to-picker operations in warehousing by optimizing order-workstation assignments, item-pod assignments and the schedule of order fulfillment at workstations. The model maximizes throughput, while managing human workload at the workstations and congestion in the facility. We solve it via large-scale neighborhood search, with a novel learn-then-optimize approach to subproblem generation. The algorithm relies on an offline machine learning procedure to predict objective improvements based on subproblem features, and an online optimization model to generate a new subproblem at each iteration. In collaboration with Amazon Robotics, we show that our model and algorithm generate much stronger solutions for practical problems than state-of-the-art approaches. In particular, our solution enhances the utilization of robotic fleets by coordinating robotic tasks for human operators to pick multiple items at once, and by coordinating robotic routes to avoid congestion in the facility.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 65 references that are in the map. First posted on arXiv 29 Aug 2024.

Builds on

18 of 65 references.

References · 18

  1. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  2. 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 183
  3. 2019Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problemcited by 117
  4. 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
  5. 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 108
  6. 2021Learning to Delegate for Large-scale Vehicle Routingcited by 108
  7. 2020Hybrid Models for Learning to Branchcited by 95
  8. 2020Lifelong Multi-Agent Path Finding in Large-Scale Warehousescited by 79
  9. 2017Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Taskscited by 62
  10. 2015JuMP: A Modeling Language for Mathematical Optimizationcited by 49
  11. 2019Online Mixed-Integer Optimization in Millisecondscited by 37
  12. 2023Learning to Warm-Start Fixed-Point Optimization Algorithmscited by 32
6 more
  1. 2021Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Deliverycited by 29
  2. 2017Optimization of Tree Ensemblescited by 26
  3. 2018Predicting Tactical Solutions to Operational Planning Problems under Imperfect Informationcited by 11
  4. 2022A machine learning framework for neighbor generation in metaheuristic searchcited by 4
  5. 2019Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environmentcited by 1
  6. 2019Modeling Single Picker Routing Problems in Classical and Modern Warehousescited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.