Seven customers are to be served by a depot. The distance between the depot and the customers, and between the different customers are all known and are shown in matrix. There are only 2 vehicles available and the vehicles can travel maximum of 40 km in a day, at the end of which they have to back at the depot. Solve with nearest neighbour algorithm. Cust. 1 Cust. 2 Cust. 3 Cust. 4 Cust. 5 Cust. 6 Cust. 7 Depot 0 11 Cust. 1 11 9 10 18 19 2 11 Cust. 2 7 8 13 9 10 8 Cust. 3 9 1 10 12 10 Cust. 4 10 13 8 13 Cust. 5 10 9 16 Cust. 6 7 18