A swarm intelligence approach to the minimum reload cost spanning tree problem

dc.contributor.author	Khalil, Abobakr
dc.contributor.author	Singh, Alok
dc.date.accessioned	2022-03-27T06:03:33Z
dc.date.available	2022-03-27T06:03:33Z
dc.date.issued	2010-12-01
dc.description.abstract	This paper deals with a problem on edge-colored graphs. The aim is to find a minimum reload cost spanning tree using Ant Colony Optimization (ACO) approach. Given an edge-colored graph, reload costs arise at nodes and depend on the pair of colors on the edges used in traversal through that node. The problem finds practical applications in several domains viz. telecommunication, energy, transportation etc. In addition to an ACO algorithm, we have also implemented a greedy heuristic and a random search technique. Computational results show that ACO approach is able to find better solutions to this problem in comparison with greedy and random search techniques. © 2010 IEEE.
dc.identifier.citation	2010 1st International Conference on Parallel, Distributed and Grid Computing, PDGC - 2010
dc.identifier.uri	10.1109/PDGC.2010.5679908
dc.identifier.uri	http://ieeexplore.ieee.org/document/5679908/
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9226
dc.title	A swarm intelligence approach to the minimum reload cost spanning tree problem
dc.type	Conference Proceeding. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1