Instances, results and codes of "Efficient formulations for the Traveling Car Renter Problemand its Quota variant", by Lacroix, Rios-Solis, Wolfler-Calvo

Instances, results and codes of the paper: "Efficient formulations for the Traveling Car Renter Problemand its Quota variant", Lacroix, Rios-Solis, Wolfler-Calvo<br>Abstract of the paper: In this paper we study the recently introduced Traveling Car Renter Problem. This latter is a generalization of the well-known TSP where a solution is a set of paths of different colors as well as an orientation of each path in such a way that the union forms a directed Hamiltonian circuit. Considering costs associated with all edges and all ordered pairs of nodes for each color, the cost of a solution is the sum of the costs of its colored oriented paths, the cost of these latter being the sum of the edge costs plus the costs from their origin to their destination. We also consider the Quota version of this problem where a weight is associated with every node and the circuit formed by a solution covers a subset of nodes whose sum of weights meets a fixed value. We propose integer linear programming formulations for these problems. We also propose some valid inequalities for strengthening the models. The computational results show the efficiency of our formulations as we solve to optimality almost all the instances of the literature and outperform by an order of magnitude all the already published approaches.