Abstract
Given a connected, weighted, undirected graph G=(V, E) and a bound d. The Degree-Constrained Minimum Spanning Tree problem (DCMST or d-MST) seeks the spanning tree with smallest weight in which no vertex have degree more than d. This problem is NP-hard with d≥2. This paper proposes a new Particle Swarm Optimization algorithm for solving the d-MST problem. The proposed algorithm uses some new methods for selecting vector of particles. Results of computational experiments are reported to show the efficiency of the algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goldbarg, E.F.G., de Souza, G.R., Goldbarg, C.: Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree. IEEE Congress on Evolutionary Computation, 1527–1534 (2006)
Zhou, G., Gen, M.: Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Engineering Design & Automation 3(2), 157–165 (1997)
Gottlieb, J., Julstrom, B.A., Raidl, G.R., Rothlauf, F.: Prüfer numbers: A poor representation of spanning trees for evolutionary search (2000)
Knowles, J., Corne, D.: A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem. IEEE Trans. on Evolutionary Computation 4(2), 125–134 (2000)
Krishnamoorthy, M., Ernst, A.T., Sharaiha, Y.M.: Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. Journal of Heuristics 7, 587–611 (2001)
Hanr, L., Wang, Y.: A Novel Genetic Algorithm for Degree-Constrained Minimum Spanning Tree Problem. IJCSNS International Journal of Computer Science and Network Security 6(7A) (2006)
Krishnamoorthy, M., Craig, G., Palaniswarmi, M.: Comparison of heuristic algorithms for the degree constrained minimum spanning tree. In: Osman, I.H., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, pp. 83–96 (1996)
Hansen, P., Mladenovíc, N.: An Introduction to variable neighborhood search. In: Vos, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Metaheuristic: Advances and trends in local Search Procedures for Optimization. Kluwer, Dordrecht (1999)
Bui, T.N., Zrncic, C.M.: An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree. In: GECCO 2006 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Binh, H.T.T., Nguyen, T.B. (2008). New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_110
Download citation
DOI: https://doi.org/10.1007/978-3-540-89197-0_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89196-3
Online ISBN: 978-3-540-89197-0
eBook Packages: Computer ScienceComputer Science (R0)