Solve using brute force and heuristic method 3. Four locations in a department a
ID: 410173 • Letter: S
Question
Solve using brute force and heuristic method 3. Four locations in a department are being considered for the installation of a new drill to be operated by five workers who will have to travel to and from their stations in order to use it. The time required for each worker to travel to each location and the number of trips to be made by each are shown in the accompanying table. Location WorkerA D Demand 0.50 0.30 30 210 0.70 1.60 0.40 040 2.20 200 080 1.30 0.60 1.30 0.75 1.00 2.00 15 1.40 0.50 0.90 2.10 0.80 17 0.30 Determine the best location for the drill. If another drill machine could be purchased, what would be the two best locations for these machines?
Explanation / Answer
Brute force method considers all the possible alternatives for determining the optimal solution. Using brute force method, we calculate the total transportation for every possible alternative of locaitons for the three computers and select the best locations which minimize the total transportation time.
The Minimum transportation time from department A is 1 to location 6.
Minimum transportation time from department B is 0 for location 4
Minimum transportation time from department C is 1 for location 3
Minimum transportation time from department D is 0 for location 6
Minimum transportation time from department E is 2 for location 3
Minimum transportation time from department F is 0 for location 2.
First alternative solution: locations 3,4 and 6, to service all the six departments. Total transportation time
= 1*8 + 0*16 + 1*24 + 0*10 + 2*4 + 4*15
= 100
Second alternative solution:
locations 2,3 and 6, to service all the six departments. Total transportation time
= 1*8 + 2*16 + 1*24 + 0*10 + 2*4 + 0*15
= 72
Second alternative provies the minimum transportation time.
Therefore, the best locations for the computers are 2, 3 and 6