Datasets for The Covering Tour Problem with Path Upgrades
Instances used in the paper: The Covering Tour Problem with Path Upgrades This dataset contains benchmark instances used for computational experiments. Each instance is described by three different files: Parameters.txtThis file p
Instances used in the paper: The Covering Tour Problem with Path Upgrades
This dataset contains benchmark instances used for computational experiments.
Each instance is described by three different files:
Parameters.txt
This file provides the main instance parameters, including a set of coverage radii and multiple budget scenarios defined as fractions of the maximum available budget.nameofthedataset_cost_upg_and_max_upg.txt
This file contains the upgrade-related information, specifying the upgrade cost associated with each arc and the maximum allowable upgrade per arc.nameofthedataset.tsp
This file includes the coordinates of all nodes in the instance. Coordinates are given in a two-dimensional Euclidean space. Pairwise distances between nodes are not stored explicitly. Instead, they are computed when required using the standard Euclidean distance formula. Library of Traveling Salesman problems from Reinelt, G. “TSPLIB–A Traveling Salesman Problem Library.” ORSA Journal on Computing, Vol. 3, No. 4, pp. 376-384. Fall 1991.
The preprint of the paper is available at SSRN: https://ssrn.com/abstract=5669879 or http://dx.doi.org/10.2139/ssrn.5669879
📤 Share this page
Found this useful? Share it with your network.
Files are hosted on the source repository. Click download to access the full dataset.