装填布局问题的三元组编码方法求解  

The Coding Method of Triple Group in Packing Layout Problem Solving

作　　者：宗立成[1] 余隋怀[1] 刘国昌[1] 范文[1] 

机构地区：[1]西北工业大学工业设计研究所,西安710072

出　　处：《机械科学与技术》2014年第1期93-97,共5页Mechanical Science and Technology for Aerospace Engineering

基　　金：国家863计划项目(2009AA093303);西北工业大学研究生创业种子基金项目(Z2012031)资助

摘　　要：装填布局问题的求解已经被证明是NPC问题,最终求解的结果是符合约束条件的最优解。布局设计问题在求解中一般会采用启发式算法和智能算法对布局问题进行建模求解。针对机械产品布局问题,描述了该问题的求解思路和三元组模拟退火编码方法,并通过实例对三元组分解编码方法在机械产品布局问题上的有效性进行验证。The solution of packing layout problem has been proved to be NPC problem, the result of solving the problem is the optimal solution which constraint conditions. Actually, the way of packing layout widely used in ma chinery manufacturing, industry, large scale integrated circuit design, transportation, combination machine tools, aerospace, etc. The layout design of Mechanical product has extensive application bac mechanical layout design will get good mechanical properties. Generally, people using heuristic kground, excellent algorithm and intel ligent algorithm to solve the problems of layout with modeling. This paper according to the mechanical product lay out, describe the way of solving the layout problem and the coding method of triple group, and through an example to verify the validity of triple group coding in the mechanical product layout.

关 键 词：装填问题 布局优化 三元组编码 模拟退火 机械产品 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]