Placing a finite size facility with a center objective on a rectangular plane with barriers

This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and travel through are prohibited. The feasible region for facility placement is subdivided into cells along the lines of Larson and Sadiq [R.C. Larson, G. Sadiq, Facility locations with the Manhattan metric in the presence of barriers to travel, Operations Research 31 (4) (1983) 652–669]. To overcome complications induced by the center (minimax) objective, we analyze the resultant cells based on the cell corners. We study the problem when the facility orientation is known a priori. We obtain domination results when the facility is fully contained inside 1, 2 and 3-cornered cells. For full containment in a 4-cornered cell, we formulate the problem as a linear program. However, when the facility intersects gridlines, analytical representation of the distance functions becomes challenging. We study the difficulties of this case and formulate our problem as a linear or nonlinear program, depending on whether the feasible region is convex or nonconvex. An analysis of the solution complexity is presented along with an illustrative numerical example.     

Outpatient transoral laser vaporization of anterior glottic webs and keel placement: Risks of airway compromise

Management of acquired anterior glottic webs involves resection of the web with reconstitution of a linear vocal fold edge and anterior commissure. Traditional procedures such as transcervical midline thyrotomy (with tracheostomy) and keel placement have been used for patients with extensive scar formation and airway compromise. However, in selected patients with more limited scarring and minimal-to-no airway compromise, a transoral endoscopic approach may be a viable option. In three patients, transoral laser vaporization followed by transoral keel placement and outpatient removal resulted in a vocal quality that perceptually improved without any evidence of respiratory compromise postoperatively.     

Knot Placement for B-Spline Curve Approximation via $L_{∞, 1}$-Norm and Differential Evolution Algorithm

In this paper, we consider the knot placement problem in B-spline curve approximation. A novel two-stage framework is proposed for addressing this problem. In the first step, the $l_{\infty, 1}$-norm model is introduced for the sparse selection of candidate knots from an initial knot vector. By this step, the knot number is determined. In the second step, knot positions are formulated into a nonlinear optimization problem and optimized by a global optimization algorithm — the differential evolution algorithm (DE). The candidate knots selected in the first step are served for initial values of the DE algorithm. Since the candidate knots provide a good guess of knot positions, the DE algorithm can quickly converge. One advantage of the proposed algorithm is that the knot number and knot positions are determined automatically. Compared with the current existing algorithms, the proposed algorithm finds approximations with smaller fitting error when the knot number is fixed in advance. Furthermore, the proposed algorithm is robust to noisy data and can handle with few data points. We illustrate with some examples and applications.     

Effect of Four-Wave Mixing on Optimal Placement of Optical Amplifier in WDM Star Networks

In this article, the effect of four-wave mixing (FWM) and amplified spontaneous emission (ASE) noise on WDM optical star networks has been investigated. Analysis for the evaluation of probability of error has been carried out (a) when only FWM is present and (b) when both FWM and ASE noise are present. Numerical results are presented in the graphical and tabular forms for the practical values of parameters. Finally, optimal location of the amplifier in the network has been identified as being before the star coupler preceding the receiver.     

Optimal location and optimized parameters for robust power system stabilizer using honeybee mating optimization

A honeybee mating optimization technique is used to tune the power system stabilizer (PSS) parameters and find optimal location of PSSs in this article. The PSS parameters and placement are computed to assure maximum damping performance under different operating conditions. One of the main advantages of the proposed approach is its robustness to the initial parameter settings. The effectiveness of the proposed method is demonstrated on two case studies as; 10‐machine 39‐buses New England (NE) power system in comparison with Tabu Search (TS) and 16 machines and 68 buses‐modified reduced order model of the NE New York interconnected system by genetic algorithm through some performance indices under different operating condition. The proposed method of tuning the PSS is an attractive alternative to conventional fixed gain stabilizer design as it retains the simplicity of the conventional PSS and at the same time guarantees a robust acceptable performance over a wide range of operating and system condition. © 2014 Wiley Periodicals, Inc. Complexity 21: 242–258, 2015     

Robust ℋ∞-Filtering Design with Pole Placement Constraint via Linear Matrix Inequalities

The problem of robust filtering design for continuous-time systems with convex bounded uncertainties is addressed in this paper. The aim is to determine a stable linear filter such that the filtering error system remains quadratically stable within a prespecified -attenuation level. Necessary and sufficient conditions for the existence of such robust filter are provided in terms of linear matrix inequalities, which can be solved efficiently through standard convex optimization procedures guaranteeing global convergence. Furthermore, as an improvement of the strategy, the filter dynamics can be constrained to some specific regions inside the left-half complex plane.     

自动铺丝平行等距轨迹规划算法实现

针对复合材料自动铺丝技术轨迹规划问题,提出了一种新的基于测地线的平行等距轨迹规划算法.该算法首先将已知的第一条轨迹线在曲面上等弧长离散得到若干数据点,然后在数据点处曲线切矢和曲面法矢的向量积方向上利用测地线的短程性获得下一条铺放轨迹上数据点,并利用B样条曲线拟和数据点生成铺放轨迹,最后使轨迹线铺满模具表面.算法中测地线利用微分方程组数值求解得到,以曲面曲线弧长为自变量,可实现等距线求解的自适应步长调整和较高的精度.经实际算例验证,该算法简单实用,精度能够满足铺丝技术工艺要求.     

A hybrid genetic algorithm for the two-dimensional single large object placement problem

In the two-dimensional single large object placement problem, we are given a rectangular master surface which has to be cut into a set of smaller rectangular items, with the aim of maximizing the total value of the pieces cut. We consider the special case in which the items cannot be rotated and must be cut with their edges always parallel to the edges of the surface. We present new greedy algorithms and a hybrid genetic approach with elitist theory, immigration rate, heuristics on-line and tailored crossover operators. Extensive computational results for a large number of small and large benchmark test problems are presented. The results show that our approach outperforms existing heuristic algorithms.     

Offset-polygon annulus placement problems

An offset-polygon annulus region is defined in terms of a polygon P and a distance δ > 0 (offset of P). In this paper we solve several containment problems for polygon annulus regions with respect to an input point set. Optimization criteria include both maximizing the number of points contained in a fixed size annulus and minimizing the size of the annulus needed to contain all points. We address the following variants of the problem: placement of an annulus of a convex polygon as well as of a simple polygon; placement by translation only, or by translation and rotation; off-line and on-line versions of the corresponding decision problems; and decision as well as optimization versions of the problems. We present efficient algorithms in each case.