DI-NEARP benchmark
Here you find instance definitions and the best known solutions (to our knowledge) for the 24 instances of the DI-NEARP benchmark generated from six real life cases from the design of carrier routes for home delivery of subscription newspapers and other media products in the Nordic countries [BHW]. The values for the upper and lower bounds reported in the table only include traversal costs, i.e. service costs are omitted.
Instance definitions (text)The DI-NEARP instance definitions can be found, as a zip-file here.
Best known results for the DI-NEARP benchmarkFor the Upper Bound values in blue, you get the detailed solution by clicking on the value.
References BHW - Lukas Bach, Geir Hasle, Sanne Wøhlk: A Lower Bound for the Node, Edge, and Arc Routing Problem. Computers & Operations Research 40 (2013) 943–952. |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||