The knapsack problem and the minimum spanning tree problem are both fundamental in operations research and computer science. We are concerned with a combination of these two problems. That is, we are given a knapsack of a fixed capacity, as well as an undirected graph where each edge is associated with profit and weight. The problem is to fill the knapsack with a feasible spanning tree such tha...

Genetic Algorithms (GAS) have been used to solve the NP-complete problems effectively such as the knapsack problem. One difficulty in applying GA to the knapsack problem is that the bit string representation of the canonical GA chromosome does not provide the direct mapping of the problem into the GA chromosome. In this paper, a new chromosome representation of the GA is proposed which is calle...