Links to benchmark instances

  • NEARP instances

    The Node, Edge, and Arc Routing Problem (NEARP) generalizes the classical Capacitated Vehicle Routing Problem (VRP), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. Here you find information on four benchmarks for the NEARP, including instance definitions as well as best known (to our knowledge) upper and lower bounds for all instances.

  • CARP instances