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

A hybrid Lagrangian Particle Swarm Optimization Algorithm for the degree-constrained minimum spanning tree problem

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

1 Author(s)
Ernst, A.T. ; CSIRO Math., Inf. & Stat., Clayton, VIC, Australia

This paper presents a new hybrid heuristic combining particle swarm optimization with a Lagrangian heuristic along the lines first proposed by Wedelin. We will refer to this as a Combinatorial Lagrangian Particle Swarm Optimization Algorithm (CoLaPSO). It uses a problem representations that works simultaneously in the dual space (Lagrangian multipliers) and the primal space in the form of cost perturbations. The CoLaPSO method is applied to solving the degree constrained minimum spanning tree problem. This NP-hard problem consists of finding a minimum cost spanning tree on a graph such that none of the vertices is connected to more than a fixed number of edges. The hybrid heuristic inherits from the Lagrangian parent an ability to calculate lower bounds on the objective and from the particle swarm optimization the ability to effectively parallelise the algorithm. Empirical evaluation using standard test problems from the literature show that the new method outperforms previously published heuristics for this problem and also computes useful lower bounds.

Published in:

Evolutionary Computation (CEC), 2010 IEEE Congress on

Date of Conference:

18-23 July 2010

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.