On quality performance of heuristic and evolutionary algorithms for biobjective minimum spanning trees

Authors:
Rajeev Kumar;Pramod Kumar Singh
Affiliations:
Indian Institute of Technology Kharagpur, Kharagpur, India;Indian Institute of Technology Kharagpur, Kharagpur, India
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 2
Cited 2

Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Proceedings of the 2003 ACM symposium on Applied computing
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation

Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem: MOGP for BDMST

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Improvement of bounded-diameter MST instances with hybridization of multi-objective EA

Proceedings of the 2011 International Conference on Communication, Computing & Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a biobjective minimum spanning tree problem (MOST) and minimize two objectives - tree cost and diameter - in terms of Pareto-optimality. We assess the quality of obtained MOEA solutions in comparison to well-known diameter-constrained minimum spanning tree (dc-MST) algorithms and further improve MOEA solutions using problem-specific knowledge.