Improvement of bounded-diameter MST instances with hybridization of multi-objective EA

Authors:
Soma Saha;Rajeev Kumar
Affiliations:
Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India;Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India
Venue:
Proceedings of the 2011 International Conference on Communication, Computing & Security
Year:
2011

Citing 15
Cited 0

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Compression of correlated bit-vectors

Information Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm

Evolutionary Computation
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Computing a diameter-constrained minimum spanning tree

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

Proceedings of the 2003 ACM symposium on Applied computing
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy

Evolutionary Computation
Minimum spanning trees made easier via multi-objective optimization

Natural Computing: an international journal
Improved heuristics for the bounded-diameter minimum spanning tree problem

Soft Computing - A Fusion of Foundations, Methodologies and Applications
On quality performance of heuristic and evolutionary algorithms for biobjective minimum spanning trees

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Greedy heuristics for the bounded diameter minimum spanning tree problem

Journal of Experimental Algorithmics (JEA)
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
Multiobjective EA approach for improved quality of solutions for spanning tree problem

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Bounded Diameter (a.k.a Diameter Constraint) Minimum Spanning Tree (BDMST/DCMST) is a well-known combinatorial optimization problem. In this work, we recast a few well-known heuristics, which are evolved for BDMST problem, to a Bi-Objective Minimum Spanning Tree (BO-MST) problem and then obtain Pareto fronts. On visualizing the Pareto fronts, it is observed that none of the heuristics provides the best solution across the complete range of the diameter. We have used a Multi-Objective Evolutionary Algorithm (MOEA) approach to improve the Pareto front for BOMST, which in turn provides better solution for BDMST instances. We observe that the MOEA provides improved Pareto front solutions across the complete range of the diameter over Pareto front solutions generated from individual heuristics.