Question: Consider the given network. Suppose that the cycle 1+5+3+1 as indicated was obtained during the execution of an insertion heuristic. Beskou die gegewe netwerk. Veronderstel

Consider the given network. Suppose that the

Consider the given network. Suppose that the cycle 1+5+3+1 as indicated was obtained during the execution of an insertion heuristic. Beskou die gegewe netwerk. Veronderstel dat die siklus 1 +5 +3 + 1 soos aangedui verkry is tydens die uitvoering van 'n invoegingsheuristiek, 2 22 11 3 8 6 18 12 5 16 13 1 7 6 19 20 10 6 19 a. Do one iteration of the cheapest insertion heuristic. What is the new cycle that is obtained? Give the cycle in terms of the node indices. Doen een iterasie van die goedkoopste invoegingsheuristiek. Wat is die nuwe siklus wat verkry word? Gee die siklus in terme van die nodusindekse. [3] b. What is the length of this new cycle? Wat is die lengte van hierdie nuwe siklus? [2] c. Consider the given network again. Do one iteration of the closest insertion heuristic. What is the new cycle that is obtained? Give the cycle in terms of the node indices Beskou weer die gegewe netwerk. Doen een iterasie van die naaste invoegingsheuristiek. Wat is die nuwe siklus wat verkry word? Gee die siklus in terme van die nodusindekse. [3] d. What is the length of this new cycle? Wot is die lengte van hierdie nuwe siklus? [2]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!