Consider the following vehicle routing problem $($VRP$).$ The terminal and customer locations are

shown in the following sketch, and the distances between any two points are given in the table

below:

Distance

$($km$)$ T A B C D E

T $01623412531$

A $-030484042$

B $--0192243$

C $---01848$

D $----024$

E $-----0$

Suppose the trucks are large enough such that there are no physical capacity constraints.

However, there is a capacity constraint in terms of time, because you are required to deliver $($i$.$e$.,$

finish unloading, but not necessarily arrive at terminal$)$ to all customers between $9$am and

$10$:$20$am$.$ Each truck can travel at a steady speed of $70$km$/$hr$,$ and will spend $10$ minutes at each

customer location for unloading.

Using the savings heuristic, solve the above VRP $.$ Show your steps. $[10$ points$]$