Reproduce “The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Thibault Prunet, Nabil Absi, Diego Cattaruzza
Researchers from French institutions present a generic Branch-Cut-and-Price algorithm to exactly solve the Storage Location Assignment and Picker Routing Problem (SLAPRP), integrating storage assignment with optimal picker routing. The algorithm identified 115 new optimal solutions across a benchmark set and demonstrated up to 5% cost savings with optimal routing, outperforming existing methods by orders of magnitude for replenishment scenarios.
Key insights
- Decomposing the integrated SLAPRP allows for exact solution of complex problems by leveraging efficient algorithms for elementary shortest path problems in the pricing step.
- Specialized valid inequalities (SL cuts) are crucial for strengthening the link between assignment and routing variables, enabling better dual bounds and faster convergence.
- Strategic branching on assignment variables, combined with symmetry considerations, is essential for tackling the combinatorial explosion and solving practical-sized instances to optimality.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.