Search

In this paper, we propose a new in-plane XYθz nano-positioning stage that utilizes piezoelectric actuators and flexure mechanisms. The proposed stage has an aperture and is compact, which facilitates its application in measurement equipment, especially those used for biological specimens. The stage has four piezoelectric actuators and four bridge-type flexure mechanisms, which are used to amplify the small motions produced by the piezoelectric actuators. This paper describes the modeling and design optimization of the stage, which has X- and Y-direction motion ranges of 300 μm and a θz-direction motion range of ±3.9 mrad. The stage measures 150 × 150 × 23 mm, and its aperture is 50 × 50 mm. [ABSTRACT FROM AUTHOR]

In this paper we discuss scenario reduction methods for risk-averse stochastic optimization problems. Scenario reduction techniques have received some attention in the literature and are used by practitioners, as such methods allow for an approximation of the random variables in the problem with a moderate number of scenarios, which in turn make the optimization problem easier to solve. The majority of works for scenario reduction are designed for classical risk-neutral stochastic optimization problems; however, it is intuitive that in the risk-averse case one is more concerned with scenarios that correspond to high cost. By building upon the notion of effective scenarios recently introduced in the literature, we formalize that intuitive idea and propose a scenario reduction technique for stochastic optimization problems where the objective function is a Conditional Value-at-Risk. Numerical results presented with problems from the literature illustrate the performance of the method and indicate the cases where we expect it to perform well. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new predictor-corrector interior-point algorithm for linear programming based on a wide neighbourhood. In each iteration, the algorithm computes the Ai-Zhang's predictor direction (SIAM J. Optim. 16(2):400-417, ) and a new corrector direction, in an attempt to improve its performance. We drive that the duality gap reduces in both predictor and corrector steps. Moreover, we also prove that the complexity of the algorithm coincides with the best iteration bound for small neighbourhood algorithms. Finally, some numerical experiments are provided which reveal capability and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In the present paper, we consider the inequality constrained vector problem with continuously Fréchet differentiable objective functions and constraints. We obtain second-order necessary optimality conditions of Karush-Kuhn-Tucker type for weak efficiency. A new second-order constraint qualification of Zangwill type is introduced. It is applied in the optimality conditions. Some connections with other constraint qualifications are established. [ABSTRACT FROM AUTHOR]

Abstract Grey Wolf Optimizer (GWO) algorithm is a relatively new algorithm in the field of swarm intelligence for solving continuous optimization problems as well as real world optimization problems. The Grey Wolf Optimizer is the only algorithm in the category of swam intelligence which is based on leadership hierarchy. This paper has three important aspects- Firstly, for improving the search ability by grey wolf a modified algorithm RW-GWO based on random walk has been proposed. Secondly, its performance is exhibited in comparison with GWO and state of art algorithms GSA, CS, BBO and SOS on IEEE CEC 2014 benchmark problems. A non-parametric test Wilcoxon and Performance Index Analysis has been performed to observe the impact of improving the leaders in the proposed algorithm. The results presented in this paper demonstrate that the proposed algorithm provide a better leadership to search a prey by grey wolves. The third aspect of the paper is to use the proposed algorithm and GWO on real life application problems. It is concluded from this article that RW-GWO algorithm is an efficient and reliable algorithm for solving not only continuous optimization problems but also for real life optimization problems. [ABSTRACT FROM AUTHOR]

Abstract This paper proposes a novel decomposition method based on user-preference and developed a variation of the decomposition based multi-objective optimization algorithm (MOEA/D) targeting only solutions in a small region of the Pareto-front defined by the preference information supplied by the decision maker (DM). This is particularly advantageous for solving multi-objective optimization problems (MOPs) with more than 3 objectives, i.e., many-objective optimization problems (MaOPs). As the number of objectives increases, the ability of an EMO algorithm to approximate the entire Pareto front (PF) is rapidly diminishing. In this paper, we first propose a novel scalarizing function making use of a series of new reference points derived from a reference point specified by the DM in the preference model. Based on this scalarizing function, we then develop a user-preference-based EMO algorithm, namely R-MOEA/D. One key merit of R-MOEA/D is that it does not rely on an estimation of the ideal point, which may impact significantly the performances of state-of-the-art decomposition based EMO algorithms. Our experimental results on multi-objective and many-objective benchmark problems have shown that R-MOEA/D provides a more direct and efficient search towards the preferred PF region, resulting in competitive performances. In an interactive setting when the DM changes the reference point during optimization, R-MOEA/D has a faster response speed and performance than the compared algorithms, showing its robustness and adaptability to changes of the preference model. Furthermore, the effectiveness of R-MOEA/D is verified on a real-world problem of reservoir flood control operations. [ABSTRACT FROM AUTHOR]

In this paper we propose a nonlinear Generalized Disjunctive Programming model to optimize the 2-dimensional continuous location and allocation of the potential facilities based on their maximum capacity and the given coordinates of the suppliers and customers. The model belongs to the class of Capacitated Multi-facility Weber Problem. We propose a bilevel decomposition algorithm that iteratively solves a discretized MILP version of the model, and its nonconvex NLP for a fixed selection of discrete variables. Based on the bounding properties of the subproblems, ϵ-convergence is proved for this algorithm. We apply the proposed method to random instances varying from 2 suppliers and 2 customers to 40 suppliers and 40 customers, from one type of facility to 3 different types, and from 2 to 32 potential facilities. The results show that the algorithm is more effective at finding global optimal solutions than general purpose global optimization solvers tested. [ABSTRACT FROM AUTHOR]

Bat algorithm (BA) is a new approach designed by imitating bat's behavior of searching and capturing preys. The existing results have demonstrated the effectiveness and efficiency in comparison with other heuristic algorithms such as genetic algorithms and particle swarm optimization. In this paper, we design a novel framework for bat algorithm named two-stage bat algorithm (TSBA) using a trade-off strategy which balances the relationship between exploration and exploitation at the most extent. Inspired by the multi-population methods (e.g., artificial bee colony), we not only concern some technologies to avoid premature inevitably encountered when using BA, but also use a trade-off strategy to improve the comprehensive search performance for optimization. Some typical test sets which consist of 27 benchmark functions are utilized in comparative experiment, and the simulation results in terms of convergence rate and accuracy illustrate that the TSBA has a competitive performance than other swarm intelligent optimization algorithms. In addition, the proposed algorithm will not lend to the tremendous increase in computing time and thus will be a powerful tool in practical applications. [ABSTRACT FROM AUTHOR]

This paper presents in-plane material filters for the Discrete Material Optimization method used for optimizing laminated composite structures. The filters make it possible for engineers to specify a minimum length scale which governs the minimum size of areas with constant material continuity. Consequently, engineers can target the available production methods, and thereby increase its manufacturability while the optimizer is free to determine which material to apply together with an optimum location, shape, and size of these areas with constant material continuity. By doing so, engineers no longer have to group elements together in so-called patches, so to statically impose a minimum length scale. The proposed method imposes the minimum length scale through a standard density filter known from topology optimization of isotropic materials. This minimum length scale is generally referred to as the filter radius. However, the results show that the density filter alone gives designs with large measures of non-discreteness. In order to obtain near discrete designs an additional threshold projection filter is applied, so to push the physical design variables towards their discrete bounds. However, because the projection filter is a non-linear function of the design variables, the projected variables have to be re-scaled in a final so-called normalization filter. This is done to prevent the optimizer in creating superior, but non-physical pseudo-materials. The method is demonstrated on a series of minimum compliance examples together with a minimum mass example, and the results show that the method is indeed capable of imposing a minimum length scale onto the optimized layup. [ABSTRACT FROM AUTHOR]

The paper suggests a new-to the best of the author's knowledge-characterization of decisions, which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a prescribed angular radius. The main idea is to use the angle distances between the unit vector and points of utility space. A necessary and sufficient condition for the optimality in the form of an equation is derived. The first-order necessary optimality conditions are also obtained. [ABSTRACT FROM AUTHOR]

This paper deals with a nonsmooth semi-infinite multiobjective/vector optimization problem (SIMOP, for short). We first establish necessary and sufficient conditions for (local) strongly isolated solutions and (local) positively properly efficient solutions of an SIMOP. Then, we propose a dual problem to the SIMOP under consideration and examine weak and strong duality relations between them. [ABSTRACT FROM AUTHOR]

Abstract Distributed assembly permutation flowshop scheduling problem (DAPFSP) has important applications in modern assembly systems. In this paper, we present three variants of the discrete invasive weed optimization (DIWO) for the DAPFSP with total flowtime criterion. For solving such a problem, we present a two-level representation that consists of a product permutation and a number of job sequences. We introduce neighbourhood operators for both the product permutation and job sequences. We design effective local search procedures respectively for product-permutation-based neighbourhood and job-sequence-based neighbourhood. By combining the problem-specific knowledge and the idea of invasive weed optimization, we present three DIWO-based algorithms: a two-level discrete invasive weed optimization (TDIWO), a discrete invasive weed optimization with hybrid search operators (HDIWO), and a HDIWO with selection probability. The algorithms explore the two neighbourhoods in quite a different way. We calibrate the presented DIWO algorithms by means of the design of experimental method, and carry out a comprehensive computational campaign based on the 810 benchmark instances in the literature. The numerical experiments show that the presented DIWO algorithms perform significantly better than the other competing algorithms in the literature. Among the proposed algorithms, HDIWO is the best one. [ABSTRACT FROM AUTHOR]

Abstract This paper presents a novel framework for improving the performance of multi-population algorithms in solving dynamic optimization problems (DOPs). The fundamental idea of the proposed framework is to incorporate the concept of scheduling into multi-population methods with the aim to allocate more function evaluations to the best performing sub-populations. Two methods are developed based on the proposed framework, each of which uses a different approach for scheduling the sub-populations. The first method combines the quality of sub-populations and the degree of diversity among them into a single feedback parameter for detecting the best performing sub-population. The second method uses the learning automata as the central unit for performing the scheduling operation. In order to validate the applicability of the proposed methods, they are incorporated into three well-known algorithms for DOPs. The experimental results show the efficiency of the scheduling approach for improving the multi-population methods on the moving peaks benchmark (MPB) and generalized dynamic benchmark generator. [ABSTRACT FROM AUTHOR]

In design optimization problems, the robustness of a solution is essential to be considered when it is going to be implemented or used in real world. Robustness can be defined in different ways, but in this work, it is considered as the property of a solution’s performance to be as insensitive as possible to perturbations in that solution. Optimizing both quality and robustness is generally addressed as a multiobjective problem. This paper presents a complete framework aided by decision maker, which can be used to solve robust optimization problems with one or more objectives. Decision maker actively takes part of the process, defining a priori the robustness metric, and specifying iteratively a robustness factor that joins quality and robustness metrics into a single fitness function. The framework is very flexible allowing decision maker not only to specify the right robustness level for him, but also to exchange metrics and algorithms if he wants. The framework was tested and validated using two single-objective robust benchmarking functions, and in one new multiobjective robust function, created to challenge the framework, which tries to seek the most robust Pareto optimal front according to decision maker preferences. [ABSTRACT FROM AUTHOR]

Typically, the printing of contact patterns uses a dark-field (DF) mask in combination with a positive tone resist and positive tone development (PTD) process. PTD, which has a mature process and simulation model, had been widely applied in high-volume manufacturing. For the low aerial image quality of a DF mask in advanced node, PTD is substituted by negative tone development (NTD), which uses a positive tone resist and bright-field mask. Due to the high cost and immature simulation model of NTD process, it is worthwhile to extend PTD to some critical patterns. With the purpose of improving the resist profile and process window (PW) of the contact pattern with a PTD process in advanced node, an optimization method combined with the idea of a genetic algorithm is put forward. For performance of the optimized resist under the conditions of best focus and best dose, an evaluation based on the through pitch square contact patterns with the critical dimension (CD) fixed at 50 nm has been provided. The generalization performance of the optimized resist is also analyzed by a systematic method, which contains the resist profile and PW simulation on the base of through CD and through pitch contact patterns. The above simulation results verify the effectiveness and validity of the proposed optimization method. [ABSTRACT FROM AUTHOR]

The paper introduces a smoothing method to the lower order penalty function for constrained optimization problems. It is shown that, under some mild conditions, an optimal solution of the smoothed penalty problem is an approximate optimal solution of the original problem. Based on the smoothed penalty function, an algorithm is presented and its convergence is proved under some mild assumptions. Numerical examples show that the presented algorithm is effective. [ABSTRACT FROM AUTHOR]

Summary: This is a review article that unifies several important examples using constrained optimisation techniques. The basic tools are three simple mathematical optimisation results subject to certain constraints. Applications include calibration, benchmarking in small area estimation and imputation. A final illustration is constrained optimisation under a general divergence loss. [ABSTRACT FROM AUTHOR]

In this work, we investigate a combination of classical optimization techniques from optimal control and a rounding strategy based on shape optimization for interface identification for problems constrained by partial differential equations. The goal is to identify the location of pollution sources in a fluid flow represented by a control that is either active or inactive. We use a relaxation of the binary problem on a coarse grid as initial guess for the shape optimization with higher resolution. The result is a computationally cheap method, where large shape deformations do not have to be performed. We demonstrate that our algorithm is, moreover, able to change the topology of the initial guess. [ABSTRACT FROM AUTHOR]

In conic linear programming—in contrast to linear programming—the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas’ lemma is also not exact (it does not always prove infeasibility). We describe exact duals, and certificates of infeasibility and weak infeasibility for conic LPs which are nearly as simple as the Lagrange dual, but do not rely on any constraint qualification. Some of our exact duals generalize the SDP duals of Ramana, and Klep and Schweighofer to the context of general conic LPs. Some of our infeasibility certificates generalize the row echelon form of a linear system of equations: they consist of a small, trivially infeasible subsystem obtained by elementary row operations. We prove analogous results for weakly infeasible systems. We obtain some fundamental geometric corollaries: an exact characterization of when the linear image of a closed convex cone is closed, and an exact characterization of nice cones. Our infeasibility certificates provide algorithms to generate all infeasible conic LPs over several important classes of cones; and all weakly infeasible SDPs in a natural class. Using these algorithms we generate a public domain library of infeasible and weakly infeasible SDPs. The status of our instances can be verified by inspection in exact arithmetic, but they turn out to be challenging for commercial and research codes. [ABSTRACT FROM AUTHOR]

Decision rules provide a flexible toolbox for solving computationally demanding, multistage adaptive optimization problems. There is a plethora of real-valued decision rules that are highly scalable and achieve good quality solutions. On the other hand, existing binary decision rule structures tend to produce good quality solutions at the expense of limited scalability and are typically confined to worst-case optimization problems. To address these issues, we first propose a linearly parameterised binary decision rule structure and derive the exact reformulation of the decision rule problem. In the cases where the resulting optimization problem grows exponentially with respect to the problem data, we provide a systematic methodology that trades-off scalability and optimality, resulting to practical binary decision rules. We also apply the proposed binary decision rules to the class of problems with random-recourse and show that they share similar complexity as the fixed-recourse problems. Our numerical results demonstrate the effectiveness of the proposed binary decision rules and show that they are (i) highly scalable and (ii) provide high quality solutions. [ABSTRACT FROM AUTHOR]

We study a sequential form of the distributed dual averaging algorithm that minimizes the sum of convex functions in a special case where the number of functions increases gradually. This is done by introducing an intermediate 'pivot' stage posed as a convex feasibility problem that minimizes average constraint violation with respect to a family of convex sets. Under this approach, we introduce a version of the minimum sum optimization problem that incorporates an evolving design space. Proof of mathematical convergence of the algorithm is complemented by an application problem that involves finding the location of a noisy, mobile source using an evolving wireless sensor network. Results obtained confirm that the new designs in the evolved design space are superior to the ones found in the original design space due to the unique path followed to reach the optimum. [ABSTRACT FROM AUTHOR]

The present work is devoted to the study of stability in set optimization. In particular, a sequence of perturbed set optimization problems, with a fixed objective map, is studied under suitable continuity assumptions. A formulation of external and internal stability of the solutions is considered in the image space, in such a way that the convergence of a sequence of solutions of perturbed problems to a solution of the original problem is studied under appropriate compactness assumptions. Our results can also be seen as an extension to the set-valued framework of known stability results in vector optimization. [ABSTRACT FROM AUTHOR]

In order to take into account any possible dependence between alternatives in optimization problems, bivariate characterizations of some well-know univariate stochastic orders have been defined and studied by Shanthikumar and Yao (Adv Appl Probab 23:642-659, ). These characterizations gave rise to new stochastic comparisons, commonly called joint stochastic orders, which are equivalent to the original ones under assumption of independence, but are different whenever the variables to be compared are dependent. In this note we provide sufficient conditions on the survival copula describing the dependence among the compared variables such that the standard stochastic orders imply the corresponding joint stochastic orders, and viceversa. Also, simple conditions for joint stochastic orders between the components of random vectors defined through multivariate frailty models are provided. [ABSTRACT FROM AUTHOR]

The recent advances in network management systems suggest the adoption of autonomic mechanisms in order to minimize the need for human intervention while handling complex heterogeneous networks. Data acquisition performed by monitoring processes is an essential part of autonomic mechanisms. The rate of sampling is a crucial factor since it is related to (1) the successful/unsuccessful detection of events, (2) the processing power needed to perform the sampling and (3) the energy that a node consumes during such actions. In order to address these issues we designed a simple and efficient mechanism that dynamically adapts the sampling rate of the context monitoring procedure. The merits of the mechanism are quantified by means of an analytical model as well as through extensive simulations that validated the theoretic outcomes. Finally, we experimentally assessed the effectiveness and efficiency of our approach through two real-world experiments. Overall results showcase that our mechanism achieves high detection rates while in parallel minimizes significantly the number of monitoring loops thus, emerges as a viable approach for context monitoring optimization in autonomic networks. [ABSTRACT FROM AUTHOR]

Product lifetime cost is largely determined by product lifetime reliability. In product design, the former is minimized while the latter is treated as a constraint and is usually estimated by statistical means. In this work, a new lifetime cost optimization model is developed where the product lifetime reliability is predicted with computational models derived from physical principles. With the physics-based reliability method, the state of a system is indicated by computational models, and the time-dependent system reliability is then predicted for a given set of distributions and stochastic processes in the model input. A sampling approach to extreme value distributions of input stochastic processes is employed to make the system reliability analysis efficient and accurate. The physics-based reliability analysis is integrated with the lifetime cost model. The integration enables the minimal lifetime costs including those of maintenance and warranty. Two design examples are used to demonstrate the proposed model. [ABSTRACT FROM AUTHOR]

This article presents an effective hybrid cuckoo search and genetic algorithm (HCSGA) for solving engineering design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables. The proposed algorithm, HCSGA, is first applied to 13 standard benchmark constrained optimization functions and subsequently used to solve three well-known design problems reported in the literature. The numerical results obtained by HCSGA show competitive performance with respect to recent algorithms for constrained design optimization problems. [ABSTRACT FROM AUTHOR]

This research, a new thrust-allocation algorithm based on penalty programming is developed to minimize the fuel consumption of offshore vessels/platforms with dynamic positioning system. The role of thrust allocation is to produce thruster commands satisfying required forces and moments for position-keeping, while fulfilling mechanical constraints of the control system. The developed thrust-allocation algorithm is mathematically formulated as an optimization problem for the given objects and constraints of a dynamic positioning system. Penalty programming can solve the optimization problems that have nonlinear object functions and constraints. The developed penalty-programming thrust-allocation method is implemented in the fully-coupled vessel–riser–mooring time-domain simulation code with dynamic positioning control. Its position-keeping and fuel-saving performance is evaluated by comparing with other conventional methods, such as pseudo-inverse, quadratic-programming, and genetic-algorithm methods. In this regard, the fully-coupled time-domain simulation method is applied to a turret-moored dynamic positioning assisted FPSO (floating production storage offloading). The optimal performance of the penalty programming in minimizing fuel consumption in both 100-year and 1-year storm conditions is demonstrated compared to pseudo-inverse and quadratic-programming methods. [ABSTRACT FROM AUTHOR]