Question

Reconsider the example of a constrained minimum spanning tree problem presented in Sec. 14.2 (see Fig. 14.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.


$1.99
Sales0
Views32
Comments0
  • CreatedSeptember 22, 2015
  • Files Included
Post your question
5000