Facility layout problems: A survey

Layout problems are found in several types of manufacturing systems. Typically, layout problems are related to the location of facilities (e.g., machines, departments) in a plant. They are known to greatly impact the system performance. Most of these problems are NP hard. Numerous research works related to facility layout have been published. A few literature reviews exist, but they are not recent or are restricted to certain specific aspects of these problems. The literature analysis given here is recent and not restricted to specific considerations about layout design.

We suggest a general framework to analyze the literature and present existing works using such criteria as: the manufacturing system features, static/dynamic considerations, continual/discrete representation, problem formulation, and resolution approach. Several research directions are pointed out and discussed in our conclusion.     

A load dispatch method using fractional programming and semidefinite programming

This paper describes a load dispatch method which minimizes power cost—[fuel cost]/[electric output]—for a power system with thermal plants and energy storage facilities. The proposed method employs fractional programming to convert a minimization problem with fractional objective function to a series of quadratic minimization problems, and semidefinite programming to solve converted problems. The method provides the optimum time‐dependent power output/input and storage level of energy storage facilities as well as time‐dependent power output of thermal plants. The method has been applied to a power system with five thermal plants, two energy storage facilities of various performances, and five load demands. The optimum load scheme of four time mesh points is obtained for the thermal plants and energy storage facilities. The fractional programming successfully converges the optimal scheme through a few iterations. The semidefinite programming deals with a variable matrix of 164 dimensions, and 185 inequality constraints. © 2001 Scripta Technica, Electr Eng Jpn, 138(2): 49–58, 2002     

气候环境实验室建模及温度控制系统仿真

气候环境实验室是一个复杂的热力系统,室内温度参数受多种因素的影响.通过分析气候环境实验室仓体、空调系统热交换器、温度传感器和调节阀的特性,推导出它们的传递函数,利用Matlab/Simu-link建立环境室温度控制系统的模型,根据临界比例度法整定PID参数,并对常规PID控制器和积分分离PID控制器的控制效果进行仿真比较.仿真结果表明该模型和温度控制系统在理论研究和工程实践中具有实际的指导意义和应用价值.     

CAE在同步辐射装置挡光元件设计中的应用

针对第三代同步辐射装置挡光元件承受极高热负载、设计难度大的问题,综述CAE在其设计中的应用情况:借助有限元分析可以获得挡光元件关键部件吸收体的最高温度和最大应力这两个最主要设计参数;通过计算流体力学(Computational Fluid Dynamics,CFD)软件模拟可以获得吸收体中冷却管道的对流换热与流动阻力特性参数;采用热弹塑性有限元分析可以获得用于低周疲劳寿命预估的吸收体热应力应变迟滞循环.下一步工作将围绕当今研究的核心问题——基于低周疲劳的设计准则展开,包括同步辐射高热负载作用下低周疲劳裂纹的起裂寿命和扩展寿命预测,以及吸收体倾角、表面光滑度、冷却管道排布等对寿命的影响.这些研究均需要充分利用CAE的强大分析功能.     

On the Competitive Ratio for Online Facility Location

We consider the problem of Online Facility Location, where the demand points arrive online and must be assigned irrevocably to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We prove that the competitive ratio for Online Facility Location is Θ . On the negative side, we show that no randomized algorithm can achieve a competitive ratio better than Ω against an oblivious adversary even if the demands lie on a line segment. On the positive side, we present a deterministic algorithm which achieves a competitive ratio of in every metric space. A preliminary version of this work appeared in the Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), Lecture Notes in Computer Science 2719. This work was done while the author was at the Max-Planck-Institut für Informatik, Saarbrücken, Germany, and was partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM–FT).     

微小流量pVTt法气体流量标准装置的研制

介绍了20LpVTt法气体流量标准装置的设计原理和方案,并给出了装置中主要参数的测试方法及装置的不确定度评定。     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

移动终端的设施农业物联网环境监控系统设计

通过使用物联网(IOT)传输协议—消息队列遥测传输(MQTT)协议,将前端硬件、服务器端及移动端连接在一起,完成对设施农业环境的远程实时监控.在系统中,前端硬件以STM32微处理器为核心,由传感器模块、设备控制模块、GPRS模块和电源模块组成,实现数据的采集和传输;服务器端有数据接收、存储、分析的能力,并担任MQTT消息协议中消息生产者和消息管理者的角色;移动终端软件则以Android操作系统为基础开发了应用软件,用户在装有Android系统的移动终端上安装该应用软件,即可查看实时环境情况,发送控制设备指令等.经过测试,整个系统运行稳定、使用简单、实时性高,用户能有效地对设施农业环境进行远程实时监控.     

ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design

Heuristics and metaheuristics are inevitable ingredients of most of the general purpose ILP solvers today, because of their contribution to the significant boost of the performance of exact methods. In the field of bi/multi-objective optimization, to the best of our knowledge, it is still not very common to integrate ILP heuristics into exact solution frameworks. This paper aims to bring a stronger attention of both the exact and metaheuristic communities to still unexplored possibilities for performance improvements of exact and heuristic multi-objective optimization algorithms.We focus on bi-objective optimization problems whose feasible solutions can be described as 0/1 integer linear programs and propose two ILP heuristics, boundary induced neighborhood search (BINS) and directional local branching. Their main idea is to combine the features and explore the neighborhoods of solutions that are relatively close in the objective space. A two-phase ILP-based heuristic framework relying on BINS and directional local branching is introduced. Moreover, a new exact method called adaptive search in objective space (ASOS) is also proposed. ASOS combines features of the ϵ-constraint method with the binary search in the objective space and uses heuristic solutions produced by BINS for guidance. Our new methods are computationally evaluated on two problems of particular relevance for the design of FTTx-networks. Comparison with other known exact methods (relying on the exploration of the objective space) is conducted on a set of realistic benchmark instances representing telecommunication access networks from Germany.     

生物农药与设施农业病害的防治

设施农业是我国传统农业向现代农业转变的主要形式之一,同时为我国无公害农业的产业化经营提代了设施保障。植物病害频繁发生是威胁设施农业发展的主要限制因子,目前由于采用化学防治措施所带来的病害抗药性、农药残留和环境污染等问题已无法满足设施农业生产优质农副产品的要求,所以生物农药的研发与应用,为解决这一难题提供了技术保证,生物农药产业化、生物农药的质量监测与风险评估、加大对生物农药开发扶持力度,是我国设施农业病害生物防治中亟等解决的问题。