Question: Reconsider the example of a constrained minimum spanning tree problem presented in Sec. 13.2 (see Fig. 13.7 (a) for the data before introducing the constraints).
Reconsider the example of a constrained minimum spanning tree problem presented in Sec. 13.2 (see Fig. 13.7
(a) for the data before introducing the constraints). Starting with a different initial trial solution, namely, the one with links AB, AD, BE, and CD, apply the basic tabu search algorithm again to this problem.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
