基于O-tree编码的物流设施紧置布置

借鉴超大规模集成电路物理设计中的相关思想,提出基于有序树的设施紧置布置编码表示法.在O-tree表示的基础上,根据布置、约束图和O-tree的相互关系,给出获得以面积利用率为目标函数的基本布置解的算法.在此基础上,以O-tree编码作为遗传基因编码,用遗传算法扰动O-tree,以获得物流驱动的优化布置解.最后,通过仿真实验验证了基于O-tree编码的设施布置表示及实现算法的可行性.

Compact Layout of Logistics Facilities Based on O-Tree Representation

A representation for compact layout of logistics facilities based on an O-tree(ordered tree) was proposed following the approach for design of very large integrated circuit.On the basis of O-tree representation,an algorithm to obtain an optimum in area utilization ratio was developed according to the relations among the layout,constraint graph and corresponding O-tree.A genetic algorithm with O-tree as its gene coding was further proposed to find optimized logistics facility layout solution by random perturbation to the O-tree.Simulation results verify the feasibility of the O-tree representation and corresponding algorithm.