Benchmark Solutions of the Vehicle Routing Problem with Synchronised Visits

Dataset

Description

The dataset contains solutions to the benchmark of the Vehicle Routing Problems with Time Windows and Synchronised Visits
proposed by Bredström and Rönnqvist in the article "Combined vehicle routing and scheduling with temporal precedence and synchronisation constraints" (DOI: 10.1016/j.ejor.2007.07.033).

The solutions were computed using the hybrid method proposed by the authors of the dataset in the article "A Multistage Optimisation Algorithm for the Large VehicleRouting Problem with Time
Windows and Synchronised Visits" (DOI: 10.1080/01605682.2020.1792365) and made available for benchmarking and testing purposes.

Solutions are saved as XML files, and their file format is compliant with the GEXF schema. The structure of the dataset and the file format is explained in the Readme file included in the dataset.
The dataset is released on the Open Data Commons Open Database License (ODC-ODbL).
Date made available6 Jul 2020
PublisherUniversity of Strathclyde

Research Output

  • Cite this

    Polnik, M. D. (Creator), Riccardi, A. (Supervisor), Akartunali, K. (Contributor) (6 Jul 2020). Benchmark Solutions of the Vehicle Routing Problem with Synchronised Visits. University of Strathclyde. hc_solutions(.zip), Readme(.pdf). 10.15129/23407249-a2d6-4750-a0fb-540f36981b63