基于SLP和梯形模糊数的沥青热再生拌合站设施布置优化研究

通过对现有厂拌热再生沥青拌合站的工艺过程及存在问题进行分析,将再生沥青拌合站进行有根据的单元细化,通过SLP方法对拌合厂进行定量的设施布置,得到若干可行的布置方案,同时建立梯形直觉模糊数决策模型进行方案的评价,梯形模糊数的表示可较全面地表达决策者对各方案的态度,有效减轻评价过程中权重确定的主观性,再对各比选方案进行量化分析评判,得到各方案的优劣排序,通过与现有拌合站的对比分析,证实布局优化方法的有效性,从而提供相对科学、有效的布置方案.     

考虑繁忙率的多时段救护车优化布局研究

救护车布局对院前急救服务中需求的响应具有决定性作用。本文重点研究了考虑繁忙率的多时段救护车优化布局问题,在传统双覆盖模型基础上引入救护车繁忙率因素,提出改进后的双覆盖模型。首先计算考虑繁忙率的期望覆盖需求量,进而结合实际,将一天以早晚高峰划分为5个时段,探究不同时段下繁忙率差异带来的不同布局方案。以上海市松江区2014年数据为例,应用改进后的模型进行了系统深入的实证研究,并绘制繁忙率对需求覆盖率的影响曲线。结果表明,本文提出的布局方案比实际方案得到的期望覆盖需求量提高了3.19%,比传统双覆盖模型得到的期望覆盖需求量提高了0.54%,证明了改进后模型的有效性;需求覆盖率曲线随繁忙率增加而下降,与实际意义相符。该方法能够直观简洁地得出救护车布局方案,利于院前急救服务水平的提升,为社会安全提供有力保障。     

A genetic algorithm for cellular manufacturing design and layout

Cellular manufacturing (CM) is an approach that can be used to enhance both flexibility and efficiency in today’s small-to-medium lot production environment. The design of a CM system (CMS) often involves three major decisions: cell formation, group layout, and group schedule. Ideally, these decisions should be addressed simultaneously in order to obtain the best results. However, due to the complexity and NP-complete nature of each decision and the limitations of traditional approaches, most researchers have only addressed these decisions sequentially or independently. In this study, a hierarchical genetic algorithm is developed to simultaneously form manufacturing cells and determine the group layout of a CMS. The intrinsic features of our proposed algorithm include a hierarchical chromosome structure to encode two important cell design decisions, a new selection scheme to dynamically consider two correlated fitness functions, and a group mutation operator to increase the probability of mutation. From the computational analyses, these proposed structure and operators are found to be effective in improving solution quality as well as accelerating convergence.     

An analytical approach to calculate the capacity of a railway system

Railway capacity is a concept that is not easily defined or quantified. Difficulties include the numerous interrelated factors present in the already complex structure of the railway layout. In this paper capacity is defined as the maximum number of trains that can traverse the entire railway in a given period of time, subject to management constraints (such as junction capacity, track capacity, line capacity and interference probability between trains). The proposed method is based on defining and solving an optimization problem which aims at finding out the capacity value of a railway system. It is not based on timetables and moreover it can indirectly take into account priorities between trains and possible delays; it is able to give the time occupation percentage in each component for each train category. It has been applied to a real-life case study showing the range of its validity and the possibility of application for any generic railway scheme.     

航天器中精密器件布局的保结构优化

航天器中精密器件的稳定性和工作精度决定于器件布置位置的局部结构振动特性,而航天器局部振动特性又受到精密器件布局的影响.因此,航天器中精密器件的布局优化是确保其稳定高效工作的前提条件.该文建立了粘接精密器件的航天器局部柔性薄板结构的动力学模型,发展保结构分析方法模拟了薄板结构的局部振动特性.考虑精密器件形状和尺寸、散热间...     

To lay out or not to lay out?

The Quadratic Assignment Problem (QAP) is known as one of the most difficult problems within combinatorial optimization. It is used to model many practical problems including different layout problems. The main topic of this paper is to provide methods to check whether a particular instance of the QAP is a layout problem. An instance is a layout problem if the distances of the objects can be reconstructed on the plane and/or in the 3-dimensional space. A new mixed integer programming model is suggested for the case if the distances of the objects are supposed to be rectilinear distances. If the distances are Euclidean distances then the use of the well-known Multi-Dimensional Scaling (MDS) method of statistics is suggested for reconstruction purposes. The well-known difficulty of QAP makes it a popular and suitable experimental field for many algorithmic ideas including artificial intelligence methods. These types of results are published sometimes as layout problems. The methods of reconstruction can be used to decide whether the topic of a paper is layout or only general QAP. The issue what the OR community should expect from AI based algorithms, is also addressed.     

Flexible machine layout design for dynamic and uncertain production environments

Flexible manufacturing systems operate in a dynamic environment and face considerable uncertainty in production demands. The development of a flexible machine layout is a critical issue in creating a system that can respond effectively to these requirements. Unlike most existing methods for creating flexible layout designs, the procedure developed in this paper is not restricted to equal size machines. It optimizes the trade-offs between increased material handling costs as requirements change and machine rearrangement costs needed to adapt the layout to these changes. The proposed flexible machine layout design procedure formulates and solves a robust machine layout design problem over a rolling horizon planning time window. The formulation, details of the solution methodology, illustrative examples, and computational results are presented.     

基于改进遗传算法的布局优化子问题

本针对子问题，构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题，数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题，所以利用该算法可以找到整个布局优化问题的全局最优解。     

矿井布局问题

本研究了“撒网式”全面钻探过程中如何尽可能多地利用旧井而节约开支的问题,在两种距离和一定的误差意义下,运用图论、线性规划等方法建立了多个数学模型,并提出了相应的算法,对于所给的数值例子,利用计算机进行计算,得到了矿井最佳布局方案。     

制造单元布局问题的双目标模型与算法研究

单元制造系统的布局对于提高系统的效率起着十分重要的作用。以最小化物料周转量和设施面积为目标,建立了一个单元制造系统布局的双目标优化模型,在该模型中不同制造单元的布局、单元内部不同设施的位置与方向这几个问题可以同时进行优化。基于模拟退火邻域解的变尺度生成机制和双目标抽样准则设计了模型的求解算法。算例表明本文算法所得Pareto解集优于经典的NSGA-Ⅱ算法。     

A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays

In this paper, a probabilistic tabu search (PTS) approach is proposed to solve the facility layout problem (FLP) with unequal area departments. For the representation, the flexible bay structure (FBS), which is a very common layout in many manufacturing and retail facilities, is used. In this paper, the FBS is relaxed by allowing empty spaces within bays, which results in more flexibility in assigning departments into bays. In addition, departments are allowed to be located more freely within the bays, and they can have different side lengths as long as they are within the bay boundaries and do not overlap. To achieve these goals, department shapes and their locations within bays are determined LP. A PTS approach is developed to search an overall layout structure that describes relative positions of departments for the relaxed-FBS (RFBS). The proposed LP embedded PTS–RFBS approach is used to solve thirteen FLP instances from the literature with varying sizes. The comparative results show that this approach is very promising and able to find new best solutions for several test problems.     

On the multi-component layout design with inertial force

The purpose of this paper is to introduce inertial forces into the proposed integrated layout optimization method designing the multi-component systems. Considering a complex packing system for which several components will be placed in a container of specific shape, the aim of the design procedure is to find the optimal location and orientation of each component, as well as the configuration of the structure that supports and interconnects the components. On the one hand, the Finite-circle Method (FCM) is used to avoid the components overlaps, and also overlaps between components and the design domain boundaries. One the other hand, the optimal material layout of the supporting structure in the design domain is designed by topology optimization. A consistent material interpolation scheme between element stiffness and inertial load is presented to avoid the singularity of localized deformation due to the presence of design dependent inertial loading when the element stiffness and the involved inertial load are weakened with the element material removal. The tested numerical example shows the proposed methods extend the actual concept of topology optimization and are efficient to generate reasonable design patterns.     

Detailed layout planning for irregularly-shaped machines with transportation path design

In order to obtain a competitive level of productivity in a manufacturing system, efficient machine or department arrangements and appropriate transportation path structures are of considerable importance. By defining a production system’s basic structure and material flows, the layout determines its operational performance over the long term. However, most approaches proposed in the literature provide only a block layout, which neglects important operational details. By contrast, in this paper, we introduce approaches to planning layouts at a more detailed level. Hence, this present paper introduces an integrated approach which allows a more detailed layout planning by simultaneously determining machine arrangement and transportation paths. Facilities to be arranged as well as the entire layout may have irregular shapes and sizes. By assigning specific attributes to certain layout subareas, application-dependent barriers within the layout, like existing walls or columns, can be incorporated. We introduce a new mathematical layout model and develop several improvement procedures. An analysis of the computational experiments shows that more elaborate heuristics using variable neighborhoods can generate promising layout configurations.     

A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem

Owing to its theoretical as well as practical significance, the facility layout problem with unequal-area departments has been studied for several decades, with a wide range of heuristic and a few exact solution procedures developed by numerous researchers. In one of the exact procedures, the facility layout problem is formulated as a mixed-integer programming (MIP) model in which binary (0/1) variables are used to prevent departments from overlapping with one another. Obtaining an optimal solution to the MIP model is difficult, and currently only problems with a limited number of departments can be solved to optimality. Motivated by this situation, we developed a heuristic procedure which uses a “graph pair” to determine and manipulate the relative location of the departments in the layout. The graph-pair representation technique essentially eliminates the binary variables in the MIP model, which allows the heuristic to solve a large number of linear programming models to construct and improve the layout in a comparatively short period of time. The search procedure to improve the layout is driven by a simulated annealing algorithm. The effectiveness of the proposed graph-pair heuristic is demonstrated by comparing the results with those reported in recent papers. Possible extensions to the graph-pair representation technique are discussed at the end of the paper.     

圆形区域分散布局问题研究

针对圆形区域分散布局问题, 文中给出了一个带约束的非线性规划模型. 当布局点数量较少时, 通过将模型转化为无约束优化问题, 利用梯度方法进行求解; 对于布局点数量较多的情况, 提出了一个界为1/2的多项式时间的近似算法, 并进行了相应的算例分析, 进一步来验证算法解的合理性. 研究的结论及方法一定程度上丰富和完善了圆形区域的分散布局理论.     

A new hypothesis concerning children’s fractional knowledge

The basic hypothesis of the teaching experiment, The Child’s Construction of the Rational Numbers of Arithmetic (Steffe & Olive, 1990) was that children’s fractional schemes can emerge as accommodations in their numerical counting schemes. This hypothesis is referred to as the reorganization hypothesis because when a new scheme is established by using another scheme in a novel way, the new scheme can be regarded as a reorganization of the prior scheme. In that case where children’s fractional schemes do emerge as accommodations in their numerical counting schemes, I regard the fractional schemes as superseding their earlier numerical counting schemes. If one scheme supersedes another, that does not mean the earlier scheme is replaced by the superseding scheme. Rather, it means that the superseding scheme solves the problems the earlier scheme solved but solves them better, and it solves new problems the earlier scheme didn’t solve. It is in this sense that we hypothesized children’s fractional schemes can supersede their numerical counting schemes and it is the sense in which we regarded numerical schemes as constructive mechanisms in the production of fractional schemes (Kieren, 1980).     

Cryptanalysis of the Wu–Dawson Public Key Cryptosystem

A new public key cryptosystem was introduced by Wu and Dawson at the Fourth International Conference on Finite Fields (Fq4). This scheme is similar to the McEliece public key cryptosystem, in the sense that it also can be described in terms of linear error-correcting codes over finite fields. However, in contrast to the McEliece scheme, the security of the Wu–Dawson system is not based on a decoding problem which is assumed to be intractable but on the theory of generalized inverses of matrices over finite fields. The authors compare their scheme with the McEliece scheme and claim that the same level of security can be obtained using smaller codes, therefore reducing the key size. In this note it will be shown that the Wu–Dawson scheme is insecure, i.e., a trapdoor can be computed efficiently from the knowledge of the public key.     

A two-stage mathematical-programming method for the multi-floor facility layout problem

We present a two-stage method using mathematical-programming techniques for finding high-quality solutions to the multi-floor facility layout problem. The first stage is a mixed-integer linear program that assigns departments to floors such that the total of the vertical interaction costs between departments on different floors is globally minimized. The second stage finds a locally optimal layout for each floor. Two versions of the proposed approach are considered. The first solves the layout of each floor independently of the other floors, and is suitable for up to one elevator location. The second solves the layout of all floors simultaneously and can handle multiple elevator locations. Preliminary computational results show that both versions of the proposed method can efficiently provide a good variety of high-quality solutions in a short amount of time for medium and large-scale problem instances.     

Application of fuzzy control to a road tunnel ventilation system

This paper deals with the serious problems of ventilation system in a large road tunnel. Higher visibility and lower concentration of carbon monoxide are the key issues concerning the ventilation system. Prior to designing the fuzzy control model, a configuration layout of the ventilation system including sensing, control and traffic prediction as well is conceptually constructed. Based on the layout that offers assignments of sensors and control elements, a fuzzy logic control model is developed. Membership functions of sensor errors and control increments are physically submitted in order to set up the fuzzy logic rules. Timing and spacing filtering in terms of weighting approaches is employed in the fuzzy logic rules. A dynamic equation describing the concentration of air pollution is also given so as to cooperate with the fuzzy logic rules and to play roles in the computer simulation. The result of computer simulation involving five cases indicates that a multi-level scheme is able to solve the engineering problems.     

An algorithm of global optimization for solving layout problems

The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem about the artificial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented first time. The method given here can be extended to solve other type of layout problems.