Instances for the problem of Balancing Customer Clusters under Relocation Constraints

This repository contains a set of files with the instances used in the computational experiments for the problem of balancing customer clusters under relocation constraints. File name convention The name of each file has the following format: InstanceName_Km_Type.csv, where: InstanceName is the name of the original TSPLIB problem used as the base (e.g., usa13509, brd14051, d15112, d18512). m is the number of clusters (50, 100 or 200). Type is either "A" or "B", indicating the criteria used to create the feasible reassignments for the customers. Type A: Feasibility is strictly determined by a geometric distance threshold. Type B: Feasibility is restricted to a random subset of the adjacent clusters. File structure Each .csv file contains a table where each row represents a customer (node) of the problem. The columns are defined as follows: Node_ID: Unique identifier of the customer as defined in the original TSPLIB file. Coord_X: The X coordinate of the customer. Coord_Y: The Y coordinate of the customer. Assigned_Cluster: The ID of the cluster to which the customer is initially assigned (values range from 0 to m-1). Num_Allowed_Clusters: The number of other clusters the customer can be reassigned to. List_Allowed_Clusters: A comma-separated list of Cluster IDs that are feasible destinations for the customer. Contact For any questions or further information, please contact José A. Iranzo at [e-mail]