分析实验室布局安排中容易忽视的几个问题

对分析实验室安排布局中常见的几个问题所带来的潜在危害和危害原因进行了分析讨论,并根据实际提出了建议.     

A new upper bound on the queuenumber of hypercubes

A queue layout of a graph consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested. In this paper, we show that the n-dimensional hypercube Q_n can be laid out using n−3 queues for n?8. Our result improves the previously known result for the case n?8.     

具有动应力、位移和稳定性约束的离散变量桁架结构布局优化设计算法

给出了在动应力、动位移和动稳定约束下离散变量结构布局优化设计问题的数学模型,用“拟静力”算法,将具有动应力约束、动位移约束和动稳定约束的离散变量结构布局优化设计问题化为静应力、静位移和静稳定约束的优化问题,然后利用两级优化算法求解该模型．优化过程由两级组成,拓扑级优化和形状级优化．在每一级,都使用了综合算法,并且在搜索过程中都根据两类设计变量的相对差商值进行搜索．对包含稳定约束和不包含稳定约束的优化结果做了比较,结果显示稳定性约束对优化结果产生较大的影响．     

单行安置的算法

对一j= LSI/VLSI具有积木块的单元，rt卞L给出单f7安置的算法一般来说，给出矩形单元的相对位置后，须从Zw个状态中选出最优解.我们证明在单行安置时可归结为N个状态的问题，得到一种很有效的算法.此算i?;曾用Fortran语言编程并在IBM-PC机上通行，结果令人满意.     

A new mixed integer programming formulation for facility layout design using flexible bays

This paper presents a mixed-integer programming formulation to find optimal solutions for the block layout problem with unequal departmental areas arranged in flexible bays. The nonlinear department area constraints are modeled in a continuous plane without using any surrogate constraints. The formulation is extensively tested on problems from the literature.     

Open critical area model and extraction algorithm based on the net flow-axis

In the integrated circuit manufacturing process, the critical area extraction is a bottleneck to the layout optimization and the integrated circuit yield estimation. In this paper, we study the problem that the missing material defects may result in the open circuit fault. Combining the mathematical morphology theory, we present a new computation model and a novel extraction algorithm for the open critical area based on the net flow-axis. Firstly, we find the net flow-axis for different nets. Then, the net flow-edges based on the net flow-axis are obtained. Finally, we can extract the open critical area by the mathematical morphology. Compared with the existing methods, the nets need not to divide into the horizontal nets and the vertical nets, and the experimental results show that our model and algorithm can accurately extract the size of the open critical area and obtain the location information of the open circuit critical area.     

An approximation algorithm for dissecting a rectangle into rectangles with specified areas

Given a rectangle R with area α and a set of n positive reals A={a₁,a₂,…,a_n} with ∑_ai∈Aa_i=α, we consider the problem of dissecting R into n rectangles r_i with area so that the set R of resulting rectangles minimizes an objective function such as the sum of the perimeters of the rectangles in R, the maximum perimeter of the rectangles in R, and the maximum aspect ratio of the rectangles in R, where we call the problems with these objective functions PERI-SUM, PERI-MAX and ASPECT-RATIO, respectively. We propose an O(nlogn) time algorithm that finds a dissection R of R that is a 1.25-approximate solution to PERI-SUM, a -approximate solution to PERI-MAX, and has an aspect ratio at most , where ρ(R) denotes the aspect ratio of R.     

Routing multiterminal nets on a hexagonal grid

Channel routing is a vital task in the layout design of VLSI circuits. Multiterminal channel routing is different from two-terminal one. While the later is quite understood, the former still poses the difficulty. In this paper, we investigate the multiterminal channel routing problem in a hexagonal model, whose grid is composed of horizontal tracks, right tracks (with slope +60°), and left tracks (with slope −60°). We present an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density. Furthermore, we can wire the layout produced by the router using four layers and there are no overlaps among different layers. This improves the previous known results [15, 19].     

薄板结构加筋布局优化设计方法研究

提出一种两步优化策略,以加筋板结构的固有频率最大化为目标函数,以结构所受外载荷作用的最大静变形为约束条件,开展薄板结构加筋构件的布局优化设计研究。为了降低加筋布局优化的难度,提高优化设计的效率,将加筋等效为一系列弹性铰（点）支撑,以便快速获得加筋横向移动的灵敏度信息。在基本不改变结构重量的情形下,通过合理布局加筋位置,能显著改善结构的刚度分布,提高结构的整体承载能力。随后,小幅调整加筋的截面尺寸,以满足对结构最大变形的设计要求。最后,用两个算例验证了所提优化方法的可行性和有效性。     

主通道位置不固定的设施布局问题多目标优化模型及算法

以物流中心设施布局问题为对象,提出了考虑出入口及主通道位置不固定情况下的设施布局问题的多目标优化模型并设计了其改进的遗传算法。首先,以物料搬运成本最小、活动关系密切度最大和面积利用率最大为目标,构建了考虑出入口位置不固定条件下的具有I型主通道的设施布局多目标优化数学模型。然后,设计了一种改进的遗传算法,包括:改进的编码、解码方法,追加了解码修正操作,基于惩罚函数策略的适应度函数等。实例测试表明,本算法的执行效率高而且结果稳定,优化效果好,布局结果紧凑适用。