Cellular Competitive Decision Algorithm for Minimum Ratio Spanning Tree

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 490-495)

Pages:

365-369

Citation:

Online since:

March 2012

Export:

Price:

[1] R. Ahuja, T. Magnanti, etc.: Network Flows, Prentice Hall, Englewood Cliffs NJ, (1993).

Google Scholar

[2] Syslo, M.M., Deo N., Kowalik JS. Discrete Optimization Algorithms, Englewood Cliffs, Prentice-Hall. (1983).

Google Scholar

[3] Liang Ma, Gang Zhu, Aibing Ning. Ant Colony Optimization Algorithm: Science press, Beijing, (2008).

Google Scholar

[4] Christopher C. Skiscim, Susan W. Palocsay. The Complexity of Minimum Ratio Spanning Tree Problems: Journal of global optimization, Vol 4(2004), pp.335-346.

DOI: 10.1007/s10898-004-5119-8

Google Scholar

[5] S. Gountia S.K. Sahoo. Studies on Clustering based on Minimal Ration Spanning Tree in a Fuzzy Graph: International journal of computer applications, Vol 8(2011), pp.8-13.

DOI: 10.5120/3054-4157

Google Scholar

[6] Aibing Ning, Bo Wang, Xiaohua Xiong, Liang Ma. Principles and Applications of Competitive Decision Algorithm: Journal of University of Shanghai for Science and Technology, Vol 4(2008), pp.369-373, in Chinese.

Google Scholar

[7] AiBing Ning, Liang Ma. Competitive Decision Algorithm and its Application to Vehicle Routing Problem: Journal of management sciences in China, Vol 6(2005), pp.10-18, in Chinese.

Google Scholar

[8] Xiaohua Xiong, Aibing Ning, Liang Ma. Competitive Decision Algorithm for Multidimensional Knapsack Problem based on Multi-exchange Neighborhood Search: System engineering theory and practice, Vol 8(2010), pp.1448-1456, in Chinese.

Google Scholar

[9] Xiaohua Xiong, Liang Ma, Aibing Ning. Competitive Decision Algorithm for Multiple-choice Knapsack Problem based on Reduction: 2010 International Conference on Computer Modeling and Simulation, 2010, pp.344-348.

DOI: 10.1109/iccms.2010.442

Google Scholar

[10] Wolfram S. Theory and application of cellular automata, Singapore: The world Scientific publishing company limitd, (1986).

Google Scholar

[11] Xiaohua Xiong, Liang Ma, AiBing Ning. Cellular Competitive Decision Algorithm for Multi-Objective 0-1 Programming Problem: Journal of university of Shanghai for Science and Technology Vol. 3(2011), pp.163-167, in Chinese.

Google Scholar

[12] Xiaohua Xiong, AiBing Ning, Liang Ma. Cellular Competitive Decision Algorithm for Degree-constrained Minimum Spanning Tree: Journal of Shanghai Second Polytechnic University Vol. 3(2011), pp.207-213, in Chinese.

Google Scholar