OPERATIONS MANAGEMENT

$2$J VRP Exact Solution Approach

A retailer is planning on locating a warehouse facility on node $5$ to serve the region. The daily

demands are $w1=6,w2=3,w3=5w4=4,w5=4,w6=5.$ To estimate the daily operational costs the

warehouse will incur, management would like to know the minimum distance traveled by

vehicles with capacity of $10$ to satisfy all the demands in the region.

Observe that the depot $($which we can represent as a new node $0)$ is located at point $5,$ but a

vehicle will need to be sent out to satisfy the customers in location $5,$ even if their distance to the

depot is negligible $($the distance from depot, i$.$e$.$ new node $0,$ to location $5$ is $0$ in the distance

matrix$).$

a$)$ Write down two different formulations of the problem.

b$)$ Solve the problem exactly using one of them.

please write out all steps and numerical solution

$2$ VRP Heuristic Solution Approaches

a$)$ Solve the VRP problem above using a heuristic of your choice. Provide a pseudo$-$code of

your heuristic and show your work. You can do this by hand. No need to write a

computer code.

b$)$ What is the quality of the solution you developed?