# Tag Info

9

For a table of benchmark instances on SDVRP you can have a look at Table 4 (Benchmark on known SDVRP problem instances) of Ray et al. (2014)1. More details are provided in reference [30]2 of the paper. References [1] Ray, S., Soeanu, A., Berger, J., Debbabi, M. (2014). The multi-depot split-delivery vehicle routing problem: Model and solution algorithm. ...

3

The usual way to check which instances are still open is to check the latest paper(s) on exact solution of the problem. The latest papers seem to be https://pubsonline.informs.org/doi/abs/10.1287/trsc.2018.0825 (SDVRP with time windows) and https://doi.org/10.1016/j.ejor.2014.04.026 (standard SDVRP).

2

I think that there might be a straightforward approach here that requires only solving a linear program. Consider the LP arc-flow formulation of multi-commodity network flow; I won't repeat it here since it is very well known. The solution is expressed by flow variables $x^b_{ij}$, the flow of commodity $b$ on network directed arc $(i,j)$. Based on your ...

2

You might be able to adjust my vrp generator code to generate some SDVRP problems. That way you'll immediately have road distances etc. I used it to create the Belgium road-km/road-time/air - 50-2750 visits datasets. Whatever you do, post the datasets on vrp-rep.org - we as a community should try to centralize all vrp datasets. (I am not affiliated with vrp-...

Only top voted, non community-wiki answers of a minimum length are eligible