Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems

In this paper we describe and discuss the application of some genetic algorithm approaches, using Prüfer numbers for their encoding methods, for solving nonlinear minimum spanning tree problems. Next, we develop an algorithm based on tabu search method to solve a class of these problems. To evaluate and compare the performances of the proposed TS algorithm with GAs described in this paper, some computational experiments are provided.