.png){kind=icon}
Return
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2008.09.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given an undirected, connected, weighted graph, the leaf-constrained minimum spanning tree (LCMST) problem seeks on this graph a spanning tree of minimum weight among all the spanning trees of the graph that have at least l leaves. In this paper, we have proposed an artificial bee colony (ABC) algorithm for the LCMST problem. The ABC algorithm is a new metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm. We have compared the performance of our ABC approach against the best approaches reported in the literature. Computational results demonstrate the superiority of the new ABC approach over all the other approaches. The new approach obtained better quality solutions in shorter time. (c) 2008 Elsevier B.V. All rights reserved.
Keywords:
Artificial bee colony algorithm
Constrained optimization
Leaf-constrained minimum spanning tree
Swarm intelligence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
No organization information available
.png){kind=icon}
