复合式土压平衡盾构刀盘CAD系统开发

在结合盾构刀盘构型、开口和刀具布置规律等理论基础上,以三维软件SolidWorks为开发平台,以Visual Basic作为开发工具,开发了一种复合式土压平衡盾构刀盘CAD系统。该CAD系统采用编程法与尺寸驱动法两种开发方式,设计了刀盘选型模块、开口设计模块、刀具选型模块和刀具布置模块等八个模块,实现对复合式土压平衡盾构刀盘、刀具进行三维参数化优化设计。针对某地铁施工工程需求,应用所开发的复合式土压平衡盾构刀盘CAD系统,设计了直径6.28 m,开口率为32%,装配有滚刀35把,正面刮刀40把,边缘刮刀8把的刀盘。     

On the optimal layout of structures subjected to probabilistic or multiply loading

The loading uncertainties can be expressed by the stochastic nature of any part of the load determination. If any information is probabilistic among the three independent data of the load determination (the magnitude, the line of action and/or the point of application) a more precise design requires to elaborate a probabilistic method. This goal can be obtained by the use of an appropriate approximation technique, in which the original stochastic mathematical programming problem is substituted by a deterministic one. A similar technique can be followed in case of a multiple loading. In addition to the numerical modelling a parametric study is given where the influence of the multiple loading is investigated to determine the optimal layout in function of the initial layout. The application is illustrated by numerical examples.     

基于节点属性的启发式网络拓扑图布局算法

工业监控网络拓扑可视化作为网络拓扑可视化的一个分支,要求布图结构直观而且实时性强。然而,以往的拓扑布局算法并不能满足这一要求。针对这一问题,面向一层或二层星型、一层mesh型和mesh型与星型两层混合的工业监控网络结构,根据网络结构特点和节点关系属性改进斥力张力模型,提出一种基于节点属性的启发式网络拓扑布局算法。实验结果证明该算法时间复杂度较低,而且布图直观性良好。     

基于认知规律的用户界面信息布局设计方法

为进一步提高工作效率,提出一种基于人的认知因素和几何位置匹配因素的界面信息布局设计方法。建立任务模型,获取合理的待布局任务信息元素;从人的认知规律中提取3个布局原则,分别将其以定量化的形式构建数学模型,以目标函数变量的形式作用于界面布局过程中;引入带有惯性权重的粒子群算法求解目标函数,对界面中所有待布局元素的几何位置寻求最优布局方案。以隧道应急救援培训系统的决策界面布局为例,提出解决方案并验证该方法的可行性。实验结果表明,该方法具有一定的实用性。     

三视场星敏感器系统结构布局的优化

研究了三视场星敏感器的相关坐标系及旋转关系,讨论并给出计算视场内导航星数目的方法,指出优化三视场星敏感器结构布局的依据和途径。通过蒙特卡罗仿真,统计导航星捕获概率,给出了结构布局优化结果。从姿态测量精度、导航星捕获概率、光学系统设计难度方面折中考虑,选择极限星等、视场角和光学系统光轴仰角的最佳参数分别为5.0等、11°×11°和40°,此时捕获4颗以上导航星的概率达到99.43%。     

Automatic strip layout design in progressive dies

Nowadays, progressive dies have a special role in various methods of sheet metal production. The design process, however requires a considerable amount of time and expertise. Strip layout design is a key step in progressive die design, therefore automating strip layout has a vital role in Computer Aided Progressive Die Design (CAPDD). In this paper, a mathematical model, based on set theory, is introduced to analyze the problem of strip layout. The model describes the mathematical nature of the strip layout problem and reveals the reason why researchers have always faced problems in optimizing strip layout automatically. Using the model presented, an algorithm is developed to optimize strip layout using the minimum number of stations and the torque equilibrium criteria. A prototype software is also developed to automate strip layout design based on the presented algorithm. The suitability of the model is then demonstrated through industrial examples.     

Optimize tool paths of flank milling with generic cutters based on approximation using the tool envelope surface

This paper presents a global optimization method to generate a tool path for flank milling free-form surfaces with a generic cutter based on approximation using the tool envelope surface. It is an extension of our previous work [Gong Hu, Cao Li-Xin, Liu Jian. Improved positioning of cylindrical cutter for flank milling ruled surfaces. Computer Aided Design 2005; 37:1205–13]. First, given initial tool path or tool axis trajectory surface, the grazing points of the tool envelope surface can be calculated. Second, the errors between the tool envelope surface and the designed surface along the normal direction of the tool envelope surface are calculated. Based on this new definition of error, an optimization model is established to get the global optimized tool axis trajectory surface. In order to simplify the calculation, two variants of this method based on the least square criterion are proposed to solve this model. Since this method is really based on the tool envelope surface, it can reduce the initial machining errors effectively. The proposed method can be used not only for cylindrical cutters and conical cutters, but also for generic cutters with a surface of revolution. In addition to ruled surfaces, it also can be used for machining non-ruled surfaces. Finally, several examples are given to prove its effectiveness and accuracy. The generated tool paths and calculated grazing points for test are available in supplementary files for the readers’ convenience in verifying this work in different CAD/CAM systems.     

Facilities layout design by genetic algorithms

Genetic algorithms (GAs) are a class of adaptive search techniques which have gained popularity in optimisation. In particular they have successfully been applied to NP hard problems such as those resulted in mathematical modelling of facilities design problems. The typical steps required to implement GAs are: encoding of feasible solutions into chromosomes using a representation method, evaluation of fitness function, setting of GAs parameters, selection strategy, genetic operators, and criteria to terminate the process. This paper reports on finding of a research in design of a GA solving the quadratic assignment formulation of equal and unequal-sized facilities layout problems. Comparison is made with solutions of several test problems reported in the literature.     

A simulation-based approach for the optimal design of signalling block layout in railway networks

To meet the growing demand in railway transportation, practitioners are more and more required to upgrade or substitute the signalling system in order to increase the capacity of the network. Existing approaches for the design of the signalling layout, usually tend to maximize the technological efficiency of the system by shortening the length of block sections, thus reducing the minimum line headway and the energy consumption but increasing investment costs. This paper presents a design approach addressed to identify the signalling layout which minimizes the investment and management costs, while respecting the required level of capacity. To solve this problem an innovative design framework is introduced which integrates a stochastic multi-train simulation model within a “black-box” optimization loop. Results obtained from an application to a real metro line confirm the effectiveness of such method in finding the solution which minimizes total costs for the line manager. A comparison with the block layout which maximizes the technological efficiency highlights that the obtained solution constitutes a satisfying trade-off between total costs and network performances.     

A simulated annealing algorithm for dynamic layout problem

Increased level of volatility in today's manufacturing world demanded new approaches for modelling and solving many of its well-known problems like the facility layout problem. Over a decade ago Rosenblatt published a key paper on modelling and solving dynamic version of the facility layout problems. Since then, various other researchers proposed new and improved models and algorithms to solve the problem. Balakrishnan and Cheng have recently published a comprehensive review of the literature about this subject. The problem was defined as a complex combinatorial optimisation problem. The efficiency of SA in solving combinatorial optimisation problems is very well known. However, it has recently not been applied to DLP based on the review of the available literature. In this research paper a SA-based procedure for DLP is developed and results for test problems are reported.

Scope and purpose

One of the characteristic of today's manufacturing environments is volatility. Under a volatile environment (or dynamic manufacturing environment) demand is not stable. To operate efficiently under such environments facilities must be adaptive to changing demand conditions. This requires solution of the dynamic layout problem (DLP). DLP is a complex combinatorial optimisation problem for which optimal solutions can be found for small size problems. This research paper makes use of a SA algorithm to solve the DLP. Simulated annealing (SA) is a well-established stochastic neighbourhood search technique. It has a potential to solve complex combinatorial optimisation problems. The paper presents in detail how to apply SA to solve DLP and an extensive computational study. The computational study shows that SA is quite effective in solving dynamic layout problems.     

一种多基元类的布局迁移自适应算法及在闸机设计中的应用

布局问题研究物体的布局先后或布局定位以满足设计要求,布局迁移设计是在已有布局基础上高效设计新布局的方法。在轨道交通自动控制系统中,闸机表面传感器的布局对人与物的识别有重要的影响。为了实现闸机在不同地域环境中的快速设计,首先以闸机布局中的传感器作为研究对象,进行基元划分,提出了多种基元类型;并分析了基于拓扑结构的基元迁移变换方法,研究了人群特征因素、机械结构约束的数学表达;然后提出基于包围圆搜索的基元运动与干涉分析算法,其参数能够根据求解精度进行自适应调整;并利用多目标归一化函数对各基元的解进行择优,以获取最终布局。最后以18对传感器的闸机布局设计为例进行实例分析,应用此方法并借助于Visual Basic可视化编译平台,实现了闸机在不同地域环境中的传感器布局快速设计。     

An improved genetic algorithm for facility layout problems having inner structure walls and passages

This study proposes an improved genetic algorithm (GA) to derive solutions for facility layouts that are to have inner walls and passages. The proposed algorithm models the layout of facilities on gene structures. These gene structures consist of a four-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities is calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithms for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared with an actual ship compartment layout.Scope and purposeFacility layout problems (FLPs) concerning space layout optimization have been investigated in depth by researchers in many fields, such as industrial engineering, management science, and architecture, and various algorithms have been proposed to solve FLPs. However, these algorithms for the FLP cannot consider inner structure walls and passages within the block plan (or available area). They are also limited to a rectangular boundary shape of the block plan. Therefore, these algorithms could not be directly applied to problems having the curved boundary shape such as ship compartment layout, and an innovative algorithm which can treat such problems is needed. In this study, an improved genetic algorithm (GA) is proposed for solving problems having the inner structure walls and passages within an available area of a curved boundary. A comparative test of the proposed algorithm was performed to evaluate its efficiency. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared with an actual ship compartment layout. From the comparative test and the preliminary applications made to the ship's compartment layout, we demonstrate that the proposed algorithm has the ability to solve the FLPs having the inner structure walls and passages within the available area of the curved boundary.     

CLASS: An algorithm for cellular manufacturing system and layout design using sequence data

Cell formation problem in CMS design has received the attention of researchers for more than three decades. However, use of sequence data for cell formation has been a least researched area. Sequence data provides valuable information about the flow patterns of various jobs in a manufacturing system. Therefore, it is only natural to expect that use of sequence data must result in not only identifying the part families and machine groups but also the layout (sequence) of the machines within each cell. Unfortunately, such an approach has not been taken in the past while solving CMS design problem using sequence data. In this paper, we fill this gap in the literature by developing an algorithm that not only identifies the cells but also the sequence of machines in the cells in a simultaneous fashion. The numerical computations of the algorithm with the available problems in the literature indicate the usefulness of the algorithm. Further, it also points to the untapped potential of such an approach to solve CMS design and layout problem using sequence data.     

Supporting the design of office layout meeting ergonomics requirements

This paper proposes a method and an information technology tool aiming to support the ergonomics layout design of individual workstations in a given space (building). The proposed method shares common ideas with previous generic methods for office layout. However, it goes a step forward and focuses on the cognitive tasks which have to be carried out by the designer or the design team trying to alleviate them. This is achieved in two ways: (i) by decomposing the layout design problem to six main stages, during which only a limited number of variables and requirements are considered and (ii) by converting the ergonomics requirements to functional design guidelines. The information technology tool (ErgoOffice 0.1) automates certain phases of the layout design process, and supports the design team either by its editing and graphical facilities or by providing adequate memory support.     

Aesthetics and complexity in digital layout systems

Abstract

The layout of pages which carry information is the bread and butter of the graphic design profession. The rationale of what elements are chosen and where they are placed is based on tacit knowledge gained over a number of years of experience. The aesthetics associated with the overall finished design are often based on a style. Important elements of style are complexity and aesthetic value. In this paper I explore how various mathematical aesthetic functions can use complexity as an arousal enhancing or limiting mechanism in the application of layout designs.     

A hospital facility layout problem finally solved

This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans–Beckmann variant of the quadratic assignment problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem arose in 1972 as part of the design of a German University Hospital, Klinikum Regensburg. This problem, known as the Krarup 30a upon its inclusion in the QAP library of QAP instances, has remained an important example of one of the most difficult to solve. In 1999, two approaches provided multiple optimum solutions. The first was Thomas Stützles analysis of fitness–distance correlation that resulted in the discovery of 256 global optima. The second was a new branch-and-bound enumeration that confirmed 133 of the 256 global optima found and proved that Stützles 256 solutions were indeed optimum solutions. We report here on the steps taken to provide in-time heuristic solutions and the methods used to finally prove the optimum.     

Data layout optimization for multi-valued containers in OpenCL

Scientific data is mostly multi-valued, e.g., coordinates, velocities, moments or feature components, and it comes in large quantities. The data layout of such containers has an enormous impact on the achieved performance, however, layout optimization is very time-consuming and error-prone because container access syntax in standard programming languages is not sufficiently abstract. This means that changing the data layout of a container necessitates syntax changes in all parts of the code where the container is used. Object oriented languages allow to solve this problem by hiding the data layout behind a class interface. However, the additional coding effort is enormous in comparison to a simple structure. A clever coding pattern, previously presented by the author, significantly reduces the code overhead, however, it relies heavily on advanced C++ features, a language that is not supported on most accelerators. This paper develops a concise macro based solution that requires only support for structures and unions and can therefore be utilized in OpenCL, a widely supported programming language for parallel processors. This enables the development of high performance code without an a-priori commitment to a certain layout and includes the possibility to optimize it subsequently. This feature is used to identify the best data layouts for different processing patterns of multi-valued containers on a multi-GPU system.     

An ε-accurate model for optimal unequal-area block layout design

This paper proposes a mixed-integer linear programming model for the block layout design problem with unequal areas that satisfies the area requirements with a given accuracy. The basic aspect of the model consists of an ε-accurate representation of the underlying nonconvex and hyperbolic area restrictions using cutting planes. The use of such a representation of the area restrictions allow us to solve several challenging test problems to optimality with a guarantee that the final area of each department is within an ε% error of the required area. Numerical results indicate that the proposed model seriously challenge other optimization approaches on this important class of hard, fundamental problems.     

Solving an extended multi-row facility layout problem with fuzzy clearances using GA

Multi-row facility layout problem (MRFLP) is a class of facility layout problems, which decides upon the arrangement of facilities in some fixed numbers of rows in order to minimize material handling cost. Nowadays, according to the new layout requirements, the facility layout problems (FLPs) have many applications such as hospital layout, construction site layout planning and layout of logistics facilities. Therefore, we study an extended MRFLP, as a novel layout problem, with the following main assumptions: 1) the facilities are arranged in a two-dimensional area and without splitter rows, 2) multiple products are available, 3) distance between each pair of facilities, due to inaccurate and flexible manufacturing processes and other limitations (such as WIPs, industrial instruments, transportation lines and etc.), is considered as fuzzy number, and 4) the objective function is considered as minimizing the material handling and lost opportunity costs. To model these assumptions, a nonlinear mixed-integer programming model with fuzzy constraints is presented and then converted to a linear mixed-integer programming model. Since the developed model is an NP-hard problem, a genetic algorithm approach is suggested to find the best solutions with a minimum cost function. Additionally, three different crossover methods are compared in the proposed genetic algorithm and finally, a sensitivity analysis is performed to discuss important parameters.