TO US Distribution Network

We consider a supply chain with two warehouses (located in New York and Los Angeles), which supply 25 customers with headphones. The goal is to form a succession of destination points (customers) that will be served in a certain order considering only locations of sites and customers, and paths between them. It allows a truck to fetch orders for several destination points and follow the route per their specified index. This will reduce costs.

We want a route to have maximum 10 customers, with maximum distance between them of 2000 km (the maximum length of the returning segment must be 500 km).

The result of the experiment contains 4 optimal routes (2 from DC New York and 2 from DC Los Angeles). The data on generated paths, and segments of the paths (transportation costs, traveled distance) is shown in the corresponding tables.


Related topics

Importing examples 

Running the TO experiment