An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

doi:10.1016/j.asoc.2008.09.001

An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

2009-03-01

366

PRE

AI

A

Alok Singh *

DOI：10.1016/j.asoc.2008.09.001

原文链接

原文求助

摘要

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.

Keyword:

Artificial bee colony algorithm

Constrained optimization

Leaf-constrained minimum spanning tree

Swarm intelligence

An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

摘要

AI总结

期刊

机构

引用论文