NO Shipments Scheduling

We consider a supply chain in Norway with distribution center supplying 11 customers with 11 petroleum products. Delivery can be made by three means of transportation: rail, tanker, and oil products pipelines. 

In case of delivery by rail, the petroleum profucts are taken from three trestles. In case of delivery by tanker, the petroleum products are taken from port or  two pipelines, which are at the disposal of the warehouse. The delivery method is agreed in advance. Hence the object representing the distribution center:

This example solves the problem of finding optimal daily shipment schedule, with one period being equal to one day. Since we know only total demand we need to represent customers as “Sites” and specifiy their demand as Min Stock for the last period (day).

The goal is to organize shipping schedule, allowing us to satisfy demand of all customers, deliver shipments by the corresponding vehicle type, and meet the physical restrictions of distribution center (max stock and max throughput).

The result of the experiment shows that we satisfy total customers demand without violating the limitations of port, trestles, pipelines throughput and storage capacity.

 

Related topics

Importing examples 

Running the NO experiment