%0 Journal Article
%T Study on layout problem using quantum-behaved particle swarm optimization algorithm<br>量子行为粒子群优化算法的布局问题研究
%A HUANG Jian-jiang
%A XU Wen-bo
%A SUN Jun
%A DONG Hong-wei
%A <br>黄建江
%A 须文波
%A 孙俊
%A 董洪伟
%J 计算机应用
%D 2006
%I 
%X Quantum-Behaved Particle Swarm Optimization (QPSO) was applied to layout problem of two-dimensional irregular polygons based on the Heuristic Bottom-Left (HBL) algorithmof polygons scan conversion method. The layout particles were constructed, and the processes of layout optimization using QPSO and Simulated Annealing Genetic Algorithms (SAGA) were given. By comparing QPSO to SAGA in layout optimization, experimental results show that QPSO is a kind of more efficient optimization algorithm for layout problem.
%K Quantum-behaved Particle Swarm Optimization (QPSO)
%K layout optimization
%K two-dimensional irregular polygons
%K Simulated Annealing Genetic Algorithms (SAGA)
%K heuristic bottom-left algorithm<br>量子行为粒子群算法
%K 布局优化
%K 二维不规则多边形
%K 模拟退火遗传算法
%K 启发式底左算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=90421FF82A0E2FCC&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=59906B3B2830C2C5&sid=05F456AEC361A0E3&eid=D6A29273B6F10BE7&journal_id=1001-9081&journal_name=计算机应用&referenced_num=5&reference_num=8