A New Evolutionary Algorithm for the Bi-objective Minimum Spanning Tree

Authors:
Daniel A. M. Rocha;Elizabeth F. G. Goldbarg;Marco C. Goldbarg
Affiliations:
-;-;-
Venue:
ISDA '07 Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications
Year:
2007

Citing 0
Cited 1

A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial optimization problems with multiple objectives are, in general, more realistic representations of practical situations than their counterparts with a single-objective. The bi-objective minimum spanning tree problem is an NP-hard problem with applications in network design. In this paper a transgenetic algorithm is applied to this problem. A computational experiment compares the proposed approach with a memetic algorithm. The comparison of the algorithms is done with basis on three indicators and statistical tests.