Degree constrained minimum spanning tree problem: a learning automata approach
The Journal of Supercomputing
| Hi-index | 0.00 |
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In general, these problems are NP-Hard. In order to deal with the complexity of these problems, several strategies have been proposed. Among them, approaches using evolutionary algorithms have achieved relevant results. However, the graph encoding is critical for the performance of such approaches in network design problems. Aiming to overcome this drawback, alternative representations of spanning trees have been developed. This article proposes an encoding for generation of spanning forests by evolutionary algorithms.