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

Authors:
Sílvia M. Monteiro;Elizabeth F. Goldbarg;Marco C. Goldbarg
Affiliations:
Department of Informatics and Applied Mathematics, Universidade Federal do Rio Grande do Norte, Natal, Brazil;Department of Informatics and Applied Mathematics, Universidade Federal do Rio Grande do Norte, Natal, Brazil;Department of Informatics and Applied Mathematics, Universidade Federal do Rio Grande do Norte, Natal, Brazil
Venue:
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Year:
2009

Citing 5
Cited 0

Minimum-weight spanning tree algorithms a survey and empirical study

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Evolutionary Algorithm for the Bi-objective Minimum Spanning Tree

ISDA '07 Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications
A memetic algorithm for the biobjective minimum spanning tree problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the application of a plasmid based transgenetic algorithm to the biobjective spanning tree problem, an NP-hard problem with several applications in network design. The proposed evolutionary algorithm is inspired on two major evolutionary forces: the horizontal gene transfer and the endosymbiosis. The computational experiments compare the proposed approach to another transgenetic algorithm and to a GRASP algorithm proposed recently for the investigated problem. The comparison of the algorithms is done with basis on the binary additive ***-indicator. The results show that the proposed algorithm consistently produces better solutions than the other methods.