Capacitated Location-Routing Problem

To test algorithms dedicated to solving the Capacitated Location-Routing Problem (CLRP) the most widely used benchmark instances are by Tuzun and Burke (1999), Barreto et al. (2007) and Prins et al. (2006). The first and third sets can be found here, and the second set is available here.

Full solution data of best solutions obtained with the two variants of Hybrid GA (out of 10 runs on the benchmark sets): HGA_solutions.zip and HGA+_solutions.zip.

Location-Arc Routing Problem

For testing algorithms tackling the Location-Arc Routing Problem (LARP), a new set of instances was proposed in Lopes et al. (2014). The instances were drawn from the capacitated arc routing problem literature and adapted to the LARP.

Data of the proposed set: Instances_LARP.zip.