We consider a supply chain with two warehouses (located in Alīgarh and Navi Mumbai), which supply 35 customers (20 in PLE version) in India with tea. Demand is historical: exact number of products is delivered to customers on a specific date.
The goal is to form a sequence of destination points (customers) that will be served in a certain order considering:
- Locations of sites and customers,
- Paths between them,
- Demand of the customers
- Capacity of the vehicle type used to deliver products, which is 50 m3 (30 m3 in PLE version)
The truck will be able to fetch orders for several destination points, which will be visited in accordance with the specified index. This will reduce costs.
We would like to meet the following requirements:
- 5 shipments in September
- Maximum distance between objects - 1800 km
- Maximum length of the returning segment - 2000 km
The result of the experiment offers a delivery schedule with optimal routes. The data on the generated paths, transportation costs, traveled distance is shown in the corresponding tables.
How can we improve this article?