New benchmark instances for Waste Collection Synchronization

Description

This benchmark, based on the Solomon instances, has been generated for solving a Vehicle Routing Problem with Synchronization for Waste Collection. The Solomon instances include information on a single depot and customer locations, demand, time windows, vehicle capacity, and fleet size. To adapt these instances to our multi-synchronization problem, the following modifications were made: up to three waste types are considered simultaneously, with demands assigned using a non-negative discrete uniform distribution bounded above by the original demand values; synchronization time windows are introduced by doubling and halving the original durations; each customer may submit three different bids, with the highest bid assigned to the shortest time window and the lowest to the widest, thereby reflecting a preference for more restrictive time intervals; finally, a fleet of 20 vehicles with homogeneous capacity of 200 units per waste type is assumed. These bid values are computed mathematically based on a baseline corresponding to the cost of serving a customer via the trivial route (depot–customer–depot), to which a small random factor is applied. In cases where transportation costs vary depending on the type of waste, that is, when a function to weigh each type of waste is considered, the same procedure is applied, taking into account the specific waste type generated by each customer. The files storing the instances are denoted as "f", "f2", "ftc", and "f2tc", wherein "tc" indicates an instance created with weighted wastes taken into account and "2" indicates an instance for two types of waste; otherwise, the instances were created for either non-weighted wastes or three types of wastes. Each instance file presents the following variables: — customer: unique ID identifier associated with each customer; 0 is reserved for the depot (numeric). — xCoord: the value of the x coordinate in Euclidean space (numeric). — Coord: the value of the y coordinate in Euclidean space (numeric). — demandWasteType1: non-negative demand value for the first type of waste (numeric). — demandWasteType2: non-negative demand value for the second type of waste (numeric). — demandWasteType3: non-negative demand value for the third type of waste (numeric). — readyTime: value in minutes at which a customer's time window starts; start of the planning horizon if depot (numeric). — dueDateNarrow: value in minutes at which a customer's shortest time window ends (numeric). — dueDate: value in minutes at which a customer's base time window ends (numeric). — dueDateWide: value in minutes at which a customer's widest time window ends (numeric). — service: value in minutes of vehicle's service time at the customer (numeric). — bidNarrow: value associated with the customer's shortest time window (numeric). — bid: value associated with the customer's base time window (numeric). — bidWide: value associated with the customer's widest time window (numeric).

Institutions

Categories

Funding

Licence