function project$\_10()$

$\%$ PROJECT$\_10$ project$\_10()$ is the driver function for the program.

$\%$

$\%$ Name:

$\%$ Date:

$\%$ Class: CMPSC $200$

$\%$ Description: Determine the optimal location of a warehouse

$\%$

$\%$ Use print$\_$splash$\_$screen to print your splash screen

$\%$ Enter the locations of the customers using a single call

$\%$ to get$\_$locations $-$ in the get$\_$locations function you will

$\%$ need to call get$\_$data twice for each customer. You must use

$\%$ get$\_$data to error check that all locations are between $0$

$\%$ and $100$

$[$X$1,$ X$2,$ X$3,$ X$4,$ X$5,$ Y$1,$ Y$2,$ Y$3,$ Y$4,$ Y$5]=$ get$\_$locations$()$;

$\%$ Prompt the user for the customer volumes

$\%$ Again you only have a single call to get$\_$volumes $-$ in the

$\%$ get$\_$volumes function you will

$\%$ need to call get$\_$data once for each customer. You must use

$\%$ get$\_$data to error check that all volumes are greater than or

$\%$ equal to $0$

$[$V$1,$ V$2,$ V$3,$ V$4,$ V$5]=$ get$\_$volumes$()$; $\%$ Get the five volumes

$\%$ Find the optimal location

$\%$ Note that there ten input values to this function, three for each

$\%$ customer

$[$x$,$ y$,$ lowest$\_$cost$]=$ find$\_$optimal$($X$1,$ X$2,$ X$3,$ X$4,$ X$5,$ Y$1,$ Y$2,$ Y$3,$ Y$4,$ Y$5,$

V$1,$ V$2,$ V$3,$ V$4,$ V$5)$;

$\%$ Print results from the optimization

print$\_$results$($x$,$ y$,$ lowest$\_$cost$)$;

end

function $[$x$\_$opt, y$\_$opt, min$\_$cost$]=$ find$\_$optimal$($X$1,$ X$2,$ X$3,$ X$4,$ X$5,$ Y$1,$ Y$2,$ Y$3,$

Y$4,$ Y$5,$ V$1,$ V$2,$ V$3,$ V$4,$ V$5)$

$\%$ FIND$\_$OPTIMAL find$\_$optimal$($xLoc$,$ yLoc, shipVolumes$)$ is function that

$\%$ uses a brute force algorithm to find the optimal location of a warehouse.

$\%$

$\%$ The function returns three values; the optimal x and y coordinates and

$\%$ the minimum cost

$\%$

$\%$ Name:

$\%$ Date:

$\%$ Class: CMPSC $200$

$\%$

$\%$

$\%$ Set a minimum value for the cost $-$ this should be a big number $(1$e$99)?$

min$\_$cost $=1\mathrm{.}0$e$99$;

$\%$ Set the starting the optimal locations $-$ make it impossible $(-1,-1)?$

x$\_$opt $=-1$;

y$\_$opt $=-1$;

$\%$ Create two nested for loops that step through all of the possible

$\%($x$,$ y$)$ pairs

for y $=[0$:$100]$

for x $=[0$:$150]$

$\%$ Calculate the $5$ distances and $5$ costs

$\%$ You should use a get$\_$distance function and call it five

times

$\%$ and then call get$\_$cost five times. Each call will use the

$\%$ distance and the volume for that customer

$\%$ Calculate the total cost by summing the five costs

$\%$ Now check the cost against the current min$\_$cost $-$ this is a

$\%$ simple if$.$ If the new cost is less than min$\_$cost$,$ change

$\%$ min$\_$cost and set x$\_$opt and y$\_$opt to the current

$\%$ location $($x$,$ y$).$ If it is not then you do not need to do

$\%$ anything

if$($cost $<$ min$\_$cost$)$

end

end

end

end solve this with ai