I recently started working on the classical split delivery vehicle routing problem (SDVRP). I appreciate if someone could let me know where to download benchmark instances for this problem? I am also interested to know what problem instances are still unsolved. Is this information available and updated in the proposed data sets or I should read recent papers to find out?
I could find this website and it mentions something about "split library" which is confusing to me as it seems to be an algorithm that is not relevant to SDVRP. Any ways, the website has instances for SDVRP with time windows but I could not find simple SDVRP instances. A friend told me that I could also use VRP instances instead of SDVRP instances. Is that a good idea? I prefer not to do this as I am mainly interested to know about the SDVRP instances commonly used.
This website has two sets of SDVRP instances (old and new), but I could not find their solution status and that when and in which publication they were introduced.