Every day a widget supplier supplies widgets from the warehouse ( W ) to four locations - Ahmednagar (A), Bikrampore (B), Chitrachak (C), and Deccan Park (D). The daily demand for widgets in each location is uncertain and independent of each other. Demands and corresponding probability values (in parenthesis) are given against each location (A, B, C, and D) in the figure below. For example, there is a chance that the demand in Ahmednagar will be units and a 60% chance that the demand will be units. The lines in the figure connecting the locations and warehouse represent two-way roads connecting those places with the distances (in km ) shown beside the line. The distances in both the directions along a road are equal. For example, the road from Ahmednagar to Bikrampore and the road from Bikrampore to Ahmednagar are both long.
Every day the supplier gets the information about the demand values of the four locations and creates the travel route that starts from the warehouse and ends at a location after visiting all the locations exactly once. While making the route plan, the supplier goes to the locations in decreasing order of demand. If there is a tie for the choice of the next location, the supplier will go to the location closest to the current location. Also, while creating the route, the supplier can either follow the direct path (if available) from one location to another or can take the path via the warehouse. If both paths are available (direct and via warehouse), the supplier will choose the path with minimum distance.
Solution
Understanding the set :-
- A widget supplier supplies widgets from the warehouse (W) to four locations – Ahmednagar (A), Bikrampore (B), Chitrachak (C), and Deccan Park (D).
- The figure in the set gives - Demands and corresponding probability values against each location (A, B, C, and D) ;
- Starts from the warehouse and ends at a location after visiting all the locations exactly once
- While making the route plan, the supplier goes to the locations in decreasing order of demand. If equal demand, goes to the nearest ones first
- While creating the route, the supplier can either follow the direct path (if available) from one location to another or can take the path via the warehouse(Prefers minimum distance)
This is a routes and network set, in this type of set there is no definite table we can make from the set, rather Answer depends on the questions of the set.
In the question, it is given that last location is A.
The demand in the remaining places should be greater than A.
This implies A demand cannot be 70 units. Therefore, it is 50 units
The demand of the location D is 30 or 50 units.
This implies this should be placed before D.
The demand of the location placed before D should be greater than or equal to 50 units
Location supplier visited before D is B(60 units of demand).
It cannot be C because values of C is greater than the values of B.
Therefore, order is C - B - D - A
From warehouse to C - 12 km
C to B - 4 km
B to D - 12 km
D to A - 7 km (through warehouse)
Total distance covered =
[This question is removed from the paper because if the order is CBDA, the supplier will go to A from B (and hence the last city visited will be D)]