We consider a supply chain in Norway comprising:
- Distribution center supplying customers
- 11 customers
- 11 petroleum products
Delivery can be made by:
- Oil products pipelines
- In case of delivery by rail, the petroleum products 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:
- DC – defines the plan of certification of oil products per day.
- Trestle 1, Trestle 2, Trestle 3 – defines the trestles throughput and products distribution by the corresponding transport.
- MPPL 1, MPPL 2 – defines pipeline throughput and products distribution by the corresponding transport.
- Port – defines port throughput and products distribution by the corresponding transport.
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 specify their demand as Min Stock for the last period (day).
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.
The Optimization Results page is opened by default.
It shows the result of the experiment with all the possible combinations filtered per Profit (NetOpt) statistics column.
The top record of the table is the best one.
The data on other details is shown in the corresponding tables:
How can we improve this article?