An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Computers and Operations Research
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
A survey: algorithms simulating bee swarm intelligence
Artificial Intelligence Review
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
Information Sciences: an International Journal
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
The edge-window-decoder representation for tree-based problems
IEEE Transactions on Evolutionary Computation
A swarm intelligence approach to the quadratic multiple knapsack problem
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
Information Sciences: an International Journal
Particle swarm optimization for determining fuzzy measures from data
Information Sciences: an International Journal
A self-optimizing mobile network: Auto-tuning the network with firefly-synchronized agents
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
New heuristics for two bounded-degree spanning tree problems
Information Sciences: an International Journal
An empirical comparison of some approximate methods for graph coloring
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
An artificial bee colony algorithm for the unrelated parallel machines scheduling problem
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
An artificial bee colony algorithm for the maximally diverse grouping problem
Information Sciences: an International Journal
Artificial bee colony for the standard cell placement problem
International Journal of Metaheuristics
New heuristic approaches for the dominating tree problem
Applied Soft Computing
A hybrid metaheuristic for the cyclic antibandwidth problem
Knowledge-Based Systems
Integrating the artificial bee colony and bees algorithm to face constrained optimization problems
Information Sciences: an International Journal
Hi-index | 0.07 |
The quadratic minimum spanning tree problem (Q-MST) is an extension of the minimum spanning tree problem (MST). In Q-MST, in addition to edge costs, costs are also associated with ordered pairs of distinct edges and one has to find a spanning tree that minimizes the sumtotal of the costs of individual edges present in the spanning tree and the costs of the ordered pairs containing only edges present in the spanning tree. Though MST can be solved in polynomial time, Q-MST is NP-Hard. In this paper we present an artificial bee colony (ABC) algorithm to solve Q-MST. The ABC algorithm is a new swarm intelligence approach inspired by intelligent foraging behavior of honey bees. Computational results show the effectiveness of our approach.