Efficient cycle search for the minimum routing cost spanning tree problem
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Given a connected, weighted, and undirectedgraph, the minimum routing cost spanning treeproblem seeks on this graph a spanning tree ofminimum routing cost, where routing cost is defined asthe sum of the costs of all the paths connecting twodistinct vertices in a spanning tree. In this paper wehave proposed a perturbation based local search forthis problem. We have compared our approach againstthree methods reported in the literature – two geneticalgorithms and a stochastic hill climber.Computational results show the effectiveness of ourapproach.