Cart (Loading....) | Create Account
Close category search window

Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Goldbarg, E.F.G. ; Universidade Federal do Rio Grande do Norte, Brazil (phone: 55-84-3215-3814; fax: 55-84-3215-3815; e-mail: ; de Souza, G.R. ; Goldbarg, M.C.

This paper presents a particle swarm optimization algorithm for the multi-criteria degree constrained minimum spanning tree problem. The operators for the particle's velocity are based upon local search and path-relinking procedures. The proposed heuristic is compared with other evolutionary algorithm presented previously for the same problem. A computational experiment is reported. The results show that the method proposed in this paper finds high quality solutions for the problem.

Published in:

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Date of Conference:

0-0 0

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.