Cellular Competitive Decision Algorithm for Minimum Ratio Spanning Tree
2012 ◽
Vol 490-495
◽
pp. 365-369
◽
Keyword(s):
Minimum ratio spanning tree(MRST) is the problem of finding a minimum spanning tree when the objective function is the ratio of two linear cost functions(such as the ratio of cost to weight). MRST problem is NP-hard when the denominator is unrestricted in sign. Cellular Competitive decision algorithm(CCDA) is a newly proposed meta-heuristic algorithm for solving combinatorial optimization problems. In this paper, a cellular competitive decision algorithm for MRST is presented. To verify the efficiency of the algorithm, it is been coded in Delphi 7, by which series of instances are tested and results result in good performance.
2021 ◽
pp. 32-36
2014 ◽
Vol 7
(5)
◽
pp. 827-852
◽
2006 ◽
Vol E89-A
(9)
◽
pp. 2441-2444
◽
2020 ◽
Vol 34
(02)
◽
pp. 1603-1610
◽
1994 ◽
Vol 30
(6)
◽
pp. 702-711
2014 ◽
Vol 134
(3)
◽
pp. 466-467