A delivery problem. The local distributor of Blahs Beer has set up a ware house in an industrial park on the south side of Sudsville. The distributor is interested in increasing the effectiveness of the delivery process and has had the office staff identify all the demund points for Blahs. all the bars, restaurants, and liquor stores that are willing to distribute a product of such dubious quality In addition, the staff has been instructed to create on paper many feasible routes for the delivery trucks. Each route begins and ends at the warehouse and wll
Fit a four hour period. That is the trucker can load drive and distribute the entire contents of the truck and return to the warehouse in the time between check-in and lunch or between the end of lunch and quitting lime. Each route in volves a truck whose tota volume to delivery does not exceed its carrying capacity. Also, when the delivery truck stops at one of the drop-off points, it fills the entire demand at that drop-off point. Each delivery route is assumed to have approxlmarelv the same cost as any other. The distributor calls the local university to sec if he can gela systems engineer ing class to select the least number of delivery routes that will serve all the firm's custome rs. This is your task- structure the appropriate 0, 1 program for the distributor's problem.
Let: i , I = the index and set of demand points;
j, J = index and set of delivery routes; and
Ni = {the set of delivery routes j thai include delivery drop-off point i}.
Suppose the optimal solution produced by the method you suggested included two routes which bo th had delivery to the same point. How would you tell the distributor to treat this result'?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.