Steiner最小树问题的量子蚁群算法.PDF

27 4 Vol.27 No.4 2012 8 JOURNAL OF SYSTEMS ENGINEERING Aug. 2012 Steiner , (, 200093) : SteinerNP, Steiner. Grover, , . , Steiner. : Steiner; ; ; : O22 : A :2012 A quantum-inspired ant colony algorithm for Steiner minimum tree problem HE Xiao-feng, MA Liang (School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China) Abstract: The Steiner tree problem is a typical NP-hard problem in combinatorial optimization. A quantum- inspired ant colony algorithm (QACA) for solving Euclidean Steiner minimum tree (ESMT) problem is pro- posed hereof based upon the combination of ant colony optimization and quantum computing. With the ant colony algorithm (ACA), quantum bits, quantum logic gates and the Grover’s algorithm combined, the capacity as well as the velocity of the algorithm for global search undergoes significant improvability. The computa- tional comparisons of a series of numerical examples show that the QACA has a better performance than the ACA for solving the ESMT problem. Key words: Euclidean Steiner minimum tree; ant colony algorithm; quantum computing; quantum-inspired ant colony algorithm 1 Steiner, Steiner(Steiner tree, ST) Steiner19 Fermat , , Steiner(Steiner minimum tree, SMT), Steiner. , Steiner Steiner(Euclidean Steiner minimum tree, ESMT) Steiner(rectilinear Steiner minimum tree, RSMT) , SMT NP. (ant colony algorithm) [1] Dorigo , TSP [2, 3] . 2080, BenioffFeynman. : : : ; (S30504). 468