TO Capacitated Transportation Optimization with Time Windows

We consider the existing beer supply chain in Germany with the following data:

Demand is aggregated for each week and varies from week to week. Considering the demand variations, we want to have 5 shipments in October and get a set of routes for each of them.


Find optimal set of routes to fulfill demand of all customers and reduce logistics costs taking into consideration that maximum distance between objects should not exceed 400 km.


The result of the experiment contains the optimal sets of routes that are obtained for each shipment considering all the defined restrictions.

By default, the results of the experiment are available in the Optimization Results tab. The data for the generated routes, transportation costs, and the covered distance is given in the corresponding tables:


Related topics

Importing examples 

Running the Capacitated TO experiment