In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log ...In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree.展开更多
笔者针对变压器式可控电抗器(controllable reactor of transformer type,CRT)不同的控制绕组结构,将其分类为单控制绕组型、多控制绕组型、多并联支路型、控制绕组分级式。综述了CRT的研究历史与现状,并分析了各种CRT的结构特点、性能...笔者针对变压器式可控电抗器(controllable reactor of transformer type,CRT)不同的控制绕组结构,将其分类为单控制绕组型、多控制绕组型、多并联支路型、控制绕组分级式。综述了CRT的研究历史与现状,并分析了各种CRT的结构特点、性能的优缺点,最后对CRT研究发展的前景进行了分析。展开更多
基金This paper was supported by Ph. D. Foundation of State Education Commission of China.
文摘In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree.
文摘笔者针对变压器式可控电抗器(controllable reactor of transformer type,CRT)不同的控制绕组结构,将其分类为单控制绕组型、多控制绕组型、多并联支路型、控制绕组分级式。综述了CRT的研究历史与现状,并分析了各种CRT的结构特点、性能的优缺点,最后对CRT研究发展的前景进行了分析。
