Multiobjective genetic search for spanning tree problem

Chakrabarti, P. P. ; Kumar, Rajeev ; Singh, P. K. (2004) Multiobjective genetic search for spanning tree problem Lecture Notes in Computer Science, 3316 . pp. 218-223. ISSN 0302-9743

Full text not available from this repository.

Official URL:

Related URL:


A major challenge to solving multiobjective optimization problems is to capture possibly all the (representative) equivalent and diverse solutions at convergence. In this paper, we attempt to solve the generic multi-objective spanning tree (MOST) problem using an evolutionary algorithm (EA). We consider, without loss of generality, edge-cost and tree-diameter as the two objectives, and use a multiobjective evolutionary algorithm (MOEA) that produces diverse solutions without needing a priori knowledge of the solution space. We test this approach for generating (near-) optimal spanning trees, and compare the solutions obtained from other conventional approaches.

Item Type:Article
Source:Copyright of this article belongs to Springer-Verlag.
ID Code:6004
Deposited On:19 Oct 2010 09:53
Last Modified:16 Jul 2012 04:46

Repository Staff Only: item control page