AK_OKAN_END396_HW5.docx - QUESTION-1 a According to nearest neighbourhood algorithm We have to go to the nearest point from the starting point until we

# AK_OKAN_END396_HW5.docx - QUESTION-1 a According to nearest...

• 5

This preview shows page 1 - 5 out of 5 pages.

QUESTION-1 a)According to nearest neighbourhood algorithm, We have to go to the nearest point from the starting point until we go to all the cities. Then our route is ;0 → 2 → 1 → 5 → 3 → 4 → 0Total Distance: 4 + 7 + 6 + 4 + 6 + 5 = 32Total Transportation Time: 32 / 60 = 0.533 hours Total Cost = 32 × 0.455 = 14.56 TLb)Saving between city i and j = SijCost of Separate visit = C A = c 0i+ c i0+ c 0j+ c j0Cost of visit two cities on same route = C B = c 0i + c ij+ c j0Sij= C A – C BSİJ12345174011271033414840043511383Iteriation 1Route : 0 → 1 → 5 → 0 Distance → 23Iteriation 2Route : 0 → 1 → 5 → 3 → 0 Distance → 25Iteriation 3Route : 0 → 1 → 2 → 5 → 3 → 0 Distance → 34Iteriation 4Route : 0 → 2 → 1 → 5 → 3 → 4 → 0 Distance → 32(The results are the same as the above (a))
c)Iteriation 1Route : 0 → 1 → 2 → 0 Distance → 21Time → 39Iteriation 2Route : 0 → 3 → 5 → 0 Distance → 16Time → 34Iteriation 3Route : 0 → 4 → 0 Distance → 10Time → 19Iteriation 4