SMIO-Hexaly Location Routing Challenge 2026: Instances and Best Known Solutions

Permanent reference library of the SMIO-Hexaly Location Routing Challenge 2026, a public computational competition on the capacitated location routing problem (CLRP) organized by the Mexican Society for Operations Research (SMIO) with Hexaly as Diamond Sponsor, held from 20 July to 15 August 2026 (Monterrey time). The dataset contains the 30 official instances (80 to 2,500 customers, 5 to 40 candidate depots; 20 synthetic Euclidean instances and 10 instances on the real road network of the Monterrey metropolitan area, possibly asymmetric), the final best known solution (BKS) of every instance on the Open and Undergraduate tracks, the full chronology of BKS improvements (479 on the Open timeline, 219 on the Undergraduate timeline), the final standings, the Hexaly Optimizer baseline, the method descriptions of the 15 participating teams, the rules and the official final report. Every solution was re-verified with the public verifier when the package was built. The instance generator and verifier are open source (MIT). Files: the synthetic instances, the road-network instances, and the solutions with results, methods and documents are three separate zip archives that unpack into one tree. See README.md for the layout, licenses and how to cite.