This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-233032
If you've NEVER registered a DOI in your Lattes, check our tutorial!Intralogistics efficiency is vital for e-commerce, with order picking being the most costly step. This paper addresses the Optimal Order Selection Problem (PSPO), proposed by Mercado Libre at SBPO 2025. The goal is to maximize operational productivity, defined by the ratio of items collected to aisles visited. Different from traditional distance minimization, PSPO has fractional objective function and NP-hard nature. We propose and compare two reactive meta-heuristics implemented in Rust: R-GRASP and AR-BPSO. Experiments in official instances show that the approach achieved the optimal solution in 80% of Set A and maintained average gaps of less than 1.5% in the complex instances of Set B, presenting high competitiveness in Set X. The results were validated against the best known solutions from Mercado Libre and methodologies in the literature.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper