摘要
复杂工程布局(如卫星舱布局)方案设计问题,在理论上属带性能约束的布局优化问题(NPC问题),很难求解。论文以卫星舱布局为例,将粒子群算法(PSO)应用于布局问题,构造此类问题的粒子表达方法,建立了此类问题的粒子群算法。文中通过3个算例(其中一个为已知最优解的算例)的数值计算,验证了该算法的可行性和有效性。
Scheme design and packing problems with behavioral constraints(inertia,balance,stability and vibration etc.)and constrained layout optimization problems belong to NPC.Taking the layout problem of satellite cabins as background,the authors extend the heuristic called″Particle Swarm Optimization″(PSO)to deal with the constrained layout optimization problems ,proposes a novel Particle presentation for the constrained layout optimization problems and compares the PSO with GA.The results of three examples(one of them is proposed by the authors,and its optimal solution is known)show that this algorithm is feasible and efficient.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第12期71-73,93,共4页
Computer Engineering and Applications
关键词
粒子群算法
最优布局
全局优化
Particle Swarm Optimization,Layout optimization,Global optimization
