WorldWideScience

Sample records for global optimization methods

  1. Global optimization methods for engineering design

    Science.gov (United States)

    Arora, Jasbir S.

    1990-01-01

    The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

  2. Global Optimization Ensemble Model for Classification Methods

    Directory of Open Access Journals (Sweden)

    Hina Anwar

    2014-01-01

    Full Text Available Supervised learning is the process of data mining for deducing rules from training datasets. A broad array of supervised learning algorithms exists, every one of them with its own advantages and drawbacks. There are some basic issues that affect the accuracy of classifier while solving a supervised learning problem, like bias-variance tradeoff, dimensionality of input space, and noise in the input data space. All these problems affect the accuracy of classifier and are the reason that there is no global optimal method for classification. There is not any generalized improvement method that can increase the accuracy of any classifier while addressing all the problems stated above. This paper proposes a global optimization ensemble model for classification methods (GMC that can improve the overall accuracy for supervised learning problems. The experimental results on various public datasets showed that the proposed model improved the accuracy of the classification models from 1% to 30% depending upon the algorithm complexity.

  3. GENERALIZED INVERSE INTERVAL METHOD OF GLOBAL CONSTRAINED OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    A. V. Panteleyev

    2014-01-01

    Full Text Available The algorithmic and program software of inverse interval method for global constrained optimization are considered. The solution of model examples and the proof of the theorems of the algorithm’s convergence are presented. The generalized scheme of developed algorithms has been created. This scheme has two replaceable modules of compression and check. This module approach allows the users to implement their own versions of the algorithm without loss of the method convergence. This will help to tune the method according to the characteristics of the current problem.

  4. Optimal correction and design parameter search by modern methods of rigorous global optimization

    International Nuclear Information System (INIS)

    Makino, K.; Berz, M.

    2011-01-01

    Frequently the design of schemes for correction of aberrations or the determination of possible operating ranges for beamlines and cells in synchrotrons exhibit multitudes of possibilities for their correction, usually appearing in disconnected regions of parameter space which cannot be directly qualified by analytical means. In such cases, frequently an abundance of optimization runs are carried out, each of which determines a local minimum depending on the specific chosen initial conditions. Practical solutions are then obtained through an often extended interplay of experienced manual adjustment of certain suitable parameters and local searches by varying other parameters. However, in a formal sense this problem can be viewed as a global optimization problem, i.e. the determination of all solutions within a certain range of parameters that lead to a specific optimum. For example, it may be of interest to find all possible settings of multiple quadrupoles that can achieve imaging; or to find ahead of time all possible settings that achieve a particular tune; or to find all possible manners to adjust nonlinear parameters to achieve correction of high order aberrations. These tasks can easily be phrased in terms of such an optimization problem; but while mathematically this formulation is often straightforward, it has been common belief that it is of limited practical value since the resulting optimization problem cannot usually be solved. However, recent significant advances in modern methods of rigorous global optimization make these methods feasible for optics design for the first time. The key ideas of the method lie in an interplay of rigorous local underestimators of the objective functions, and by using the underestimators to rigorously iteratively eliminate regions that lie above already known upper bounds of the minima, in what is commonly known as a branch-and-bound approach. Recent enhancements of the Differential Algebraic methods used in particle

  5. Global Optimization Based on the Hybridization of Harmony Search and Particle Swarm Optimization Methods

    Directory of Open Access Journals (Sweden)

    A. P. Karpenko

    2014-01-01

    Full Text Available We consider a class of stochastic search algorithms of global optimization which in various publications are called behavioural, intellectual, metaheuristic, inspired by the nature, swarm, multi-agent, population, etc. We use the last term.Experience in using the population algorithms to solve challenges of global optimization shows that application of one such algorithm may not always effective. Therefore now great attention is paid to hybridization of population algorithms of global optimization. Hybrid algorithms unite various algorithms or identical algorithms, but with various values of free parameters. Thus efficiency of one algorithm can compensate weakness of another.The purposes of the work are development of hybrid algorithm of global optimization based on known algorithms of harmony search (HS and swarm of particles (PSO, software implementation of algorithm, study of its efficiency using a number of known benchmark problems, and a problem of dimensional optimization of truss structure.We set a problem of global optimization, consider basic algorithms of HS and PSO, give a flow chart of the offered hybrid algorithm called PSO HS , present results of computing experiments with developed algorithm and software, formulate main results of work and prospects of its development.

  6. Deterministic Global Optimization

    CERN Document Server

    Scholz, Daniel

    2012-01-01

    This monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization

  7. Global optimization method using SLE and adaptive RBF based on fuzzy clustering

    Science.gov (United States)

    Zhu, Huaguang; Liu, Li; Long, Teng; Zhao, Junfeng

    2012-07-01

    High fidelity analysis models, which are beneficial to improving the design quality, have been more and more widely utilized in the modern engineering design optimization problems. However, the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable. In order to improve the efficiency of optimization involving high fidelity analysis models, the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models, which can greately reduce the computation time. An efficient heuristic global optimization method using adaptive radial basis function (RBF) based on fuzzy clustering (ARFC) is proposed. In this method, a novel algorithm of maximin Latin hypercube design using successive local enumeration (SLE) is employed to obtain sample points with good performance in both space-filling and projective uniformity properties, which does a great deal of good to metamodels accuracy. RBF method is adopted for constructing the metamodels, and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced. The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space. The numerical benchmark examples are used for validating the performance of ARFC. The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method (ARSM) proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum. This method improves the efficiency and global convergence of the optimization problems, and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.

  8. Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    V. D. Sulimov

    2014-01-01

    Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search

  9. A theoretical global optimization method for vapor-compression refrigeration systems based on entransy theory

    International Nuclear Information System (INIS)

    Xu, Yun-Chao; Chen, Qun

    2013-01-01

    The vapor-compression refrigeration systems have been one of the essential energy conversion systems for humankind and exhausting huge amounts of energy nowadays. Surrounding the energy efficiency promotion of the systems, there are lots of effectual optimization methods but mainly relied on engineering experience and computer simulations rather than theoretical analysis due to the complex and vague physical essence. We attempt to propose a theoretical global optimization method based on in-depth physical analysis for the involved physical processes, i.e. heat transfer analysis for condenser and evaporator, through introducing the entransy theory and thermodynamic analysis for compressor and expansion valve. The integration of heat transfer and thermodynamic analyses forms the overall physical optimization model for the systems to describe the relation between all the unknown parameters and known conditions, which makes theoretical global optimization possible. With the aid of the mathematical conditional extremum solutions, an optimization equation group and the optimal configuration of all the unknown parameters are analytically obtained. Eventually, via the optimization of a typical vapor-compression refrigeration system with various working conditions to minimize the total heat transfer area of heat exchangers, the validity and superior of the newly proposed optimization method is proved. - Highlights: • A global optimization method for vapor-compression systems is proposed. • Integrating heat transfer and thermodynamic analyses forms the optimization model. • A mathematical relation between design parameters and requirements is derived. • Entransy dissipation is introduced into heat transfer analysis. • The validity of the method is proved via optimization of practical cases

  10. The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

    Directory of Open Access Journals (Sweden)

    Liang Shen

    2017-01-01

    Full Text Available There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.

  11. A global optimization method for evaporative cooling systems based on the entransy theory

    International Nuclear Information System (INIS)

    Yuan, Fang; Chen, Qun

    2012-01-01

    Evaporative cooling technique, one of the most widely used methods, is essential to both energy conservation and environment protection. This contribution introduces a global optimization method for indirect evaporative cooling systems with coupled heat and mass transfer processes based on the entransy theory to improve their energy efficiency. First, we classify the irreversible processes in the system into the heat transfer process, the coupled heat and mass transfer process and the mixing process of waters in different branches, where the irreversibility is evaluated by the entransy dissipation. Then through the total system entransy dissipation, we establish the theoretical relationship of the user demands with both the geometrical structures of each heat exchanger and the operating parameters of each fluid, and derive two optimization equation groups focusing on two typical optimization problems. Finally, an indirect evaporative cooling system is taken as an example to illustrate the applications of the newly proposed optimization method. It is concluded that there exists an optimal circulating water flow rate with the minimum total thermal conductance of the system. Furthermore, with different user demands and moist air inlet conditions, it is the global optimization, other than parametric analysis, will obtain the optimal performance of the system. -- Highlights: ► Introduce a global optimization method for evaporative cooling systems. ► Establish the direct relation between user demands and the design parameters. ► Obtain two groups of optimization equations for two typical optimization objectives. ► Solving the equations offers the optimal design parameters for the system. ► Provide the instruction for the design of coupled heat and mass transfer systems.

  12. A Novel Global Path Planning Method for Mobile Robots Based on Teaching-Learning-Based Optimization

    Directory of Open Access Journals (Sweden)

    Zongsheng Wu

    2016-07-01

    Full Text Available The Teaching-Learning-Based Optimization (TLBO algorithm has been proposed in recent years. It is a new swarm intelligence optimization algorithm simulating the teaching-learning phenomenon of a classroom. In this paper, a novel global path planning method for mobile robots is presented, which is based on an improved TLBO algorithm called Nonlinear Inertia Weighted Teaching-Learning-Based Optimization (NIWTLBO algorithm in our previous work. Firstly, the NIWTLBO algorithm is introduced. Then, a new map model of the path between start-point and goal-point is built by coordinate system transformation. Lastly, utilizing the NIWTLBO algorithm, the objective function of the path is optimized; thus, a global optimal path is obtained. The simulation experiment results show that the proposed method has a faster convergence rate and higher accuracy in searching for the path than the basic TLBO and some other algorithms as well, and it can effectively solve the optimization problem for mobile robot global path planning.

  13. Autonomous Modelling of X-ray Spectra Using Robust Global Optimization Methods

    Science.gov (United States)

    Rogers, Adam; Safi-Harb, Samar; Fiege, Jason

    2015-08-01

    The standard approach to model fitting in X-ray astronomy is by means of local optimization methods. However, these local optimizers suffer from a number of problems, such as a tendency for the fit parameters to become trapped in local minima, and can require an involved process of detailed user intervention to guide them through the optimization process. In this work we introduce a general GUI-driven global optimization method for fitting models to X-ray data, written in MATLAB, which searches for optimal models with minimal user interaction. We directly interface with the commonly used XSPEC libraries to access the full complement of pre-existing spectral models that describe a wide range of physics appropriate for modelling astrophysical sources, including supernova remnants and compact objects. Our algorithm is powered by the Ferret genetic algorithm and Locust particle swarm optimizer from the Qubist Global Optimization Toolbox, which are robust at finding families of solutions and identifying degeneracies. This technique will be particularly instrumental for multi-parameter models and high-fidelity data. In this presentation, we provide details of the code and use our techniques to analyze X-ray data obtained from a variety of astrophysical sources.

  14. Efficient Methods for Bayesian Uncertainty Analysis and Global Optimization of Computationally Expensive Environmental Models

    Science.gov (United States)

    Shoemaker, Christine; Espinet, Antoine; Pang, Min

    2015-04-01

    Models of complex environmental systems can be computationally expensive in order to describe the dynamic interactions of the many components over a sizeable time period. Diagnostics of these systems can include forward simulations of calibrated models under uncertainty and analysis of alternatives of systems management. This discussion will focus on applications of new surrogate optimization and uncertainty analysis methods to environmental models that can enhance our ability to extract information and understanding. For complex models, optimization and especially uncertainty analysis can require a large number of model simulations, which is not feasible for computationally expensive models. Surrogate response surfaces can be used in Global Optimization and Uncertainty methods to obtain accurate answers with far fewer model evaluations, which made the methods practical for computationally expensive models for which conventional methods are not feasible. In this paper we will discuss the application of the SOARS surrogate method for estimating Bayesian posterior density functions for model parameters for a TOUGH2 model of geologic carbon sequestration. We will also briefly discuss new parallel surrogate global optimization algorithm applied to two groundwater remediation sites that was implemented on a supercomputer with up to 64 processors. The applications will illustrate the use of these methods to predict the impact of monitoring and management on subsurface contaminants.

  15. A Perturbation Based Chaotic System Exploiting the Quasi-Newton Method for Global Optimization

    Science.gov (United States)

    Tatsumi, Keiji; Tanino, Tetsuzo

    The chaotic system has been exploited in metaheuristic methods of solving continuous global optimization problems. Recently, the gradient method with perturbation (GP) was proposed, which was derived from the steepest descent method for the problem with additional perturbation terms, and it was reported that chaotic metaheuristics with the GP have good performances of solving some benchmark problems. Moreover, the sufficient condition of its parameter values was theoretically shown under which its updating system is chaotic. However, the sufficient condition of its chaoticity and the width of strange attractor around each local minimum, which are important properties for exploiting the chaotic system in optimization, deeply depend on the eigenvalues of the Hessian matrix of the objective function at the local minimum. Thus, if the eigenvalues of different local minima are widely different from each other, or if it is different in different problems, such properties can cause the difficulty of selecting appropriate parameter values for an effective search. Therefore, in this paper, we propose modified GPs based on the quasi-Newton method instead of the steepest descent method, where their chaoticities and the width of strange attractor do not depend on the eigenvalue of the Hessian matrix at any local minimum due to the scale invariant of the quasi-Newton method. In addition, we empirically demonstrate that the parameter selection of the proposed methods is easier than the original GP, especially with respect to the step-size, and the chaotic metaheuristics with the proposed methods can find better solutions for some multimodal functions.

  16. A global carbon assimilation system based on a dual optimization method

    Science.gov (United States)

    Zheng, H.; Li, Y.; Chen, J. M.; Wang, T.; Huang, Q.; Huang, W. X.; Wang, L. H.; Li, S. M.; Yuan, W. P.; Zheng, X.; Zhang, S. P.; Chen, Z. Q.; Jiang, F.

    2015-02-01

    Ecological models are effective tools for simulating the distribution of global carbon sources and sinks. However, these models often suffer from substantial biases due to inaccurate simulations of complex ecological processes. We introduce a set of scaling factors (parameters) to an ecological model on the basis of plant functional type (PFT) and latitudes. A global carbon assimilation system (GCAS-DOM) is developed by employing a dual optimization method (DOM) to invert the time-dependent ecological model parameter state and the net carbon flux state simultaneously. We use GCAS-DOM to estimate the global distribution of the CO2 flux on 1° × 1° grid cells for the period from 2001 to 2007. Results show that land and ocean absorb -3.63 ± 0.50 and -1.82 ± 0.16 Pg C yr-1, respectively. North America, Europe and China contribute -0.98 ± 0.15, -0.42 ± 0.08 and -0.20 ± 0.29 Pg C yr-1, respectively. The uncertainties in the flux after optimization by GCAS-DOM have been remarkably reduced by more than 60%. Through parameter optimization, GCAS-DOM can provide improved estimates of the carbon flux for each PFT. Coniferous forest (-0.97 ± 0.27 Pg C yr-1) is the largest contributor to the global carbon sink. Fluxes of once-dominant deciduous forest generated by the Boreal Ecosystems Productivity Simulator (BEPS) are reduced to -0.78 ± 0.23 Pg C yr-1, the third largest carbon sink.

  17. Global optimization of discrete truss topology design problems using a parallel cut-and-branch method

    DEFF Research Database (Denmark)

    Rasmussen, Marie-Louise Højlund; Stolpe, Mathias

    2008-01-01

    The subject of this article is solving discrete truss topology optimization problems with local stress and displacement constraints to global optimum. We consider a formulation based on the Simultaneous ANalysis and Design (SAND) approach. This intrinsically non-convex problem is reformulated...... to a mixed-integer linear program, which is solved with a parallel implementation of branch-and-bound. Additional valid inequalities and cuts are introduced to give a stronger representation of the problem, which improves convergence and speed up of the parallel method. The valid inequalities represent...... the physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions....

  18. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

  19. Stochastic and global optimization

    National Research Council Canada - National Science Library

    Dzemyda, Gintautas; Šaltenis, Vydūnas; Zhilinskas, A; Mockus, Jonas

    2002-01-01

    ... and Effectiveness of Controlled Random Search E. M. T. Hendrix, P. M. Ortigosa and I. García 129 9. Discrete Backtracking Adaptive Search for Global Optimization B. P. Kristinsdottir, Z. B. Zabinsky and...

  20. A GPS-Based Pitot-Static Calibration Method Using Global Output-Error Optimization

    Science.gov (United States)

    Foster, John V.; Cunningham, Kevin

    2010-01-01

    Pressure-based airspeed and altitude measurements for aircraft typically require calibration of the installed system to account for pressure sensing errors such as those due to local flow field effects. In some cases, calibration is used to meet requirements such as those specified in Federal Aviation Regulation Part 25. Several methods are used for in-flight pitot-static calibration including tower fly-by, pacer aircraft, and trailing cone methods. In the 1990 s, the introduction of satellite-based positioning systems to the civilian market enabled new inflight calibration methods based on accurate ground speed measurements provided by Global Positioning Systems (GPS). Use of GPS for airspeed calibration has many advantages such as accuracy, ease of portability (e.g. hand-held) and the flexibility of operating in airspace without the limitations of test range boundaries or ground telemetry support. The current research was motivated by the need for a rapid and statistically accurate method for in-flight calibration of pitot-static systems for remotely piloted, dynamically-scaled research aircraft. Current calibration methods were deemed not practical for this application because of confined test range size and limited flight time available for each sortie. A method was developed that uses high data rate measurements of static and total pressure, and GPSbased ground speed measurements to compute the pressure errors over a range of airspeed. The novel application of this approach is the use of system identification methods that rapidly compute optimal pressure error models with defined confidence intervals in nearreal time. This method has been demonstrated in flight tests and has shown 2- bounds of approximately 0.2 kts with an order of magnitude reduction in test time over other methods. As part of this experiment, a unique database of wind measurements was acquired concurrently with the flight experiments, for the purpose of experimental validation of the

  1. A Comparative Study on Recently-Introduced Nature-Based Global Optimization Methods in Complex Mechanical System Design

    Directory of Open Access Journals (Sweden)

    Abdulbaset El Hadi Saad

    2017-10-01

    Full Text Available Advanced global optimization algorithms have been continuously introduced and improved to solve various complex design optimization problems for which the objective and constraint functions can only be evaluated through computation intensive numerical analyses or simulations with a large number of design variables. The often implicit, multimodal, and ill-shaped objective and constraint functions in high-dimensional and “black-box” forms demand the search to be carried out using low number of function evaluations with high search efficiency and good robustness. This work investigates the performance of six recently introduced, nature-inspired global optimization methods: Artificial Bee Colony (ABC, Firefly Algorithm (FFA, Cuckoo Search (CS, Bat Algorithm (BA, Flower Pollination Algorithm (FPA and Grey Wolf Optimizer (GWO. These approaches are compared in terms of search efficiency and robustness in solving a set of representative benchmark problems in smooth-unimodal, non-smooth unimodal, smooth multimodal, and non-smooth multimodal function forms. In addition, four classic engineering optimization examples and a real-life complex mechanical system design optimization problem, floating offshore wind turbines design optimization, are used as additional test cases representing computationally-expensive black-box global optimization problems. Results from this comparative study show that the ability of these global optimization methods to obtain a good solution diminishes as the dimension of the problem, or number of design variables increases. Although none of these methods is universally capable, the study finds that GWO and ABC are more efficient on average than the other four in obtaining high quality solutions efficiently and consistently, solving 86% and 80% of the tested benchmark problems, respectively. The research contributes to future improvements of global optimization methods.

  2. Artificial Bee Colony Algorithm Combined with Grenade Explosion Method and Cauchy Operator for Global Optimization

    Directory of Open Access Journals (Sweden)

    Jian-Guo Zheng

    2015-01-01

    Full Text Available Artificial bee colony (ABC algorithm is a popular swarm intelligence technique inspired by the intelligent foraging behavior of honey bees. However, ABC is good at exploration but poor at exploitation and its convergence speed is also an issue in some cases. To improve the performance of ABC, a novel ABC combined with grenade explosion method (GEM and Cauchy operator, namely, ABCGC, is proposed. GEM is embedded in the onlooker bees’ phase to enhance the exploitation ability and accelerate convergence of ABCGC; meanwhile, Cauchy operator is introduced into the scout bees’ phase to help ABCGC escape from local optimum and further enhance its exploration ability. Two sets of well-known benchmark functions are used to validate the better performance of ABCGC. The experiments confirm that ABCGC is significantly superior to ABC and other competitors; particularly it converges to the global optimum faster in most cases. These results suggest that ABCGC usually achieves a good balance between exploitation and exploration and can effectively serve as an alternative for global optimization.

  3. Conference on "State of the Art in Global Optimization : Computational Methods and Applications"

    CERN Document Server

    Pardalos, P

    1996-01-01

    Optimization problems abound in most fields of science, engineering, and technology. In many of these problems it is necessary to compute the global optimum (or a good approximation) of a multivariable function. The variables that define the function to be optimized can be continuous and/or discrete and, in addition, many times satisfy certain constraints. Global optimization problems belong to the complexity class of NP-hard prob­ lems. Such problems are very difficult to solve. Traditional descent optimization algorithms based on local information are not adequate for solving these problems. In most cases of practical interest the number of local optima increases, on the aver­ age, exponentially with the size of the problem (number of variables). Furthermore, most of the traditional approaches fail to escape from a local optimum in order to continue the search for the global solution. Global optimization has received a lot of attention in the past ten years, due to the success of new algorithms for solvin...

  4. Efficiency of Pareto joint inversion of 2D geophysical data using global optimization methods

    Science.gov (United States)

    Miernik, Katarzyna; Bogacz, Adrian; Kozubal, Adam; Danek, Tomasz; Wojdyła, Marek

    2016-04-01

    Pareto joint inversion of two or more sets of data is a promising new tool of modern geophysical exploration. In the first stage of our investigation we created software enabling execution of forward solvers of two geophysical methods (2D magnetotelluric and gravity) as well as inversion with possibility of constraining solution with seismic data. In the algorithm solving MT forward solver Helmholtz's equations, finite element method and Dirichlet's boundary conditions were applied. Gravity forward solver was based on Talwani's algorithm. To limit dimensionality of solution space we decided to describe model as sets of polygons, using Sharp Boundary Interface (SBI) approach. The main inversion engine was created using Particle Swarm Optimization (PSO) algorithm adapted to handle two or more target functions and to prevent acceptance of solutions which are non - realistic or incompatible with Pareto scheme. Each inversion run generates single Pareto solution, which can be added to Pareto Front. The PSO inversion engine was parallelized using OpenMP standard, what enabled execution code for practically unlimited amount of threads at once. Thereby computing time of inversion process was significantly decreased. Furthermore, computing efficiency increases with number of PSO iterations. In this contribution we analyze the efficiency of created software solution taking under consideration details of chosen global optimization engine used as a main joint minimization engine. Additionally we study the scale of possible decrease of computational time caused by different methods of parallelization applied for both forward solvers and inversion algorithm. All tests were done for 2D magnetotelluric and gravity data based on real geological media. Obtained results show that even for relatively simple mid end computational infrastructure proposed solution of inversion problem can be applied in practice and used for real life problems of geophysical inversion and interpretation.

  5. Convex analysis and global optimization

    CERN Document Server

    Tuy, Hoang

    2016-01-01

    This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;

    methods for specially structured problems; · A complete revision of the chapter on nonconvex quadratic programming...

  6. Application of Global Optimization Methods for Feature Selection and Machine Learning

    OpenAIRE

    Wu, Shaohua; Hu, Yong; Wang, Wei; Feng, Xinyong; Shu, Wanneng

    2013-01-01

    The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. The process reduces the number of features by removing irrelevant and redundant data. This paper proposed a novel immune clonal genetic algorithm based on immune clonal algorithm designed to solve the feature selection problem. The proposed algorithm has more exploration and exploitation abilities due to the clonal selection theory, and each antibody in the search space specifie...

  7. A globally optimal k-anonymity method for the de-identification of health data.

    Science.gov (United States)

    El Emam, Khaled; Dankar, Fida Kamal; Issa, Romeo; Jonker, Elizabeth; Amyot, Daniel; Cogo, Elise; Corriveau, Jean-Pierre; Walker, Mark; Chowdhury, Sadrul; Vaillancourt, Regis; Roffey, Tyson; Bottomley, Jim

    2009-01-01

    Explicit patient consent requirements in privacy laws can have a negative impact on health research, leading to selection bias and reduced recruitment. Often legislative requirements to obtain consent are waived if the information collected or disclosed is de-identified. The authors developed and empirically evaluated a new globally optimal de-identification algorithm that satisfies the k-anonymity criterion and that is suitable for health datasets. Authors compared OLA (Optimal Lattice Anonymization) empirically to three existing k-anonymity algorithms, Datafly, Samarati, and Incognito, on six public, hospital, and registry datasets for different values of k and suppression limits. Measurement Three information loss metrics were used for the comparison: precision, discernability metric, and non-uniform entropy. Each algorithm's performance speed was also evaluated. The Datafly and Samarati algorithms had higher information loss than OLA and Incognito; OLA was consistently faster than Incognito in finding the globally optimal de-identification solution. For the de-identification of health datasets, OLA is an improvement on existing k-anonymity algorithms in terms of information loss and performance.

  8. A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    JongHyup Lee

    2016-08-01

    Full Text Available For practical deployment of wireless sensor networks (WSN, WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections.

  9. Application of Global Optimization Methods for Feature Selection and Machine Learning

    Directory of Open Access Journals (Sweden)

    Shaohua Wu

    2013-01-01

    Full Text Available The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. The process reduces the number of features by removing irrelevant and redundant data. This paper proposed a novel immune clonal genetic algorithm based on immune clonal algorithm designed to solve the feature selection problem. The proposed algorithm has more exploration and exploitation abilities due to the clonal selection theory, and each antibody in the search space specifies a subset of the possible features. Experimental results show that the proposed algorithm simplifies the feature selection process effectively and obtains higher classification accuracy than other feature selection algorithms.

  10. Lithological and Surface Geometry Joint Inversions Using Multi-Objective Global Optimization Methods

    Science.gov (United States)

    Lelièvre, Peter; Bijani, Rodrigo; Farquharson, Colin

    2016-04-01

    surfaces are set to a priori values. The inversion is tasked with calculating the geometry of the contact surfaces instead of some piecewise distribution of properties in a mesh. Again, no coupling measure is required and joint inversion is simplified. Both of these inverse problems involve high nonlinearity and discontinuous or non-obtainable derivatives. They can also involve the existence of multiple minima. Hence, one can not apply the standard descent-based local minimization methods used to solve typical minimum-structure inversions. Instead, we are applying Pareto multi-objective global optimization (PMOGO) methods, which generate a suite of solutions that minimize multiple objectives (e.g. data misfits and regularization terms) in a Pareto-optimal sense. Providing a suite of models, as opposed to a single model that minimizes a weighted sum of objectives, allows a more complete assessment of the possibilities and avoids the often difficult choice of how to weight each objective. While there are definite advantages to PMOGO joint inversion approaches, the methods come with significantly increased computational requirements. We are researching various strategies to ameliorate these computational issues including parallelization and problem dimension reduction.

  11. OPTIMIZATION METHODS

    Directory of Open Access Journals (Sweden)

    Olimpia PECINGINA

    2016-05-01

    Full Text Available Throughout the ages, man has continuously been involved with the process of optimization. In its earliest form, optimization consisted of unscientific rituals and prejudices like pouring libations and sacrificing animals to the gods, con- sulting the oracles, observing the positions of the stars, and watching the flight of birds. When the circumstances were appropriate, the timing was thought to be auspicious (or optimum for planting the crops or embarking on a war.

  12. An Improved Global Optimization Method and Its Application in Complex Hydrological Model Calibration and Parameter Uncertainty Study

    Science.gov (United States)

    Chu, W.; Gao, X.; Sorooshian, S.

    2009-12-01

    With the advancement of modern computer technology, many heuristic global optimization algorithms have been developed and applied to various fields of science and engineering in the last two decades. In surface hydrology, parameter optimization is a bridge connecting model simulation and real observation. Due to the lack of detailed physical understanding or descriptions of the hydrological process, most rainfall-runoff models are built with conceptual components. Therefore, the model parameters mostly include unknown correlations and uncertainties and have to be calibrated based on observation to make the model function properly. As a good attempt to automatically calibrate conceptual rainfall-runoff models, the shuffled complex evolution (SCE-UA) method was developed and has exhibited its efficacy and efficiency. However, our recent study reveals that the SCE-UA method overlooks some fundamental assumption of direct search theory and hence loses its power when optimizing complex and high-dimensional problems. By integrating some new techniques of heuristic search and overcoming the above-mentioned shortage, a new method has been developed. This method is applied to calibrate the Sacramento Soil Moisture Accounting (SAC-SMA) model and study the parameter uncertainties. Results show that the method outperforms SCE-UA in the following aspects: 1) It retrieves better parameter values which further reduce the model’s root mean square error; 2) The method is more robust; 3) The ensemble of optimized parameters using this method better delineates model parameters’ uncertainty, which is critical to understanding model behaviors.

  13. Global optimization and sensitivity analysis

    International Nuclear Information System (INIS)

    Cacuci, D.G.

    1990-01-01

    A new direction for the analysis of nonlinear models of nuclear systems is suggested to overcome fundamental limitations of sensitivity analysis and optimization methods currently prevalent in nuclear engineering usage. This direction is toward a global analysis of the behavior of the respective system as its design parameters are allowed to vary over their respective design ranges. Presented is a methodology for global analysis that unifies and extends the current scopes of sensitivity analysis and optimization by identifying all the critical points (maxima, minima) and solution bifurcation points together with corresponding sensitivities at any design point of interest. The potential applicability of this methodology is illustrated with test problems involving multiple critical points and bifurcations and comprising both equality and inequality constraints

  14. Accelerating the SCE-UA Global Optimization Method Based on Multi-Core CPU and Many-Core GPU

    Directory of Open Access Journals (Sweden)

    Guangyuan Kan

    2016-01-01

    Full Text Available The famous global optimization SCE-UA method, which has been widely used in the field of environmental model parameter calibration, is an effective and robust method. However, the SCE-UA method has a high computational load which prohibits the application of SCE-UA to high dimensional and complex problems. In recent years, the hardware of computer, such as multi-core CPUs and many-core GPUs, improves significantly. These much more powerful new hardware and their software ecosystems provide an opportunity to accelerate the SCE-UA method. In this paper, we proposed two parallel SCE-UA methods and implemented them on Intel multi-core CPU and NVIDIA many-core GPU by OpenMP and CUDA Fortran, respectively. The Griewank benchmark function was adopted in this paper to test and compare the performances of the serial and parallel SCE-UA methods. According to the results of the comparison, some useful advises were given to direct how to properly use the parallel SCE-UA methods.

  15. Stochastic global optimization as a filtering problem

    International Nuclear Information System (INIS)

    Stinis, Panos

    2012-01-01

    We present a reformulation of stochastic global optimization as a filtering problem. The motivation behind this reformulation comes from the fact that for many optimization problems we cannot evaluate exactly the objective function to be optimized. Similarly, we may not be able to evaluate exactly the functions involved in iterative optimization algorithms. For example, we may only have access to noisy measurements of the functions or statistical estimates provided through Monte Carlo sampling. This makes iterative optimization algorithms behave like stochastic maps. Naive global optimization amounts to evolving a collection of realizations of this stochastic map and picking the realization with the best properties. This motivates the use of filtering techniques to allow focusing on realizations that are more promising than others. In particular, we present a filtering reformulation of global optimization in terms of a special case of sequential importance sampling methods called particle filters. The increasing popularity of particle filters is based on the simplicity of their implementation and their flexibility. We utilize the flexibility of particle filters to construct a stochastic global optimization algorithm which can converge to the optimal solution appreciably faster than naive global optimization. Several examples of parametric exponential density estimation are provided to demonstrate the efficiency of the approach.

  16. Asynchronous parallel search in global optimization problems

    Energy Technology Data Exchange (ETDEWEB)

    Archetti, F.; Schoen, F.

    1982-01-01

    A class of asynchronous parallel search methods is proposed in order to solve the global optimization problem on a multiprocessor system, consisting of several processors which can communicate through a set of global variables contained in a memory shared by all processors. The speed-up ratio and memory contension effects are experimentally analyzed for some algorithms of this class. 6 references.

  17. Global optimization at work

    NARCIS (Netherlands)

    Hendrix, E.M.T.

    1998-01-01

    In many research situations where mathematical models are used, researchers try to find parameter values such that a given performance criterion is at an optimum. If the parameters can be varied in a continuous way, this in general defines a so-called Nonlinear Programming Problem. Methods

  18. Global optimization at work

    OpenAIRE

    Hendrix, E.M.T.

    1998-01-01

    In many research situations where mathematical models are used, researchers try to find parameter values such that a given performance criterion is at an optimum. If the parameters can be varied in a continuous way, this in general defines a so-called Nonlinear Programming Problem. Methods for Nonlinear Programming usually result in local optima. A local optimum is a solution (parameter values) which is the best with respect to values in the neighbourhood of that solution, not necess...

  19. On the efficiency of chaos optimization algorithms for global optimization

    International Nuclear Information System (INIS)

    Yang Dixiong; Li Gang; Cheng Gengdong

    2007-01-01

    Chaos optimization algorithms as a novel method of global optimization have attracted much attention, which were all based on Logistic map. However, we have noticed that the probability density function of the chaotic sequences derived from Logistic map is a Chebyshev-type one, which may affect the global searching capacity and computational efficiency of chaos optimization algorithms considerably. Considering the statistical property of the chaotic sequences of Logistic map and Kent map, the improved hybrid chaos-BFGS optimization algorithm and the Kent map based hybrid chaos-BFGS algorithm are proposed. Five typical nonlinear functions with multimodal characteristic are tested to compare the performance of five hybrid optimization algorithms, which are the conventional Logistic map based chaos-BFGS algorithm, improved Logistic map based chaos-BFGS algorithm, Kent map based chaos-BFGS algorithm, Monte Carlo-BFGS algorithm, mesh-BFGS algorithm. The computational performance of the five algorithms is compared, and the numerical results make us question the high efficiency of the chaos optimization algorithms claimed in some references. It is concluded that the efficiency of the hybrid optimization algorithms is influenced by the statistical property of chaotic/stochastic sequences generated from chaotic/stochastic algorithms, and the location of the global optimum of nonlinear functions. In addition, it is inappropriate to advocate the high efficiency of the global optimization algorithms only depending on several numerical examples of low-dimensional functions

  20. Evolutionary global optimization, manifolds and applications

    CERN Document Server

    Aguiar e Oliveira Junior, Hime

    2016-01-01

    This book presents powerful techniques for solving global optimization problems on manifolds by means of evolutionary algorithms, and shows in practice how these techniques can be applied to solve real-world problems. It describes recent findings and well-known key facts in general and differential topology, revisiting them all in the context of application to current optimization problems. Special emphasis is put on game theory problems. Here, these problems are reformulated as constrained global optimization tasks and solved with the help of Fuzzy ASA. In addition, more abstract examples, including minimizations of well-known functions, are also included. Although the Fuzzy ASA approach has been chosen as the main optimizing paradigm, the book suggests that other metaheuristic methods could be used as well. Some of them are introduced, together with their advantages and disadvantages. Readers should possess some knowledge of linear algebra, and of basic concepts of numerical analysis and probability theory....

  1. Methods of mathematical optimization

    Science.gov (United States)

    Vanderplaats, G. N.

    The fundamental principles of numerical optimization methods are reviewed, with an emphasis on potential engineering applications. The basic optimization process is described; unconstrained and constrained minimization problems are defined; a general approach to the design of optimization software programs is outlined; and drawings and diagrams are shown for examples involving (1) the conceptual design of an aircraft, (2) the aerodynamic optimization of an airfoil, (3) the design of an automotive-engine connecting rod, and (4) the optimization of a 'ski-jump' to assist aircraft in taking off from a very short ship deck.

  2. Solving Unconstrained Global Optimization Problems via Hybrid Swarm Intelligence Approaches

    OpenAIRE

    Wu, Jui-Yu

    2013-01-01

    Stochastic global optimization (SGO) algorithms such as the particle swarm optimization (PSO) approach have become popular for solving unconstrained global optimization (UGO) problems. The PSO approach, which belongs to the swarm intelligence domain, does not require gradient information, enabling it to overcome this limitation of traditional nonlinear programming methods. Unfortunately, PSO algorithm implementation and performance depend on several parameters, such as cognitive parameter, so...

  3. Parallel Global Optimization with the Particle Swarm Algorithm (Preprint)

    National Research Council Canada - National Science Library

    Schutte, J. F; Reinbolt, J. A; Fregly, B. J; Haftka, R. T; George, A. D

    2004-01-01

    .... To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the Particle Swarm Optimization (PSO) algorithm...

  4. Stochastic optimization methods

    CERN Document Server

    Marti, Kurt

    2005-01-01

    Optimization problems arising in practice involve random parameters. For the computation of robust optimal solutions, i.e., optimal solutions being insensitive with respect to random parameter variations, deterministic substitute problems are needed. Based on the distribution of the random data, and using decision theoretical concepts, optimization problems under stochastic uncertainty are converted into deterministic substitute problems. Due to the occurring probabilities and expectations, approximative solution techniques must be applied. Deterministic and stochastic approximation methods and their analytical properties are provided: Taylor expansion, regression and response surface methods, probability inequalities, First Order Reliability Methods, convex approximation/deterministic descent directions/efficient points, stochastic approximation methods, differentiation of probability and mean value functions. Convergence results of the resulting iterative solution procedures are given.

  5. Global optimization of digital circuits

    Science.gov (United States)

    Flandera, Richard

    1991-12-01

    This thesis was divided into two tasks. The first task involved developing a parser which could translate a behavioral specification in Very High-Speed Integrated Circuits (VHSIC) Hardware Description Language (VHDL) into the format used by an existing digital circuit optimization tool, Boolean Reasoning In Scheme (BORIS). Since this tool is written in Scheme, a dialect of Lisp, the parser was also written in Scheme. The parser was implemented is Artez's modification of Earley's Algorithm. Additionally, a VHDL tokenizer was implemented in Scheme and a portion of the VHDL grammar was converted into the format which the parser uses. The second task was the incorporation of intermediate functions into BORIS. The existing BORIS contains a recursive optimization system that optimizes digital circuits by using circuit outputs as inputs into other circuits. Intermediate functions provide a greater selection of functions to be used as circuits inputs. Using both intermediate functions and output functions, the costs of the circuits in the test set were reduced by 43 percent. This is a 10 percent reduction when compared to the existing recursive optimization system. Incorporating intermediate functions into BORIS required the development of an intermediate-function generator and a set of control methods to keep the computation time from increasing exponentially.

  6. Competing intelligent search agents in global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Streltsov, S.; Vakili, P. [Boston Univ., MA (United States); Muchnik, I. [Rutgers Univ., Piscataway, NJ (United States)

    1996-12-31

    In this paper we present a new search methodology that we view as a development of intelligent agent approach to the analysis of complex system. The main idea is to consider search process as a competition mechanism between concurrent adaptive intelligent agents. Agents cooperate in achieving a common search goal and at the same time compete with each other for computational resources. We propose a statistical selection approach to resource allocation between agents that leads to simple and efficient on average index allocation policies. We use global optimization as the most general setting that encompasses many types of search problems, and show how proposed selection policies can be used to improve and combine various global optimization methods.

  7. Practical methods of optimization

    CERN Document Server

    Fletcher, R

    2013-01-01

    Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the heuristics useful in making them perform more reliably and efficiently. To this end, it presents comparative numerical studies to give readers a feel for possibile applications and to illustrate the problems in assessing evidence. Also provides theoretical background which provides insights into how methods are derived. This edition offers rev

  8. A perturbed martingale approach to global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Sarkar, Saikat [Computational Mechanics Lab, Department of Civil Engineering, Indian Institute of Science, Bangalore 560012 (India); Roy, Debasish, E-mail: royd@civil.iisc.ernet.in [Computational Mechanics Lab, Department of Civil Engineering, Indian Institute of Science, Bangalore 560012 (India); Vasu, Ram Mohan [Department of Instrumentation and Applied Physics, Indian Institute of Science, Bangalore 560012 (India)

    2014-08-01

    A new global stochastic search, guided mainly through derivative-free directional information computable from the sample statistical moments of the design variables within a Monte Carlo setup, is proposed. The search is aided by imparting to the directional update term additional layers of random perturbations referred to as ‘coalescence’ and ‘scrambling’. A selection step, constituting yet another avenue for random perturbation, completes the global search. The direction-driven nature of the search is manifest in the local extremization and coalescence components, which are posed as martingale problems that yield gain-like update terms upon discretization. As anticipated and numerically demonstrated, to a limited extent, against the problem of parameter recovery given the chaotic response histories of a couple of nonlinear oscillators, the proposed method appears to offer a more rational, more accurate and faster alternative to most available evolutionary schemes, prominently the particle swarm optimization. - Highlights: • Evolutionary global optimization is posed as a perturbed martingale problem. • Resulting search via additive updates is a generalization over Gateaux derivatives. • Additional layers of random perturbation help avoid trapping at local extrema. • The approach ensures efficient design space exploration and high accuracy. • The method is numerically assessed via parameter recovery of chaotic oscillators.

  9. A Collective Neurodynamic Approach to Constrained Global Optimization.

    Science.gov (United States)

    Yan, Zheng; Fan, Jianchao; Wang, Jun

    2017-05-01

    Global optimization is a long-lasting research topic in the field of optimization, posting many challenging theoretic and computational issues. This paper presents a novel collective neurodynamic method for solving constrained global optimization problems. At first, a one-layer recurrent neural network (RNN) is presented for searching the Karush-Kuhn-Tucker points of the optimization problem under study. Next, a collective neuroydnamic optimization approach is developed by emulating the paradigm of brainstorming. Multiple RNNs are exploited cooperatively to search for the global optimal solutions in a framework of particle swarm optimization. Each RNN carries out a precise local search and converges to a candidate solution according to its own neurodynamics. The neuronal state of each neural network is repetitively reset by exchanging historical information of each individual network and the entire group. Wavelet mutation is performed to avoid prematurity, add diversity, and promote global convergence. It is proved in the framework of stochastic optimization that the proposed collective neurodynamic approach is capable of computing the global optimal solutions with probability one provided that a sufficiently large number of neural networks are utilized. The essence of the collective neurodynamic optimization approach lies in its potential to solve constrained global optimization problems in real time. The effectiveness and characteristics of the proposed approach are illustrated by using benchmark optimization problems.

  10. Microwave tomography global optimization, parallelization and performance evaluation

    CERN Document Server

    Noghanian, Sima; Desell, Travis; Ashtari, Ali

    2014-01-01

    This book provides a detailed overview on the use of global optimization and parallel computing in microwave tomography techniques. The book focuses on techniques that are based on global optimization and electromagnetic numerical methods. The authors provide parallelization techniques on homogeneous and heterogeneous computing architectures on high performance and general purpose futuristic computers. The book also discusses the multi-level optimization technique, hybrid genetic algorithm and its application in breast cancer imaging.

  11. Essays and surveys in global optimization

    CERN Document Server

    Audet, Charles; Savard, Giles

    2005-01-01

    Global optimization aims at solving the most general problems of deterministic mathematical programming. In addition, once the solutions are found, this methodology is also expected to prove their optimality. With these difficulties in mind, global optimization is becoming an increasingly powerful and important methodology. This book is the most recent examination of its mathematical capability, power, and wide ranging solutions to many fields in the applied sciences.

  12. Introduction to Nonlinear and Global Optimization

    NARCIS (Netherlands)

    Hendrix, E.M.T.; Tóth, B.

    2010-01-01

    This self-contained text provides a solid introduction to global and nonlinear optimization, providing students of mathematics and interdisciplinary sciences with a strong foundation in applied optimization techniques. The book offers a unique hands-on and critical approach to applied optimization

  13. A perturbed martingale approach to global optimization

    Science.gov (United States)

    Sarkar, Saikat; Roy, Debasish; Vasu, Ram Mohan

    2014-08-01

    A new global stochastic search, guided mainly through derivative-free directional information computable from the sample statistical moments of the design variables within a Monte Carlo setup, is proposed. The search is aided by imparting to the directional update term additional layers of random perturbations referred to as ‘coalescence’ and ‘scrambling’. A selection step, constituting yet another avenue for random perturbation, completes the global search. The direction-driven nature of the search is manifest in the local extremization and coalescence components, which are posed as martingale problems that yield gain-like update terms upon discretization. As anticipated and numerically demonstrated, to a limited extent, against the problem of parameter recovery given the chaotic response histories of a couple of nonlinear oscillators, the proposed method appears to offer a more rational, more accurate and faster alternative to most available evolutionary schemes, prominently the particle swarm optimization.

  14. Well Test Analysis of Naturally Fractured Vuggy Reservoirs with an Analytical Triple Porosity – Double Permeability Model and a Global Optimization Method

    Directory of Open Access Journals (Sweden)

    Gómez Susana

    2014-07-01

    Full Text Available The aim of this work is to study the automatic characterization of Naturally Fractured Vuggy Reservoirs via well test analysis, using a triple porosity-dual permeability model. The inter-porosity flow parameters, the storativity ratios, as well as the permeability ratio, the wellbore storage effect, the skin and the total permeability will be identified as parameters of the model. In this work, we will perform the well test interpretation in Laplace space, using numerical algorithms to transfer the discrete real data given in fully dimensional time to Laplace space. The well test interpretation problem in Laplace space has been posed as a nonlinear least squares optimization problem with box constraints and a linear inequality constraint, which is usually solved using local Newton type methods with a trust region. However, local methods as the one used in our work called TRON or the well-known Levenberg-Marquardt method, are often not able to find an optimal solution with a good fit of the data. Also well test analysis with the triple porosity-double permeability model, like most inverse problems, can yield multiple solutions with good match to the data. To deal with these specific characteristics, we will use a global optimization algorithm called the Tunneling Method (TM. In the design of the algorithm, we take into account issues of the problem like the fact that the parameter estimation has to be done with high precision, the presence of noise in the measurements and the need to solve the problem computationally fast. We demonstrate that the use of the TM in this study, showed to be an efficient and robust alternative to solve the well test characterization, as several optimal solutions, with very good match to the data were obtained.

  15. Advances in stochastic and deterministic global optimization

    CERN Document Server

    Zhigljavsky, Anatoly; Žilinskas, Julius

    2016-01-01

    Current research results in stochastic and deterministic global optimization including single and multiple objectives are explored and presented in this book by leading specialists from various fields. Contributions include applications to multidimensional data visualization, regression, survey calibration, inventory management, timetabling, chemical engineering, energy systems, and competitive facility location. Graduate students, researchers, and scientists in computer science, numerical analysis, optimization, and applied mathematics will be fascinated by the theoretical, computational, and application-oriented aspects of stochastic and deterministic global optimization explored in this book. This volume is dedicated to the 70th birthday of Antanas Žilinskas who is a leading world expert in global optimization. Professor Žilinskas's research has concentrated on studying models for the objective function, the development and implementation of efficient algorithms for global optimization with single and mu...

  16. Interactive Cosegmentation Using Global and Local Energy Optimization

    OpenAIRE

    Xingping Dong,; Jianbing Shen,; Shao, Ling; Yang, Ming-Hsuan

    2015-01-01

    We propose a novel interactive cosegmentation method using global and local energy optimization. The global energy includes two terms: 1) the global scribbled energy and 2) the interimage energy. The first one utilizes the user scribbles to build the Gaussian mixture model and improve the cosegmentation performance. The second one is a global constraint, which attempts to match the histograms of common objects. To minimize the local energy, we apply the spline regression to learn the smoothne...

  17. Comparative efficiency of dimensionality reduction schemes in global optimization

    Science.gov (United States)

    Grishagin, Vladimir; Israfilov, Ruslan; Sergeyev, Yaroslav

    2016-10-01

    This work presents results of a comparative efficiency for global optimization methods based on ideas of reducing the dimensionality of the multiextremal optimization problems. Two approaches to the dimensionality reduction are considered. One of them applies Peano-type space filling curves for reducing the multidimensional problem to an equivalent univariate one. The second approach is based on the nested optimization scheme that transforms the multidimensional problem to a family of one-dimensional subproblems connected recursively. In the frameworks of both approaches, the so-called characteristical algorithms are used for executing the univariate optimization. The efficiency of the compared global search methods is evaluated experimentally on the well-known GKLS test class generator being at present a classical tool for testing global optimization algorithms. Results for problems of different dimensions demonstrate a convincing advantage of the adaptive nested optimization scheme used in combination with the information-statistical univariate algorithm over its rivals.

  18. GA BASED GLOBAL OPTIMAL DESIGN PARAMETERS FOR ...

    African Journals Online (AJOL)

    This article uses Genetic Algorithm (GA) for the global design optimization of consecutive reactions taking place in continuous stirred tank reactors (CSTRs) connected in series. GA based optimal design determines the optimum number of CSTRs in series to achieve the maximum conversion, fractional yield and selectivity ...

  19. Elephant swarm water search algorithm for global optimization

    Indian Academy of Sciences (India)

    The rising complexity of real-life optimization problems has constantly inspired computer researchers to develop new efficient optimization methods. ... reach nearest to global minima and enabled inference of all true regulations of GRN correctly with less computational time compared with the other existing metaheuristics.

  20. Optimal beneficiation of global resources

    Energy Technology Data Exchange (ETDEWEB)

    Aloisi de Larderel, J. (Industry and Environment Office, Paris (France). United Nations Environment Programme)

    1989-01-01

    The growth of the world's population and related human activities are clearly leaving major effects on the environment and on the level of use of natural resources: forests are disappearing, air pollution is leading to acid rains, changes are occuring in the atmospheric ozone and global climate, more and more people lack access to reasonable safe supplies of water, soil pollution is becoming a problem, mineral and energy resources are increasingly being used. Producing more with less, producing more, polluting less, these are basic challenges that the world now faces. Low- and non-waste technologies are certainly one of the keys to those challenges.

  1. Stochastic optimization methods

    CERN Document Server

    Marti, Kurt

    2008-01-01

    Optimization problems arising in practice involve random model parameters. This book features many illustrations, several examples, and applications to concrete problems from engineering and operations research.

  2. A Direct Search Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Enrique Baeyens

    2016-06-01

    Full Text Available A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is differentiable and its gradient is Lipschitz continuous. The algorithm’s performance has been extensively tested using benchmark functions and compared to some well-known global optimization algorithms. The results of the computational study show that the algorithm combines both simplicity and efficiency and is competitive with the heuristics-based strategies presently used for global optimization.

  3. Deterministic global optimization an introduction to the diagonal approach

    CERN Document Server

    Sergeyev, Yaroslav D

    2017-01-01

    This book begins with a concentrated introduction into deterministic global optimization and moves forward to present new original results from the authors who are well known experts in the field. Multiextremal continuous problems that have an unknown structure with Lipschitz objective functions and functions having the first Lipschitz derivatives defined over hyperintervals are examined. A class of algorithms using several Lipschitz constants is introduced which has its origins in the DIRECT (DIviding RECTangles) method. This new class is based on an efficient strategy that is applied for the search domain partitioning. In addition a survey on derivative free methods and methods using the first derivatives is given for both one-dimensional and multi-dimensional cases. Non-smooth and smooth minorants and acceleration techniques that can speed up several classes of global optimization methods with examples of applications and problems arising in numerical testing of global optimization algorithms are discussed...

  4. Conference on Convex Analysis and Global Optimization

    CERN Document Server

    Pardalos, Panos

    2001-01-01

    There has been much recent progress in global optimization algo­ rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun­ damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon­ vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en­ dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...

  5. Analytical methods of optimization

    CERN Document Server

    Lawden, D F

    2006-01-01

    Suitable for advanced undergraduates and graduate students, this text surveys the classical theory of the calculus of variations. It takes the approach most appropriate for applications to problems of optimizing the behavior of engineering systems. Two of these problem areas have strongly influenced this presentation: the design of the control systems and the choice of rocket trajectories to be followed by terrestrial and extraterrestrial vehicles.Topics include static systems, control systems, additional constraints, the Hamilton-Jacobi equation, and the accessory optimization problem. Prereq

  6. Global search acceleration in the nested optimization scheme

    Science.gov (United States)

    Grishagin, Vladimir A.; Israfilov, Ruslan A.

    2016-06-01

    Multidimensional unconstrained global optimization problem with objective function under Lipschitz condition is considered. For solving this problem the dimensionality reduction approach on the base of the nested optimization scheme is used. This scheme reduces initial multidimensional problem to a family of one-dimensional subproblems being Lipschitzian as well and thus allows applying univariate methods for the execution of multidimensional optimization. For two well-known one-dimensional methods of Lipschitz optimization the modifications providing the acceleration of the search process in the situation when the objective function is continuously differentiable in a vicinity of the global minimum are considered and compared. Results of computational experiments on conventional test class of multiextremal functions confirm efficiency of the modified methods.

  7. Optimization methods for logical inference

    CERN Document Server

    Chandru, Vijay

    2011-01-01

    Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in

  8. Exploration versus Exploitation in Global Atomistic Structure Optimization

    DEFF Research Database (Denmark)

    Jorgensen, Mathias S.; Larsen, Uffe F.; Jacobsen, Karsten Wedel

    2018-01-01

    The ability to navigate vast energy landscapes of molecules, clusters, and solids is a necessity for discovering novel compounds in computational chemistry and materials science. For high-dimensional systems, it is only computationally feasible to search a small portion of the landscape, and hence......, the search strategy is of critical importance. Introducing Bayesian optimization concepts in an evolutionary algorithm framework, we quantify the concepts of exploration and exploitation in global minimum searches. The method allows us to control the balance between probing unknown regions of the landscape...... reconstruction. In addition, global search behaviors are analyzed to provide reasonable grounds for an optimal balance for different problems....

  9. Optimizing human activity patterns using global sensitivity analysis.

    Science.gov (United States)

    Fairchild, Geoffrey; Hickmann, Kyle S; Mniszewski, Susan M; Del Valle, Sara Y; Hyman, James M

    2014-12-01

    Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule's regularity for a population. We show how to tune an activity's regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

  10. A concept for global optimization of topology design problems

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Achtziger, Wolfgang; Kawamoto, Atsushi

    2006-01-01

    We present a concept for solving topology design problems to proven global optimality. We propose that the problems are modeled using the approach of simultaneous analysis and design with discrete design variables and solved with convergent branch and bound type methods. This concept is illustrated...

  11. Interior search algorithm (ISA): a novel approach for global optimization.

    Science.gov (United States)

    Gandomi, Amir H

    2014-07-01

    This paper presents the interior search algorithm (ISA) as a novel method for solving optimization tasks. The proposed ISA is inspired by interior design and decoration. The algorithm is different from other metaheuristic algorithms and provides new insight for global optimization. The proposed method is verified using some benchmark mathematical and engineering problems commonly used in the area of optimization. ISA results are further compared with well-known optimization algorithms. The results show that the ISA is efficiently capable of solving optimization problems. The proposed algorithm can outperform the other well-known algorithms. Further, the proposed algorithm is very simple and it only has one parameter to tune. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

  12. A Novel Consensus-Based Particle Swarm Optimization-Assisted Trust-Tech Methodology for Large-Scale Global Optimization.

    Science.gov (United States)

    Zhang, Yong-Feng; Chiang, Hsiao-Dong

    2017-09-01

    A novel three-stage methodology, termed the "consensus-based particle swarm optimization (PSO)-assisted Trust-Tech methodology," to find global optimal solutions for nonlinear optimization problems is presented. It is composed of Trust-Tech methods, consensus-based PSO, and local optimization methods that are integrated to compute a set of high-quality local optimal solutions that can contain the global optimal solution. The proposed methodology compares very favorably with several recently developed PSO algorithms based on a set of small-dimension benchmark optimization problems and 20 large-dimension test functions from the CEC 2010 competition. The analytical basis for the proposed methodology is also provided. Experimental results demonstrate that the proposed methodology can rapidly obtain high-quality optimal solutions that can contain the global optimal solution. The scalability of the proposed methodology is promising.

  13. Optimization methods in structural design

    CERN Document Server

    Rothwell, Alan

    2017-01-01

    This book offers an introduction to numerical optimization methods in structural design. Employing a readily accessible and compact format, the book presents an overview of optimization methods, and equips readers to properly set up optimization problems and interpret the results. A ‘how-to-do-it’ approach is followed throughout, with less emphasis at this stage on mathematical derivations. The book features spreadsheet programs provided in Microsoft Excel, which allow readers to experience optimization ‘hands-on.’ Examples covered include truss structures, columns, beams, reinforced shell structures, stiffened panels and composite laminates. For the last three, a review of relevant analysis methods is included. Exercises, with solutions where appropriate, are also included with each chapter. The book offers a valuable resource for engineering students at the upper undergraduate and postgraduate level, as well as others in the industry and elsewhere who are new to these highly practical techniques.Whi...

  14. Solving Unconstrained Global Optimization Problems via Hybrid Swarm Intelligence Approaches

    Directory of Open Access Journals (Sweden)

    Jui-Yu Wu

    2013-01-01

    Full Text Available Stochastic global optimization (SGO algorithms such as the particle swarm optimization (PSO approach have become popular for solving unconstrained global optimization (UGO problems. The PSO approach, which belongs to the swarm intelligence domain, does not require gradient information, enabling it to overcome this limitation of traditional nonlinear programming methods. Unfortunately, PSO algorithm implementation and performance depend on several parameters, such as cognitive parameter, social parameter, and constriction coefficient. These parameters are tuned by using trial and error. To reduce the parametrization of a PSO method, this work presents two efficient hybrid SGO approaches, namely, a real-coded genetic algorithm-based PSO (RGA-PSO method and an artificial immune algorithm-based PSO (AIA-PSO method. The specific parameters of the internal PSO algorithm are optimized using the external RGA and AIA approaches, and then the internal PSO algorithm is applied to solve UGO problems. The performances of the proposed RGA-PSO and AIA-PSO algorithms are then evaluated using a set of benchmark UGO problems. Numerical results indicate that, besides their ability to converge to a global minimum for each test UGO problem, the proposed RGA-PSO and AIA-PSO algorithms outperform many hybrid SGO algorithms. Thus, the RGA-PSO and AIA-PSO approaches can be considered alternative SGO approaches for solving standard-dimensional UGO problems.

  15. Global-local optimization of flapping kinematics in hovering flight

    KAUST Repository

    Ghommem, Mehdi

    2013-06-01

    The kinematics of a hovering wing are optimized by combining the 2-d unsteady vortex lattice method with a hybrid of global and local optimization algorithms. The objective is to minimize the required aerodynamic power under a lift constraint. The hybrid optimization is used to efficiently navigate the complex design space due to wing-wake interference present in hovering aerodynamics. The flapping wing is chosen so that its chord length and flapping frequency match the morphological and flight properties of two insects with different masses. The results suggest that imposing a delay between the different oscillatory motions defining the flapping kinematics, and controlling the way through which the wing rotates at the end of each half stroke can improve aerodynamic power under a lift constraint. Furthermore, our optimization analysis identified optimal kinematics that agree fairly well with observed insect kinematics, as well as previously published numerical results.

  16. Global Optimization using Interval Analysis : Interval Optimization for Aerospace Applications

    NARCIS (Netherlands)

    Van Kampen, E.

    2010-01-01

    Optimization is an important element in aerospace related research. It is encountered for example in trajectory optimization problems, such as: satellite formation flying, spacecraft re-entry optimization and airport approach and departure optimization; in control optimization, for example in

  17. A Novel Hybrid Firefly Algorithm for Global Optimization.

    Science.gov (United States)

    Zhang, Lina; Liu, Liqiang; Yang, Xin-She; Dai, Yuntao

    Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate.

  18. Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem

    Directory of Open Access Journals (Sweden)

    Xiaomei Zhang

    2012-01-01

    Full Text Available We present some sufficient global optimality conditions for a special cubic minimization problem with box constraints or binary constraints by extending the global subdifferential approach proposed by V. Jeyakumar et al. (2006. The present conditions generalize the results developed in the work of V. Jeyakumar et al. where a quadratic minimization problem with box constraints or binary constraints was considered. In addition, a special diagonal matrix is constructed, which is used to provide a convenient method for justifying the proposed sufficient conditions. Then, the reformulation of the sufficient conditions follows. It is worth noting that this reformulation is also applicable to the quadratic minimization problem with box or binary constraints considered in the works of V. Jeyakumar et al. (2006 and Y. Wang et al. (2010. Finally some examples demonstrate that our optimality conditions can effectively be used for identifying global minimizers of the certain nonconvex cubic minimization problem.

  19. Evolutionary optimization methods for accelerator design

    Science.gov (United States)

    Poklonskiy, Alexey A.

    Many problems from the fields of accelerator physics and beam theory can be formulated as optimization problems and, as such, solved using optimization methods. Despite growing efficiency of the optimization methods, the adoption of modern optimization techniques in these fields is rather limited. Evolutionary Algorithms (EAs) form a relatively new and actively developed optimization methods family. They possess many attractive features such as: ease of the implementation, modest requirements on the objective function, a good tolerance to noise, robustness, and the ability to perform a global search efficiently. In this work we study the application of EAs to problems from accelerator physics and beam theory. We review the most commonly used methods of unconstrained optimization and describe the GATool, evolutionary algorithm and the software package, used in this work, in detail. Then we use a set of test problems to assess its performance in terms of computational resources, quality of the obtained result, and the tradeoff between them. We justify the choice of GATool as a heuristic method to generate cutoff values for the COSY-GO rigorous global optimization package for the COSY Infinity scientific computing package. We design the model of their mutual interaction and demonstrate that the quality of the result obtained by GATool increases as the information about the search domain is refined, which supports the usefulness of this model. We Giscuss GATool's performance on the problems suffering from static and dynamic noise and study useful strategies of GATool parameter tuning for these and other difficult problems. We review the challenges of constrained optimization with EAs and methods commonly used to overcome them. We describe REPA, a new constrained optimization method based on repairing, in exquisite detail, including the properties of its two repairing techniques: REFIND and REPROPT. We assess REPROPT's performance on the standard constrained

  20. Global Optimization of Nonlinear Blend-Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Pedro A. Castillo Castillo

    2017-04-01

    Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

  1. An Algorithm for Global Optimization Inspired by Collective Animal Behavior

    Directory of Open Access Journals (Sweden)

    Erik Cuevas

    2012-01-01

    Full Text Available A metaheuristic algorithm for global optimization called the collective animal behavior (CAB is introduced. Animal groups, such as schools of fish, flocks of birds, swarms of locusts, and herds of wildebeest, exhibit a variety of behaviors including swarming about a food source, milling around a central locations, or migrating over large distances in aligned groups. These collective behaviors are often advantageous to groups, allowing them to increase their harvesting efficiency, to follow better migration routes, to improve their aerodynamic, and to avoid predation. In the proposed algorithm, the searcher agents emulate a group of animals which interact with each other based on the biological laws of collective motion. The proposed method has been compared to other well-known optimization algorithms. The results show good performance of the proposed method when searching for a global optimum of several benchmark functions.

  2. Modified Grey Wolf Optimizer for Global Engineering Optimization

    Directory of Open Access Journals (Sweden)

    Nitin Mittal

    2016-01-01

    Full Text Available Nature-inspired algorithms are becoming popular among researchers due to their simplicity and flexibility. The nature-inspired metaheuristic algorithms are analysed in terms of their key features like their diversity and adaptation, exploration and exploitation, and attractions and diffusion mechanisms. The success and challenges concerning these algorithms are based on their parameter tuning and parameter control. A comparatively new algorithm motivated by the social hierarchy and hunting behavior of grey wolves is Grey Wolf Optimizer (GWO, which is a very successful algorithm for solving real mechanical and optical engineering problems. In the original GWO, half of the iterations are devoted to exploration and the other half are dedicated to exploitation, overlooking the impact of right balance between these two to guarantee an accurate approximation of global optimum. To overcome this shortcoming, a modified GWO (mGWO is proposed, which focuses on proper balance between exploration and exploitation that leads to an optimal performance of the algorithm. Simulations based on benchmark problems and WSN clustering problem demonstrate the effectiveness, efficiency, and stability of mGWO compared with the basic GWO and some well-known algorithms.

  3. Optimization of Medical Teaching Methods

    Directory of Open Access Journals (Sweden)

    Wang Fei

    2015-12-01

    Full Text Available In order to achieve the goal of medical education, medicine and adapt to changes in the way doctors work, with the rapid medical teaching methods of modern science and technology must be reformed. Based on the current status of teaching in medical colleges method to analyze the formation and development of medical teaching methods, characteristics, about how to achieve optimal medical teaching methods for medical education teachers and management workers comprehensive and thorough change teaching ideas and teaching concepts provide a theoretical basis.

  4. Distributed optimization system and method

    Science.gov (United States)

    Hurtado, John E.; Dohrmann, Clark R.; Robinett, III, Rush D.

    2003-06-10

    A search system and method for controlling multiple agents to optimize an objective using distributed sensing and cooperative control. The search agent can be one or more physical agents, such as a robot, and can be software agents for searching cyberspace. The objective can be: chemical sources, temperature sources, radiation sources, light sources, evaders, trespassers, explosive sources, time dependent sources, time independent sources, function surfaces, maximization points, minimization points, and optimal control of a system such as a communication system, an economy, a crane, and a multi-processor computer.

  5. Optimal control linear quadratic methods

    CERN Document Server

    Anderson, Brian D O

    2007-01-01

    This augmented edition of a respected text teaches the reader how to use linear quadratic Gaussian methods effectively for the design of control systems. It explores linear optimal control theory from an engineering viewpoint, with step-by-step explanations that show clearly how to make practical use of the material.The three-part treatment begins with the basic theory of the linear regulator/tracker for time-invariant and time-varying systems. The Hamilton-Jacobi equation is introduced using the Principle of Optimality, and the infinite-time problem is considered. The second part outlines the

  6. Global optimization framework for solar building design

    Science.gov (United States)

    Silva, N.; Alves, N.; Pascoal-Faria, P.

    2017-07-01

    The generative modeling paradigm is a shift from static models to flexible models. It describes a modeling process using functions, methods and operators. The result is an algorithmic description of the construction process. Each evaluation of such an algorithm creates a model instance, which depends on its input parameters (width, height, volume, roof angle, orientation, location). These values are normally chosen according to aesthetic aspects and style. In this study, the model's parameters are automatically generated according to an objective function. A generative model can be optimized according to its parameters, in this way, the best solution for a constrained problem is determined. Besides the establishment of an overall framework design, this work consists on the identification of different building shapes and their main parameters, the creation of an algorithmic description for these main shapes and the formulation of the objective function, respecting a building's energy consumption (solar energy, heating and insulation). Additionally, the conception of an optimization pipeline, combining an energy calculation tool with a geometric scripting engine is presented. The methods developed leads to an automated and optimized 3D shape generation for the projected building (based on the desired conditions and according to specific constrains). The approach proposed will help in the construction of real buildings that account for less energy consumption and for a more sustainable world.

  7. Path optimization method for the sign problem

    Directory of Open Access Journals (Sweden)

    Ohnishi Akira

    2018-01-01

    Full Text Available We propose a path optimization method (POM to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t(f ϵ R and by optimizing f(t to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

  8. Flows method in global analysis

    International Nuclear Information System (INIS)

    Duong Minh Duc.

    1994-12-01

    We study the gradient flows method for W r,p (M,N) where M and N are Riemannian manifold and r may be less than m/p. We localize some global analysis problem by constructing gradient flows which only change the value of any u in W r,p (M,N) in a local chart of M. (author). 24 refs

  9. Joint global optimization of tomographic data based on particle swarm optimization and decision theory

    Science.gov (United States)

    Paasche, H.; Tronicke, J.

    2012-04-01

    In many near surface geophysical applications multiple tomographic data sets are routinely acquired to explore subsurface structures and parameters. Linking the model generation process of multi-method geophysical data sets can significantly reduce ambiguities in geophysical data analysis and model interpretation. Most geophysical inversion approaches rely on local search optimization methods used to find an optimal model in the vicinity of a user-given starting model. The final solution may critically depend on the initial model. Alternatively, global optimization (GO) methods have been used to invert geophysical data. They explore the solution space in more detail and determine the optimal model independently from the starting model. Additionally, they can be used to find sets of optimal models allowing a further analysis of model parameter uncertainties. Here we employ particle swarm optimization (PSO) to realize the global optimization of tomographic data. PSO is an emergent methods based on swarm intelligence characterized by fast and robust convergence towards optimal solutions. The fundamental principle of PSO is inspired by nature, since the algorithm mimics the behavior of a flock of birds searching food in a search space. In PSO, a number of particles cruise a multi-dimensional solution space striving to find optimal model solutions explaining the acquired data. The particles communicate their positions and success and direct their movement according to the position of the currently most successful particle of the swarm. The success of a particle, i.e. the quality of the currently found model by a particle, must be uniquely quantifiable to identify the swarm leader. When jointly inverting disparate data sets, the optimization solution has to satisfy multiple optimization objectives, at least one for each data set. Unique determination of the most successful particle currently leading the swarm is not possible. Instead, only statements about the Pareto

  10. Selecting the optimal method to calculate daily global reference potential evaporation from CFSR reanalysis data for application in a hydrological model study

    Directory of Open Access Journals (Sweden)

    F. C. Sperna Weiland

    2012-03-01

    Full Text Available Potential evaporation (PET is one of the main inputs of hydrological models. Yet, there is limited consensus on which PET equation is most applicable in hydrological climate impact assessments. In this study six different methods to derive global scale reference PET daily time series from Climate Forecast System Reanalysis (CFSR data are compared: Penman-Monteith, Priestley-Taylor and original and re-calibrated versions of the Hargreaves and Blaney-Criddle method. The calculated PET time series are (1 evaluated against global monthly Penman-Monteith PET time series calculated from CRU data and (2 tested on their usability for modeling of global discharge cycles.

    A major finding is that for part of the investigated basins the selection of a PET method may have only a minor influence on the resulting river flow. Within the hydrological model used in this study the bias related to the PET method tends to decrease while going from PET, AET and runoff to discharge calculations. However, the performance of individual PET methods appears to be spatially variable, which stresses the necessity to select the most accurate and spatially stable PET method. The lowest root mean squared differences and the least significant deviations (95% significance level between monthly CFSR derived PET time series and CRU derived PET were obtained for a cell-specific re-calibrated Blaney-Criddle equation. However, results show that this re-calibrated form is likely to be unstable under changing climate conditions and less reliable for the calculation of daily time series. Although often recommended, the Penman-Monteith equation applied to the CFSR data did not outperform the other methods in a evaluation against PET derived with the Penman-Monteith equation from CRU data. In arid regions (e.g. Sahara, central Australia, US deserts, the equation resulted in relatively low PET values and, consequently, led to relatively high discharge values for dry basins (e

  11. A global optimization approach to multi-polarity sentiment analysis.

    Science.gov (United States)

    Li, Xinmiao; Li, Jing; Wu, Yukeng

    2015-01-01

    Following the rapid development of social media, sentiment analysis has become an important social media mining technique. The performance of automatic sentiment analysis primarily depends on feature selection and sentiment classification. While information gain (IG) and support vector machines (SVM) are two important techniques, few studies have optimized both approaches in sentiment analysis. The effectiveness of applying a global optimization approach to sentiment analysis remains unclear. We propose a global optimization-based sentiment analysis (PSOGO-Senti) approach to improve sentiment analysis with IG for feature selection and SVM as the learning engine. The PSOGO-Senti approach utilizes a particle swarm optimization algorithm to obtain a global optimal combination of feature dimensions and parameters in the SVM. We evaluate the PSOGO-Senti model on two datasets from different fields. The experimental results showed that the PSOGO-Senti model can improve binary and multi-polarity Chinese sentiment analysis. We compared the optimal feature subset selected by PSOGO-Senti with the features in the sentiment dictionary. The results of this comparison indicated that PSOGO-Senti can effectively remove redundant and noisy features and can select a domain-specific feature subset with a higher-explanatory power for a particular sentiment analysis task. The experimental results showed that the PSOGO-Senti approach is effective and robust for sentiment analysis tasks in different domains. By comparing the improvements of two-polarity, three-polarity and five-polarity sentiment analysis results, we found that the five-polarity sentiment analysis delivered the largest improvement. The improvement of the two-polarity sentiment analysis was the smallest. We conclude that the PSOGO-Senti achieves higher improvement for a more complicated sentiment analysis task. We also compared the results of PSOGO-Senti with those of the genetic algorithm (GA) and grid search method. From

  12. Simulated Annealing-Based Krill Herd Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Gai-Ge Wang

    2013-01-01

    Full Text Available Recently, Gandomi and Alavi proposed a novel swarm intelligent method, called krill herd (KH, for global optimization. To enhance the performance of the KH method, in this paper, a new improved meta-heuristic simulated annealing-based krill herd (SKH method is proposed for optimization tasks. A new krill selecting (KS operator is used to refine krill behavior when updating krill’s position so as to enhance its reliability and robustness dealing with optimization problems. The introduced KS operator involves greedy strategy and accepting few not-so-good solutions with a low probability originally used in simulated annealing (SA. In addition, a kind of elitism scheme is used to save the best individuals in the population in the process of the krill updating. The merits of these improvements are verified by fourteen standard benchmarking functions and experimental results show that, in most cases, the performance of this improved meta-heuristic SKH method is superior to, or at least highly competitive with, the standard KH and other optimization methods.

  13. Global optimization for quantum dynamics of few-fermion systems

    Science.gov (United States)

    Li, Xikun; Pecak, Daniel; Sowiński, Tomasz; Sherson, Jacob; Nielsen, Anne E. B.

    2018-03-01

    Quantum state preparation is vital to quantum computation and quantum information processing tasks. In adiabatic state preparation, the target state is theoretically obtained with nearly perfect fidelity if the control parameter is tuned slowly enough. As this, however, leads to slow dynamics, it is often desirable to be able to carry out processes more rapidly. In this work, we employ two global optimization methods to estimate the quantum speed limit for few-fermion systems confined in a one-dimensional harmonic trap. Such systems can be produced experimentally in a well-controlled manner. We determine the optimized control fields and achieve a reduction in the ramping time of more than a factor of four compared to linear ramping. We also investigate how robust the fidelity is to small variations of the control fields away from the optimized shapes.

  14. Global convergence of multidirectional algorithms for unconstrained optimization in normed spaces

    OpenAIRE

    Gómez, J. A.; Romero, M.

    2005-01-01

    Global convergence theorems for a class of descent methods for unconstrained optimization problems in normed spaces, using multidirectional search, are proved. Exact and inexact search are considered and the results allow to define a globally convergent algoritm for an unconstrained optimal control problem which operates, at each step, on discrete approximations of the original continuous problem.

  15. 3rd World Congress on Global Optimization in Engineering & Science

    CERN Document Server

    Ruan, Ning; Xing, Wenxun; WCGO-III; Advances in Global Optimization

    2015-01-01

    This proceedings volume addresses advances in global optimization—a multidisciplinary research field that deals with the analysis, characterization, and computation of global minima and/or maxima of nonlinear, non-convex, and nonsmooth functions in continuous or discrete forms. The volume contains selected papers from the third biannual World Congress on Global Optimization in Engineering & Science (WCGO), held in the Yellow Mountains, Anhui, China on July 8-12, 2013. The papers fall into eight topical sections: mathematical programming; combinatorial optimization; duality theory; topology optimization; variational inequalities and complementarity problems; numerical optimization; stochastic models and simulation; and complex simulation and supply chain analysis.

  16. 4th International Conference on Frontiers in Global Optimization

    CERN Document Server

    Pardalos, Panos

    2004-01-01

    Global Optimization has emerged as one of the most exciting new areas of mathematical programming. Global optimization has received a wide attraction from many fields in the past few years, due to the success of new algorithms for addressing previously intractable problems from diverse areas such as computational chemistry and biology, biomedicine, structural optimization, computer sciences, operations research, economics, and engineering design and control. This book contains refereed invited papers submitted at the 4th international confer­ ence on Frontiers in Global Optimization held at Santorini, Greece during June 8-12, 2003. Santorini is one of the few sites of Greece, with wild beauty created by the explosion of a volcano which is in the middle of the gulf of the island. The mystic landscape with its numerous mult-extrema, was an inspiring location particularly for researchers working on global optimization. The three previous conferences on "Recent Advances in Global Opti­ mization", "State-of-the-...

  17. Comparison between statistical and optimization methods in accessing unmixing of spectrally similar materials

    CSIR Research Space (South Africa)

    Debba, Pravesh

    2010-11-01

    Full Text Available This paper reports on the results from ordinary least squares and ridge regression as statistical methods, and is compared to numerical optimization methods such as the stochastic method for global optimization, simulated annealing, particle swarm...

  18. New Algorithms for Global Optimization and Reaction Path Determination.

    Science.gov (United States)

    Weber, D; Bellinger, D; Engels, B

    2016-01-01

    We present new schemes to improve the convergence of an important global optimization problem and to determine reaction pathways (RPs) between identified minima. Those methods have been implemented into the CAST program (Conformational Analysis and Search Tool). The first part of this chapter shows how to improve convergence of the Monte Carlo with minimization (MCM, also known as Basin Hopping) method when applied to optimize water clusters or aqueous solvation shells using a simple model. Since the random movement on the potential energy surface (PES) is an integral part of MCM, we propose to employ a hydrogen bonding-based algorithm for its improvement. We show comparisons of the results obtained for random dihedral and for the proposed random, rigid-body water molecule movement, giving evidence that a specific adaption of the distortion process greatly improves the convergence of the method. The second part is about the determination of RPs in clusters between conformational arrangements and for reactions. Besides standard approaches like the nudged elastic band method, we want to focus on a new algorithm developed especially for global reaction path search called Pathopt. We started with argon clusters, a typical benchmark system, which possess a flat PES, then stepwise increase the magnitude and directionality of interactions. Therefore, we calculated pathways for a water cluster and characterize them by frequency calculations. Within our calculations, we were able to show that beneath local pathways also additional pathways can be found which possess additional features. © 2016 Elsevier Inc. All rights reserved.

  19. A Simple But Effective Canonical Dual Theory Unified Algorithm for Global Optimization

    OpenAIRE

    Zhang, Jiapu

    2011-01-01

    Numerical global optimization methods are often very time consuming and could not be applied for high-dimensional nonconvex/nonsmooth optimization problems. Due to the nonconvexity/nonsmoothness, directly solving the primal problems sometimes is very difficult. This paper presents a very simple but very effective canonical duality theory (CDT) unified global optimization algorithm. This algorithm has convergence is proved in this paper. More important, for this CDT-unified algorithm, numerous...

  20. New Heuristics for global optimization of complex bioprocesses

    OpenAIRE

    Egea Larrosa, Jose Alberto

    2008-01-01

    [ENG] Optimization problems arising from the biotechnological and food industries are usually of non-convex nature and they often exhibit several local minima. Even though advances in global optimization research have been outstanding in recent years, the current state-of-the- art is not completely satisfactory, specially when one considers the global optimization of complex process models (typical of biotechnological and food industries). These models are complex due to their dynamic beha...

  1. LDRD Final Report: Global Optimization for Engineering Science Problems

    Energy Technology Data Exchange (ETDEWEB)

    HART,WILLIAM E.

    1999-12-01

    For a wide variety of scientific and engineering problems the desired solution corresponds to an optimal set of objective function parameters, where the objective function measures a solution's quality. The main goal of the LDRD ''Global Optimization for Engineering Science Problems'' was the development of new robust and efficient optimization algorithms that can be used to find globally optimal solutions to complex optimization problems. This SAND report summarizes the technical accomplishments of this LDRD, discusses lessons learned and describes open research issues.

  2. Global stability-based design optimization of truss structures using ...

    Indian Academy of Sciences (India)

    objective optimization; island models; genetic algorithm; arc-length method. ... Furthermore, a pure pareto-ranking based multi-objective optimization model is employed for the design optimization of the truss structure with multiple objectives.

  3. A Review of Design Optimization Methods for Electrical Machines

    Directory of Open Access Journals (Sweden)

    Gang Lei

    2017-11-01

    Full Text Available Electrical machines are the hearts of many appliances, industrial equipment and systems. In the context of global sustainability, they must fulfill various requirements, not only physically and technologically but also environmentally. Therefore, their design optimization process becomes more and more complex as more engineering disciplines/domains and constraints are involved, such as electromagnetics, structural mechanics and heat transfer. This paper aims to present a review of the design optimization methods for electrical machines, including design analysis methods and models, optimization models, algorithms and methods/strategies. Several efficient optimization methods/strategies are highlighted with comments, including surrogate-model based and multi-level optimization methods. In addition, two promising and challenging topics in both academic and industrial communities are discussed, and two novel optimization methods are introduced for advanced design optimization of electrical machines. First, a system-level design optimization method is introduced for the development of advanced electric drive systems. Second, a robust design optimization method based on the design for six-sigma technique is introduced for high-quality manufacturing of electrical machines in production. Meanwhile, a proposal is presented for the development of a robust design optimization service based on industrial big data and cloud computing services. Finally, five future directions are proposed, including smart design optimization method for future intelligent design and production of electrical machines.

  4. Decentralized Control Using Global Optimization (DCGO) (Preprint)

    National Research Council Canada - National Science Library

    Flint, Matthew; Khovanova, Tanya; Curry, Michael

    2007-01-01

    The coordination of a team of distributed air vehicles requires a complex optimization, balancing limited communication bandwidths, non-instantaneous planning times and network delays, while at the...

  5. A global optimization approach to multi-polarity sentiment analysis.

    Directory of Open Access Journals (Sweden)

    Xinmiao Li

    Full Text Available Following the rapid development of social media, sentiment analysis has become an important social media mining technique. The performance of automatic sentiment analysis primarily depends on feature selection and sentiment classification. While information gain (IG and support vector machines (SVM are two important techniques, few studies have optimized both approaches in sentiment analysis. The effectiveness of applying a global optimization approach to sentiment analysis remains unclear. We propose a global optimization-based sentiment analysis (PSOGO-Senti approach to improve sentiment analysis with IG for feature selection and SVM as the learning engine. The PSOGO-Senti approach utilizes a particle swarm optimization algorithm to obtain a global optimal combination of feature dimensions and parameters in the SVM. We evaluate the PSOGO-Senti model on two datasets from different fields. The experimental results showed that the PSOGO-Senti model can improve binary and multi-polarity Chinese sentiment analysis. We compared the optimal feature subset selected by PSOGO-Senti with the features in the sentiment dictionary. The results of this comparison indicated that PSOGO-Senti can effectively remove redundant and noisy features and can select a domain-specific feature subset with a higher-explanatory power for a particular sentiment analysis task. The experimental results showed that the PSOGO-Senti approach is effective and robust for sentiment analysis tasks in different domains. By comparing the improvements of two-polarity, three-polarity and five-polarity sentiment analysis results, we found that the five-polarity sentiment analysis delivered the largest improvement. The improvement of the two-polarity sentiment analysis was the smallest. We conclude that the PSOGO-Senti achieves higher improvement for a more complicated sentiment analysis task. We also compared the results of PSOGO-Senti with those of the genetic algorithm (GA and grid

  6. Theory and Algorithms for Global/Local Design Optimization

    National Research Council Canada - National Science Library

    Watson, Layne T; Guerdal, Zafer; Haftka, Raphael T

    2005-01-01

    The motivating application for this research is the global/local optimal design of composite aircraft structures such as wings and fuselages, but the theory and algorithms are more widely applicable...

  7. A practical globalization of one-shot optimization for optimal design of tokamak divertors

    Energy Technology Data Exchange (ETDEWEB)

    Blommaert, Maarten, E-mail: maarten.blommaert@kuleuven.be [Institute of Energy and Climate Research (IEK-4), FZ Jülich GmbH, D-52425 Jülich (Germany); Dekeyser, Wouter; Baelmans, Martine [KU Leuven, Department of Mechanical Engineering, 3001 Leuven (Belgium); Gauger, Nicolas R. [TU Kaiserslautern, Chair for Scientific Computing, 67663 Kaiserslautern (Germany); Reiter, Detlev [Institute of Energy and Climate Research (IEK-4), FZ Jülich GmbH, D-52425 Jülich (Germany)

    2017-01-01

    In past studies, nested optimization methods were successfully applied to design of the magnetic divertor configuration in nuclear fusion reactors. In this paper, so-called one-shot optimization methods are pursued. Due to convergence issues, a globalization strategy for the one-shot solver is sought. Whereas Griewank introduced a globalization strategy using a doubly augmented Lagrangian function that includes primal and adjoint residuals, its practical usability is limited by the necessity of second order derivatives and expensive line search iterations. In this paper, a practical alternative is offered that avoids these drawbacks by using a regular augmented Lagrangian merit function that penalizes only state residuals. Additionally, robust rank-two Hessian estimation is achieved by adaptation of Powell's damped BFGS update rule. The application of the novel one-shot approach to magnetic divertor design is considered in detail. For this purpose, the approach is adapted to be complementary with practical in parts adjoint sensitivities. Using the globalization strategy, stable convergence of the one-shot approach is achieved.

  8. Global optimization of silicon nanowires for efficient parametric processes

    DEFF Research Database (Denmark)

    Vukovic, Dragana; Xu, Jing; Mørk, Jesper

    2013-01-01

    We present a global optimization of silicon nanowires for parametric single-pump mixing. For the first time, the effect of surface roughness-induced loss is included in the analysis, significantly influencing the optimum waveguide dimensions.......We present a global optimization of silicon nanowires for parametric single-pump mixing. For the first time, the effect of surface roughness-induced loss is included in the analysis, significantly influencing the optimum waveguide dimensions....

  9. Acceleration techniques in the univariate Lipschitz global optimization

    Science.gov (United States)

    Sergeyev, Yaroslav D.; Kvasov, Dmitri E.; Mukhametzhanov, Marat S.; De Franco, Angela

    2016-10-01

    Univariate box-constrained Lipschitz global optimization problems are considered in this contribution. Geometric and information statistical approaches are presented. The novel powerful local tuning and local improvement techniques are described in the contribution as well as the traditional ways to estimate the Lipschitz constant. The advantages of the presented local tuning and local improvement techniques are demonstrated using the operational characteristics approach for comparing deterministic global optimization algorithms on the class of 100 widely used test functions.

  10. Globalized robust optimization for nonlinear uncertain inequalities

    NARCIS (Netherlands)

    Ben-Tal, A.; Brekelmans, Ruud; den Hertog, Dick; Vial, J.P.

    Robust optimization is a methodology that can be applied to problems that are affected by uncertainty in their parameters. The classical robust counterpart of a problem requires the solution to be feasible for all uncertain parameter values in a so-called uncertainty set and offers no guarantees for

  11. Photovoltaic cells, efficiency and optimization | Afolabi | Global ...

    African Journals Online (AJOL)

    Global Journal of Pure and Applied Sciences. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 10, No 3 (2004) >. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register. DOWNLOAD FULL TEXT Open Access ...

  12. Toward solving the sign problem with path optimization method

    Science.gov (United States)

    Mori, Yuto; Kashiwa, Kouji; Ohnishi, Akira

    2017-12-01

    We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost function which represents the seriousness of the sign problem. We call it the path optimization method. In this method, we do not need to solve the gradient flow required in the Lefschetz-thimble method and then the construction of the integration-path contour arrives at the optimization problem where several efficient methods can be applied. In a simple model with a serious sign problem, the path optimization method is demonstrated to work well; the residual sign problem is resolved and precise results can be obtained even in the region where the global sign problem is serious.

  13. Optimizing Global Force Management for Special Operations Forces

    Science.gov (United States)

    2016-12-01

    for Global Force Management. This tool empowers the analyst to conduct timely what-if analysis and easily develop alternate courses of action... Journal of Operational Research , 23(3): 367–381. Bradley, JH (2016) Mission attribute hierarchy, data for mission prioritization and requests, draft...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS Approved for public release. Distribution is unlimited. OPTIMIZING GLOBAL

  14. Global optimality of the successive Maxbet algorithm

    NARCIS (Netherlands)

    Hanafi, M; Ten Berge, J.M.F.

    The Maxbet method is an alternative to the method of generalized canonical correlation analysis and of Procrustes analysis. Contrary to these methods, it does not maximize the inner products (covariances) between linear composites, but also takes their sums of squares (variances) into account. It is

  15. A topological derivative method for topology optimization

    DEFF Research Database (Denmark)

    Norato, J.; Bendsøe, Martin P.; Haber, RB

    2007-01-01

    We propose a fictitious domain method for topology optimization in which a level set of the topological derivative field for the cost function identifies the boundary of the optimal design. We describe a fixed-point iteration scheme that implements this optimality criterion subject to a volumetric...

  16. High-resolution wave-theory-based ultrasound reflection imaging using the split-step fourier and globally optimized fourier finite-difference methods

    Science.gov (United States)

    Huang, Lianjie

    2013-10-29

    Methods for enhancing ultrasonic reflection imaging are taught utilizing a split-step Fourier propagator in which the reconstruction is based on recursive inward continuation of ultrasonic wavefields in the frequency-space and frequency-wave number domains. The inward continuation within each extrapolation interval consists of two steps. In the first step, a phase-shift term is applied to the data in the frequency-wave number domain for propagation in a reference medium. The second step consists of applying another phase-shift term to data in the frequency-space domain to approximately compensate for ultrasonic scattering effects of heterogeneities within the tissue being imaged (e.g., breast tissue). Results from various data input to the method indicate significant improvements are provided in both image quality and resolution.

  17. Biologically inspired optimization methods an introduction

    CERN Document Server

    Wahde, M

    2008-01-01

    The advent of rapid, reliable and cheap computing power over the last decades has transformed many, if not most, fields of science and engineering. The multidisciplinary field of optimization is no exception. First of all, with fast computers, researchers and engineers can apply classical optimization methods to problems of larger and larger size. In addition, however, researchers have developed a host of new optimization algorithms that operate in a rather different way than the classical ones, and that allow practitioners to attack optimization problems where the classical methods are either not applicable or simply too costly (in terms of time and other resources) to apply.This book is intended as a course book for introductory courses in stochastic optimization algorithms (in this book, the terms optimization method and optimization algorithm will be used interchangeably), and it has grown from a set of lectures notes used in courses, taught by the author, at the international master programme Complex Ada...

  18. Improved Chicken Swarm Optimization Method for Reentry Trajectory Optimization

    Directory of Open Access Journals (Sweden)

    Yu Wu

    2018-01-01

    Full Text Available Reentry trajectory optimization has been researched as a popular topic because of its wide applications in both military and civilian use. It is a challenging problem owing to its strong nonlinearity in motion equations and constraints. Besides, it is a high-dimensional optimization problem. In this paper, an improved chicken swarm optimization (ICSO method is proposed considering that the chicken swarm optimization (CSO method is easy to fall into local optimum when solving high-dimensional optimization problem. Firstly, the model used in this study is described, including its characteristic, the nonlinear constraints, and cost function. Then, by introducing the crossover operator, the principles and the advantages of the ICSO algorithm are explained. Finally, the ICSO method solving the reentry trajectory optimization problem is proposed. The control variables are discretized at a set of Chebyshev collocation points, and the angle of attack is set to fit with the flight velocity to make the optimization efficient. Based on those operations, the process of ICSO method is depicted. Experiments are conducted using five algorithms under different indexes, and the superiority of the proposed ICSO algorithm is demonstrated. Another group of experiments are carried out to investigate the influence of hen percentage on the algorithm’s performance.

  19. Hybrid DFP-CG method for solving unconstrained optimization problems

    Science.gov (United States)

    Osman, Wan Farah Hanan Wan; Asrul Hery Ibrahim, Mohd; Mamat, Mustafa

    2017-09-01

    The conjugate gradient (CG) method and quasi-Newton method are both well known method for solving unconstrained optimization method. In this paper, we proposed a new method by combining the search direction between conjugate gradient method and quasi-Newton method based on BFGS-CG method developed by Ibrahim et al. The Davidon-Fletcher-Powell (DFP) update formula is used as an approximation of Hessian for this new hybrid algorithm. Numerical result showed that the new algorithm perform well than the ordinary DFP method and proven to posses both sufficient descent and global convergence properties.

  20. An Improved Teaching-Learning-Based Optimization with the Social Character of PSO for Global Optimization.

    Science.gov (United States)

    Zou, Feng; Chen, Debao; Wang, Jiangtao

    2016-01-01

    An improved teaching-learning-based optimization with combining of the social character of PSO (TLBO-PSO), which is considering the teacher's behavior influence on the students and the mean grade of the class, is proposed in the paper to find the global solutions of function optimization problems. In this method, the teacher phase of TLBO is modified; the new position of the individual is determined by the old position, the mean position, and the best position of current generation. The method overcomes disadvantage that the evolution of the original TLBO might stop when the mean position of students equals the position of the teacher. To decrease the computation cost of the algorithm, the process of removing the duplicate individual in original TLBO is not adopted in the improved algorithm. Moreover, the probability of local convergence of the improved method is decreased by the mutation operator. The effectiveness of the proposed method is tested on some benchmark functions, and the results are competitive with respect to some other methods.

  1. An Improved Teaching-Learning-Based Optimization with the Social Character of PSO for Global Optimization

    Directory of Open Access Journals (Sweden)

    Feng Zou

    2016-01-01

    Full Text Available An improved teaching-learning-based optimization with combining of the social character of PSO (TLBO-PSO, which is considering the teacher’s behavior influence on the students and the mean grade of the class, is proposed in the paper to find the global solutions of function optimization problems. In this method, the teacher phase of TLBO is modified; the new position of the individual is determined by the old position, the mean position, and the best position of current generation. The method overcomes disadvantage that the evolution of the original TLBO might stop when the mean position of students equals the position of the teacher. To decrease the computation cost of the algorithm, the process of removing the duplicate individual in original TLBO is not adopted in the improved algorithm. Moreover, the probability of local convergence of the improved method is decreased by the mutation operator. The effectiveness of the proposed method is tested on some benchmark functions, and the results are competitive with respect to some other methods.

  2. SpaceScanner: COPASI wrapper for automated management of global stochastic optimization experiments.

    Science.gov (United States)

    Elsts, Atis; Pentjuss, Agris; Stalidzans, Egils

    2017-09-15

    Due to their universal applicability, global stochastic optimization methods are popular for designing improvements of biochemical networks. The drawbacks of global stochastic optimization methods are: (i) no guarantee of finding global optima, (ii) no clear optimization run termination criteria and (iii) no criteria to detect stagnation of an optimization run. The impact of these drawbacks can be partly compensated by manual work that becomes inefficient when the solution space is large due to combinatorial explosion of adjustable parameters or for other reasons. SpaceScanner uses parallel optimization runs for automatic termination of optimization tasks in case of consensus and consecutively applies a pre-defined set of global stochastic optimization methods in case of stagnation in the currently used method. Automatic scan of adjustable parameter combination subsets for best objective function values is possible with a summary file of ranked solutions. https://github.com/atiselsts/spacescanner . egils.stalidzans@lu.lv. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

  3. Hybrid intelligent optimization methods for engineering problems

    Science.gov (United States)

    Pehlivanoglu, Yasin Volkan

    quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles.

  4. Meningococcal conjugate vaccines: optimizing global impact

    Directory of Open Access Journals (Sweden)

    Terranella A

    2011-09-01

    Full Text Available Andrew Terranella1,2, Amanda Cohn2, Thomas Clark2 1Epidemic Intelligence Service, Division of Applied Sciences, Scientific Education and Professional Development Program Office, 2Meningitis and Vaccine Preventable Diseases Branch, National Center for Immunization and Respiratory Diseases, Centers for Disease Control and Prevention, Atlanta, GA, USA Abstract: Meningococcal conjugate vaccines have several advantages over polysaccharide vaccines, including the ability to induce greater antibody persistence, avidity, immunologic memory, and herd immunity. Since 1999, meningococcal conjugate vaccine programs have been established across the globe. Many of these vaccination programs have resulted in significant decline in meningococcal disease in several countries. Recent introduction of serogroup A conjugate vaccine in Africa offers the potential to eliminate meningococcal disease as a public health problem in Africa. However, the duration of immune response and the development of widespread herd immunity in the population remain important questions for meningococcal vaccine programs. Because of the unique epidemiology of meningococcal disease around the world, the optimal vaccination strategy for long-term disease prevention will vary by country. Keywords: conjugate vaccine, meningitis, meningococcal vaccine, meningococcal disease

  5. Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

    Science.gov (United States)

    Ng, Hok Kwan; Sridhar, Banavar

    2016-01-01

    This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

  6. Elephant swarm water search algorithm for global optimization

    Indian Academy of Sciences (India)

    S Mandal

    2018-02-07

    Feb 7, 2018 ... Abstract. The rising complexity of real-life optimization problems has constantly inspired computer researchers to develop new efficient optimization methods. Evolutionary computation and metaheuristics based on swarm intelligence are very popular nature-inspired optimization techniques. In this paper ...

  7. Application of surrogate-based global optimization to aerodynamic design

    CERN Document Server

    Pérez, Esther

    2016-01-01

    Aerodynamic design, like many other engineering applications, is increasingly relying on computational power. The growing need for multi-disciplinarity and high fidelity in design optimization for industrial applications requires a huge number of repeated simulations in order to find an optimal design candidate. The main drawback is that each simulation can be computationally expensive – this becomes an even bigger issue when used within parametric studies, automated search or optimization loops, which typically may require thousands of analysis evaluations. The core issue of a design-optimization problem is the search process involved. However, when facing complex problems, the high-dimensionality of the design space and the high-multi-modality of the target functions cannot be tackled with standard techniques. In recent years, global optimization using meta-models has been widely applied to design exploration in order to rapidly investigate the design space and find sub-optimal solutions. Indeed, surrogat...

  8. Practical inventory routing: A problem definition and an optimization method

    OpenAIRE

    Geiger, Martin Josef; Sevaux, Marc

    2011-01-01

    The global objective of this work is to provide practical optimization methods to companies involved in inventory routing problems, taking into account this new type of data. Also, companies are sometimes not able to deal with changing plans every period and would like to adopt regular structures for serving customers.

  9. Global Optimization for Bus Line Timetable Setting Problem

    Directory of Open Access Journals (Sweden)

    Qun Chen

    2014-01-01

    Full Text Available This paper defines bus timetables setting problem during each time period divided in terms of passenger flow intensity; it is supposed that passengers evenly arrive and bus runs are set evenly; the problem is to determine bus runs assignment in each time period to minimize the total waiting time of passengers on platforms if the number of the total runs is known. For such a multistage decision problem, this paper designed a dynamic programming algorithm to solve it. Global optimization procedures using dynamic programming are developed. A numerical example about bus runs assignment optimization of a single line is given to demonstrate the efficiency of the proposed methodology, showing that optimizing buses’ departure time using dynamic programming can save computational time and find the global optimal solution.

  10. Intelligent structural optimization: Concept, Model and Methods

    International Nuclear Information System (INIS)

    Lu, Dagang; Wang, Guangyuan; Peng, Zhang

    2002-01-01

    Structural optimization has many characteristics of Soft Design, and so, it is necessary to apply the experience of human experts to solving the uncertain and multidisciplinary optimization problems in large-scale and complex engineering systems. With the development of artificial intelligence (AI) and computational intelligence (CI), the theory of structural optimization is now developing into the direction of intelligent optimization. In this paper, a concept of Intelligent Structural Optimization (ISO) is proposed. And then, a design process model of ISO is put forward in which each design sub-process model are discussed. Finally, the design methods of ISO are presented

  11. Differential evolution algorithm for global optimizations in nuclear physics

    Science.gov (United States)

    Qi, Chong

    2017-04-01

    We explore the applicability of the differential evolution algorithm in finding the global minima of three typical nuclear structure physics problems: the global deformation minimum in the nuclear potential energy surface, the optimization of mass model parameters and the lowest eigenvalue of a nuclear Hamiltonian. The algorithm works very effectively and efficiently in identifying the minima in all problems we have tested. We also show that the algorithm can be parallelized in a straightforward way.

  12. Global, Multi-Objective Trajectory Optimization With Parametric Spreading

    Science.gov (United States)

    Vavrina, Matthew A.; Englander, Jacob A.; Phillips, Sean M.; Hughes, Kyle M.

    2017-01-01

    Mission design problems are often characterized by multiple, competing trajectory optimization objectives. Recent multi-objective trajectory optimization formulations enable generation of globally-optimal, Pareto solutions via a multi-objective genetic algorithm. A byproduct of these formulations is that clustering in design space can occur in evolving the population towards the Pareto front. This clustering can be a drawback, however, if parametric evaluations of design variables are desired. This effort addresses clustering by incorporating operators that encourage a uniform spread over specified design variables while maintaining Pareto front representation. The algorithm is demonstrated on a Neptune orbiter mission, and enhanced multidimensional visualization strategies are presented.

  13. On the Investigation of Stochastic Global Optimization Algorithms

    NARCIS (Netherlands)

    Baritompa, B.; Hendrix, E.M.T.

    2005-01-01

    This discussion paper for the SGO 2001 Workshop considers the process of investigating stochastic global optimization algorithms. It outlines a general plan for the systematic study of their behavior. It raises questions about performance criteria, characteristics of test cases and classification of

  14. Dispositional Optimism and Terminal Decline in Global Quality of Life

    Science.gov (United States)

    Zaslavsky, Oleg; Palgi, Yuval; Rillamas-Sun, Eileen; LaCroix, Andrea Z.; Schnall, Eliezer; Woods, Nancy F.; Cochrane, Barbara B.; Garcia, Lorena; Hingle, Melanie; Post, Stephen; Seguin, Rebecca; Tindle, Hilary; Shrira, Amit

    2015-01-01

    We examined whether dispositional optimism relates to change in global quality of life (QOL) as a function of either chronological age or years to impending death. We used a sample of 2,096 deceased postmenopausal women from the Women's Health Initiative clinical trials who were enrolled in the 2005-2010 Extension Study and for whom at least 1…

  15. Expected improvement in efficient global optimization through bootstrapped kriging

    NARCIS (Netherlands)

    Kleijnen, Jack P.C.; van Beers, W.C.M.; van Nieuwenhuyse, I.

    2012-01-01

    This article uses a sequentialized experimental design to select simulation input combinations for global optimization, based on Kriging (also called Gaussian process or spatial correlation modeling); this Kriging is used to analyze the input/output data of the simulation model (computer code). This

  16. A Neurodynamic Approach to Distributed Optimization With Globally Coupled Constraints.

    Science.gov (United States)

    Le, Xinyi; Chen, Sijie; Yan, Zheng; Xi, Juntong

    2017-10-18

    In this paper, a distributed neurodynamic approach is proposed for constrained convex optimization. The objective function is a sum of local convex subproblems, whereas the constraints of these subproblems are coupled. Each local objective function is minimized individually with the proposed neurodynamic optimization approach. Through information exchange between connected neighbors only, all nodes can reach consensus on the Lagrange multipliers of all global equality and inequality constraints, and the decision variables converge to the global optimum in a distributed manner. Simulation results of two power system cases are discussed to substantiate the effectiveness and characteristics of the proposed approach.In this paper, a distributed neurodynamic approach is proposed for constrained convex optimization. The objective function is a sum of local convex subproblems, whereas the constraints of these subproblems are coupled. Each local objective function is minimized individually with the proposed neurodynamic optimization approach. Through information exchange between connected neighbors only, all nodes can reach consensus on the Lagrange multipliers of all global equality and inequality constraints, and the decision variables converge to the global optimum in a distributed manner. Simulation results of two power system cases are discussed to substantiate the effectiveness and characteristics of the proposed approach.

  17. Global Local Structural Optimization of Transportation Aircraft Wings

    NARCIS (Netherlands)

    Ciampa, P.D.; Nagel, B.; Van Tooren, M.J.L.

    2010-01-01

    The study presents a multilevel optimization methodology for the preliminary structural design of transportation aircraft wings. A global level is defined by taking into account the primary wing structural components (i.e., ribs, spars and skin) which are explicitly modeled by shell layered finite

  18. OPTIMIZATION METHODS IN TRANSPORTATION OF FOREST PRODUCTS

    Directory of Open Access Journals (Sweden)

    Selçuk Gümüş

    2008-04-01

    Full Text Available Turkey has total of 21.2 million ha (27 % forest land. In this area, average 9 million m3 of logs and 5 million stere of fuel wood have been annually produced by the government forest enterprises. The total annual production is approximately 13million m3 Considering the fact that the costs of transporting forest products was about . 160 million TL in the year of 2006, the importance of optimizing the total costs in transportation can be better understood. Today, there is not common optimization method used at whole transportation problems. However, the decision makers select the most appropriate methods according to their aims.Comprehending of features and capacity of optimization methods is important for selecting of the most appropriate method. The evaluation of optimization methods that can be used at forest products transportation is aimed in this study.

  19. Engineering applications of heuristic multilevel optimization methods

    Science.gov (United States)

    Barthelemy, Jean-Francois M.

    1989-01-01

    Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.

  20. An evolutionary algorithm for global optimization based on self-organizing maps

    Science.gov (United States)

    Barmada, Sami; Raugi, Marco; Tucci, Mauro

    2016-10-01

    In this article, a new population-based algorithm for real-parameter global optimization is presented, which is denoted as self-organizing centroids optimization (SOC-opt). The proposed method uses a stochastic approach which is based on the sequential learning paradigm for self-organizing maps (SOMs). A modified version of the SOM is proposed where each cell contains an individual, which performs a search for a locally optimal solution and it is affected by the search for a global optimum. The movement of the individuals in the search space is based on a discrete-time dynamic filter, and various choices of this filter are possible to obtain different dynamics of the centroids. In this way, a general framework is defined where well-known algorithms represent a particular case. The proposed algorithm is validated through a set of problems, which include non-separable problems, and compared with state-of-the-art algorithms for global optimization.

  1. A DE-Based Scatter Search for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Kun Li

    2015-01-01

    Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.

  2. Hybrid robust predictive optimization method of power system dispatch

    Science.gov (United States)

    Chandra, Ramu Sharat [Niskayuna, NY; Liu, Yan [Ballston Lake, NY; Bose, Sumit [Niskayuna, NY; de Bedout, Juan Manuel [West Glenville, NY

    2011-08-02

    A method of power system dispatch control solves power system dispatch problems by integrating a larger variety of generation, load and storage assets, including without limitation, combined heat and power (CHP) units, renewable generation with forecasting, controllable loads, electric, thermal and water energy storage. The method employs a predictive algorithm to dynamically schedule different assets in order to achieve global optimization and maintain the system normal operation.

  3. Universal Method for Stochastic Composite Optimization Problems

    Science.gov (United States)

    Gasnikov, A. V.; Nesterov, Yu. E.

    2018-01-01

    A fast gradient method requiring only one projection is proposed for smooth convex optimization problems. The method has a visual geometric interpretation, so it is called the method of similar triangles (MST). Composite, adaptive, and universal versions of MST are suggested. Based on MST, a universal method is proposed for the first time for strongly convex problems (this method is continuous with respect to the strong convexity parameter of the smooth part of the functional). It is shown how the universal version of MST can be applied to stochastic optimization problems.

  4. Topology optimization theory, methods, and applications

    CERN Document Server

    Bendsøe, Martin P

    2004-01-01

    The topology optimization method solves the basic engineering problem of distributing a limited amount of material in a design space. The first edition of this book has become the standard text on optimal design which is concerned with the optimization of structural topology, shape and material. This edition has been substantially revised and updated to reflect progress made in modelling and computational procedures. It also encompasses a comprehensive and unified description of the state-of-the-art of the so-called material distribution method, based on the use of mathematical programming and finite elements. Applications treated include not only structures but also MEMS and materials.

  5. Neoliberal Optimism: Applying Market Techniques to Global Health.

    Science.gov (United States)

    Mei, Yuyang

    2017-01-01

    Global health and neoliberalism are becoming increasingly intertwined as organizations utilize markets and profit motives to solve the traditional problems of poverty and population health. I use field work conducted over 14 months in a global health technology company to explore how the promise of neoliberalism re-envisions humanitarian efforts. In this company's vaccine refrigerator project, staff members expect their investors and their market to allow them to achieve scale and develop accountability to their users in developing countries. However, the translation of neoliberal techniques to the global health sphere falls short of the ideal, as profits are meager and purchasing power remains with donor organizations. The continued optimism in market principles amidst such a non-ideal market reveals the tenacious ideological commitment to neoliberalism in these global health projects.

  6. Numerical methods for optimal control problems with state constraints

    CERN Document Server

    Pytlak, Radosław

    1999-01-01

    While optimality conditions for optimal control problems with state constraints have been extensively investigated in the literature the results pertaining to numerical methods are relatively scarce. This book fills the gap by providing a family of new methods. Among others, a novel convergence analysis of optimal control algorithms is introduced. The analysis refers to the topology of relaxed controls only to a limited degree and makes little use of Lagrange multipliers corresponding to state constraints. This approach enables the author to provide global convergence analysis of first order and superlinearly convergent second order methods. Further, the implementation aspects of the methods developed in the book are presented and discussed. The results concerning ordinary differential equations are then extended to control problems described by differential-algebraic equations in a comprehensive way for the first time in the literature.

  7. Global Optimization strategies for two-mode clustering

    NARCIS (Netherlands)

    J.M. van Rosmalen (Joost); P.J.F. Groenen (Patrick); J. Trejos (Javier); W. Castilli

    2005-01-01

    textabstractTwo-mode clustering is a relatively new form of clustering that clusters both rows and columns of a data matrix. To do so, a criterion similar to k-means is optimized. However, it is still unclear which optimization method should be used to perform two-mode clustering, as various

  8. Automatic Construction and Global Optimization of a Multisentiment Lexicon

    Directory of Open Access Journals (Sweden)

    Xiaoping Yang

    2016-01-01

    Full Text Available Manual annotation of sentiment lexicons costs too much labor and time, and it is also difficult to get accurate quantification of emotional intensity. Besides, the excessive emphasis on one specific field has greatly limited the applicability of domain sentiment lexicons (Wang et al., 2010. This paper implements statistical training for large-scale Chinese corpus through neural network language model and proposes an automatic method of constructing a multidimensional sentiment lexicon based on constraints of coordinate offset. In order to distinguish the sentiment polarities of those words which may express either positive or negative meanings in different contexts, we further present a sentiment disambiguation algorithm to increase the flexibility of our lexicon. Lastly, we present a global optimization framework that provides a unified way to combine several human-annotated resources for learning our 10-dimensional sentiment lexicon SentiRuc. Experiments show the superior performance of SentiRuc lexicon in category labeling test, intensity labeling test, and sentiment classification tasks. It is worth mentioning that, in intensity label test, SentiRuc outperforms the second place by 21 percent.

  9. Optimization and performance of bifacial solar modules: A global perspective

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Xingshu; Khan, Mohammad Ryyan; Deline, Chris; Alam, Muhammad Ashraful

    2018-02-01

    With the rapidly growing interest in bifacial photovoltaics (PV), a worldwide map of their potential performance can help assess and accelerate the global deployment of this emerging technology. However, the existing literature only highlights optimized bifacial PV for a few geographic locations or develops worldwide performance maps for very specific configurations, such as the vertical installation. It is still difficult to translate these location- and configuration-specific conclusions to a general optimized performance of this technology. In this paper, we present a global study and optimization of bifacial solar modules using a rigorous and comprehensive modeling framework. Our results demonstrate that with a low albedo of 0.25, the bifacial gain of ground-mounted bifacial modules is less than 10% worldwide. However, increasing the albedo to 0.5 and elevating modules 1 m above the ground can boost the bifacial gain to 30%. Moreover, we derive a set of empirical design rules, which optimize bifacial solar modules across the world and provide the groundwork for rapid assessment of the location-specific performance. We find that ground-mounted, vertical, east-west-facing bifacial modules will outperform their south-north-facing, optimally tilted counterparts by up to 15% below the latitude of 30 degrees, for an albedo of 0.5. The relative energy output is reversed in latitudes above 30 degrees. A detailed and systematic comparison with data from Asia, Africa, Europe, and North America validates the model presented in this paper.

  10. Topology optimization using the finite volume method

    DEFF Research Database (Denmark)

    Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, see......, e.g. [2]) in order to develop methods for topology design for applications where conservation laws are critical such that element--wise conservation in the discretized models has a high priority. This encompasses problems involving for example mass and heat transport. The work described...... in this presentation is focused on a prototype model for topology optimization of steady heat diffusion. This allows for a study of the basic ingredients in working with FVM methods when dealing with topology optimization problems. The FVM and FEM based formulations differ both in how one computes the design...

  11. Setting value optimization method in integration for relay protection based on improved quantum particle swarm optimization algorithm

    Science.gov (United States)

    Yang, Guo Sheng; Wang, Xiao Yang; Li, Xue Dong

    2018-03-01

    With the establishment of the integrated model of relay protection and the scale of the power system expanding, the global setting and optimization of relay protection is an extremely difficult task. This paper presents a kind of application in relay protection of global optimization improved particle swarm optimization algorithm and the inverse time current protection as an example, selecting reliability of the relay protection, selectivity, quick action and flexibility as the four requires to establish the optimization targets, and optimizing protection setting values of the whole system. Finally, in the case of actual power system, the optimized setting value results of the proposed method in this paper are compared with the particle swarm algorithm. The results show that the improved quantum particle swarm optimization algorithm has strong search ability, good robustness, and it is suitable for optimizing setting value in the relay protection of the whole power system.

  12. A deterministic global optimization using smooth diagonal auxiliary functions

    Science.gov (United States)

    Sergeyev, Yaroslav D.; Kvasov, Dmitri E.

    2015-04-01

    In many practical decision-making problems it happens that functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. In this paper, a global optimization problem is considered where both the goal function f (x) and its gradient f‧ (x) are black-box functions. It is supposed that f‧ (x) satisfies the Lipschitz condition over the search hyperinterval with an unknown Lipschitz constant K. A new deterministic 'Divide-the-Best' algorithm based on efficient diagonal partitions and smooth auxiliary functions is proposed in its basic version, its convergence conditions are studied and numerical experiments executed on eight hundred test functions are presented.

  13. Global Binary Optimization on Graphs for Classification of High-Dimensional Data

    OpenAIRE

    Merkurjev, E; Bae, E; Bertozzi, AL; Tai, XC

    2015-01-01

    © 2015, Springer Science+Business Media New York. This work develops a global minimization framework for segmentation of high-dimensional data into two classes. It combines recent convex optimization methods from imaging with recent graph- based variational models for data segmentation. Two convex splitting algorithms are proposed, where graph-based PDE techniques are used to solve some of the subproblems. It is shown that global minimizers can be guaranteed for semi-supervised segmentation w...

  14. Global Optimization of Self Avoiding Random Walks using ...

    African Journals Online (AJOL)

    SARW) and evaluation of the simulated annealing (SA) optimization method in solving the Feyman problem which is an application of self ad voiding random walks. From the results of simulation, graphs of the shortest path among N randomly ...

  15. Elite Opposition-Based Water Wave Optimization Algorithm for Global Optimization

    OpenAIRE

    Wu, Xiuli; Zhou, Yongquan; Lu, Yuting

    2017-01-01

    Water wave optimization (WWO) is a novel metaheuristic method that is based on shallow water wave theory, which has simple structure, easy realization, and good performance even with a small population. To improve the convergence speed and calculation precision even further, this paper on elite opposition-based strategy water wave optimization (EOBWWO) is proposed, and it has been applied for function optimization and structure engineering design problems. There are three major optimization s...

  16. Truss topology optimization with discrete design variables — Guaranteed global optimality and benchmark examples

    DEFF Research Database (Denmark)

    Achtziger, Wolfgang; Stolpe, Mathias

    2007-01-01

    objective function values are calculated by treating a sequence of continuous but non-convex relaxations of the original mixed-integer problem. The main effect of using this approach lies in the fact that these relaxed problems can be equivalently reformulated as convex problems and, thus, can be solved...... to global optimality. In addition, these convex problems can be further relaxed to quadratic programs for which very efficient numerical solution procedures exist. By exploiting this special problem structure, much larger problem instances can be solved to global optimality compared to similar mixed...

  17. Topology optimization using the finite volume method

    DEFF Research Database (Denmark)

    Gersborg-Hansen, Allan; Bendsøe, Martin P.; Sigmund, Ole

    2005-01-01

    Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, s......: the Finite Volume Method. London: Longman Scientific Technical......Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, see......, e.g. [2]) in order to develop methods for topology design for applications where conservation laws are critical such that element--wise conservation in the discretized models has a high priority. This encompasses problems involving for example mass and heat transport. The work described...

  18. A Novel Optimal Control Method for Impulsive-Correction Projectile Based on Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Ruisheng Sun

    2016-01-01

    Full Text Available This paper presents a new parametric optimization approach based on a modified particle swarm optimization (PSO to design a class of impulsive-correction projectiles with discrete, flexible-time interval, and finite-energy control. In terms of optimal control theory, the task is described as the formulation of minimum working number of impulses and minimum control error, which involves reference model linearization, boundary conditions, and discontinuous objective function. These result in difficulties in finding the global optimum solution by directly utilizing any other optimization approaches, for example, Hp-adaptive pseudospectral method. Consequently, PSO mechanism is employed for optimal setting of impulsive control by considering the time intervals between two neighboring lateral impulses as design variables, which makes the briefness of the optimization process. A modification on basic PSO algorithm is developed to improve the convergence speed of this optimization through linearly decreasing the inertial weight. In addition, a suboptimal control and guidance law based on PSO technique are put forward for the real-time consideration of the online design in practice. Finally, a simulation case coupled with a nonlinear flight dynamic model is applied to validate the modified PSO control algorithm. The results of comparative study illustrate that the proposed optimal control algorithm has a good performance in obtaining the optimal control efficiently and accurately and provides a reference approach to handling such impulsive-correction problem.

  19. A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization

    Directory of Open Access Journals (Sweden)

    Zhijun Luo

    2014-01-01

    Full Text Available A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.

  20. The optimal homotopy asymptotic method engineering applications

    CERN Document Server

    Marinca, Vasile

    2015-01-01

    This book emphasizes in detail the applicability of the Optimal Homotopy Asymptotic Method to various engineering problems. It is a continuation of the book “Nonlinear Dynamical Systems in Engineering: Some Approximate Approaches”, published at Springer in 2011, and it contains a great amount of practical models from various fields of engineering such as classical and fluid mechanics, thermodynamics, nonlinear oscillations, electrical machines, and so on. The main structure of the book consists of 5 chapters. The first chapter is introductory while the second chapter is devoted to a short history of the development of homotopy methods, including the basic ideas of the Optimal Homotopy Asymptotic Method. The last three chapters, from Chapter 3 to Chapter 5, are introducing three distinct alternatives of the Optimal Homotopy Asymptotic Method with illustrative applications to nonlinear dynamical systems. The third chapter deals with the first alternative of our approach with two iterations. Five application...

  1. Adam: A Method for Stochastic Optimization

    NARCIS (Netherlands)

    Kingma, D.P.; Ba, L.J.

    2015-01-01

    We introduce Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions. The method is straightforward to implement and is based on adaptive estimates of lower-order moments of the gradients. The method is computationally efficient, has little memory

  2. Optimization of breeding methods when introducing multiple ...

    African Journals Online (AJOL)

    Optimization of breeding methods when introducing multiple resistance genes from American to Chinese wheat. JN Qi, X Zhang, C Yin, H Li, F Lin. Abstract. Stripe rust is one of the most destructive diseases of wheat worldwide. Growing resistant cultivars with resistance genes is the most effective method to control this ...

  3. Optimizing How We Teach Research Methods

    Science.gov (United States)

    Cvancara, Kristen E.

    2017-01-01

    Courses: Research Methods (undergraduate or graduate level). Objective: The aim of this exercise is to optimize the ability for students to integrate an understanding of various methodologies across research paradigms within a 15-week semester, including a review of procedural steps and experiential learning activities to practice each method, a…

  4. A method optimization study for atomic absorption ...

    African Journals Online (AJOL)

    A sensitive, reliable and relative fast method has been developed for the determination of total zinc in insulin by atomic absorption spectrophotometer. This designed study was used to optimize the procedures for the existing methods. Spectrograms of both standard and sample solutions of zinc were recorded by measuring ...

  5. Global blending optimization of laminated composites with discrete material candidate selection and thickness variation

    DEFF Research Database (Denmark)

    Sørensen, Søren N.; Stolpe, Mathias

    2015-01-01

    but is, however, convex in the original mixed binary nested form. Convexity is the foremost important property of optimization problems, and the proposed method can guarantee the global or near-global optimal solution; unlike most topology optimization methods. The material selection is limited....... In order to obtain large patchwise material candidate continuity while also accommodating variable laminate thickness, a bi-linear stiffness parameterization was introduced, causing a non-convex problem. In this present work, we introduce an alternative problem formulation that holds identical capabilities...... to a distinct choice among predefined numbers of candidates. The laminate thickness is variable but the number of plies must be integer. We solve the convex mixed binary non-linear programming problem by an outer approximation cutting-plane method augmented with a few heuristics to accelerate the convergence...

  6. A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Leilei Cao

    2016-01-01

    Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

  7. Nonlinear Inertia Weighted Teaching-Learning-Based Optimization for Solving Global Optimization Problem.

    Science.gov (United States)

    Wu, Zong-Sheng; Fu, Wei-Ping; Xue, Ru

    2015-01-01

    Teaching-learning-based optimization (TLBO) algorithm is proposed in recent years that simulates the teaching-learning phenomenon of a classroom to effectively solve global optimization of multidimensional, linear, and nonlinear problems over continuous spaces. In this paper, an improved teaching-learning-based optimization algorithm is presented, which is called nonlinear inertia weighted teaching-learning-based optimization (NIWTLBO) algorithm. This algorithm introduces a nonlinear inertia weighted factor into the basic TLBO to control the memory rate of learners and uses a dynamic inertia weighted factor to replace the original random number in teacher phase and learner phase. The proposed algorithm is tested on a number of benchmark functions, and its performance comparisons are provided against the basic TLBO and some other well-known optimization algorithms. The experiment results show that the proposed algorithm has a faster convergence rate and better performance than the basic TLBO and some other algorithms as well.

  8. A new hybrid optimization method inspired from swarm intelligence: Fuzzy adaptive swallow swarm optimization algorithm (FASSO

    Directory of Open Access Journals (Sweden)

    Mehdi Neshat

    2015-11-01

    Full Text Available In this article, the objective was to present effective and optimal strategies aimed at improving the Swallow Swarm Optimization (SSO method. The SSO is one of the best optimization methods based on swarm intelligence which is inspired by the intelligent behaviors of swallows. It has been able to offer a relatively strong method for solving optimization problems. However, despite its many advantages, the SSO suffers from two shortcomings. Firstly, particles movement speed is not controlled satisfactorily during the search due to the lack of an inertia weight. Secondly, the variables of the acceleration coefficient are not able to strike a balance between the local and the global searches because they are not sufficiently flexible in complex environments. Therefore, the SSO algorithm does not provide adequate results when it searches in functions such as the Step or Quadric function. Hence, the fuzzy adaptive Swallow Swarm Optimization (FASSO method was introduced to deal with these problems. Meanwhile, results enjoy high accuracy which are obtained by using an adaptive inertia weight and through combining two fuzzy logic systems to accurately calculate the acceleration coefficients. High speed of convergence, avoidance from falling into local extremum, and high level of error tolerance are the advantages of proposed method. The FASSO was compared with eleven of the best PSO methods and SSO in 18 benchmark functions. Finally, significant results were obtained.

  9. A kind of balance between exploitation and exploration on kriging for global optimization of expensive functions

    International Nuclear Information System (INIS)

    Dong, Huachao; Song, Baowei; Wang, Peng; Huang, Shuai

    2015-01-01

    In this paper, a novel kriging-based algorithm for global optimization of computationally expensive black-box functions is presented. This algorithm utilizes a multi-start approach to find all of the local optimal values of the surrogate model and performs searches within the neighboring area around these local optimal positions. Compared with traditional surrogate-based global optimization method, this algorithm provides another kind of balance between exploitation and exploration on kriging-based model. In addition, a new search strategy is proposed and coupled into this optimization process. The local search strategy employs a kind of improved 'Minimizing the predictor' method, which dynamically adjusts search direction and radius until finds the optimal value. Furthermore, the global search strategy utilizes the advantage of kriging-based model in predicting unexplored regions to guarantee the reliability of the algorithm. Finally, experiments on 13 test functions with six algorithms are set up and the results show that the proposed algorithm is very promising.

  10. An adaptive metamodel-based global optimization algorithm for black-box type problems

    Science.gov (United States)

    Jie, Haoxiang; Wu, Yizhong; Ding, Jianwan

    2015-11-01

    In this article, an adaptive metamodel-based global optimization (AMGO) algorithm is presented to solve unconstrained black-box problems. In the AMGO algorithm, a type of hybrid model composed of kriging and augmented radial basis function (RBF) is used as the surrogate model. The weight factors of hybrid model are adaptively selected in the optimization process. To balance the local and global search, a sub-optimization problem is constructed during each iteration to determine the new iterative points. As numerical experiments, six standard two-dimensional test functions are selected to show the distributions of iterative points. The AMGO algorithm is also tested on seven well-known benchmark optimization problems and contrasted with three representative metamodel-based optimization methods: efficient global optimization (EGO), GutmannRBF and hybrid and adaptive metamodel (HAM). The test results demonstrate the efficiency and robustness of the proposed method. The AMGO algorithm is finally applied to the structural design of the import and export chamber of a cycloid gear pump, achieving satisfactory results.

  11. State space Newton's method for topology optimization

    DEFF Research Database (Denmark)

    Evgrafov, Anton

    2014-01-01

    We introduce a new algorithm for solving certain classes of topology optimization problems, which enjoys fast local convergence normally achieved by the full space methods while working in a smaller reduced space. The computational complexity of Newton’s direction finding subproblem in the algori......We introduce a new algorithm for solving certain classes of topology optimization problems, which enjoys fast local convergence normally achieved by the full space methods while working in a smaller reduced space. The computational complexity of Newton’s direction finding subproblem...

  12. An introduction to harmony search optimization method

    CERN Document Server

    Wang, Xiaolei; Zenger, Kai

    2014-01-01

    This brief provides a detailed introduction, discussion and bibliographic review of the nature1-inspired optimization algorithm called Harmony Search. It uses a large number of simulation results to demonstrate the advantages of Harmony Search and its variants and also their drawbacks. The authors show how weaknesses can be amended by hybridization with other optimization methods. The Harmony Search Method with Applications will be of value to researchers in computational intelligence in demonstrating the state of the art of research on an algorithm of current interest. It also helps researche

  13. Optimal boarding method for airline passengers

    Energy Technology Data Exchange (ETDEWEB)

    Steffen, Jason H.; /Fermilab

    2008-02-01

    Using a Markov Chain Monte Carlo optimization algorithm and a computer simulation, I find the passenger ordering which minimizes the time required to board the passengers onto an airplane. The model that I employ assumes that the time that a passenger requires to load his or her luggage is the dominant contribution to the time needed to completely fill the aircraft. The optimal boarding strategy may reduce the time required to board and airplane by over a factor of four and possibly more depending upon the dimensions of the aircraft. I explore some features of the optimal boarding method and discuss practical modifications to the optimal. Finally, I mention some of the benefits that could come from implementing an improved passenger boarding scheme.

  14. Global methods for reinforced concrete slabs

    International Nuclear Information System (INIS)

    Hoffmann, A.; Lepareux, M.; Combescure, A.

    1985-08-01

    This paper develops the global method strategy to compute elastoplastic thin shells or beams. It is shown how this methodology can be applied to the case of reinforced concrete structures. Two cases of applications are presented: one static, the other dynamic. The numerical results are compared to experimental data

  15. Global structual optimizations of surface systems with a genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Chuang, Feng-Chuan [Iowa State Univ., Ames, IA (United States)

    2005-01-01

    Global structural optimizations with a genetic algorithm were performed for atomic cluster and surface systems including aluminum atomic clusters, Si magic clusters on the Si(111) 7 x 7 surface, silicon high-index surfaces, and Ag-induced Si(111) reconstructions. First, the global structural optimizations of neutral aluminum clusters Aln algorithm in combination with tight-binding and first-principles calculations were performed to study the structures of magic clusters on the Si(111) 7 x 7 surface. Extensive calculations show that the magic cluster observed in scanning tunneling microscopy (STM) experiments consist of eight Si atoms. Simulated STM images of the Si magic cluster exhibit a ring-like feature similar to STM experiments. Third, a genetic algorithm coupled with a highly optimized empirical potential were used to determine the lowest energy structure of high-index semiconductor surfaces. The lowest energy structures of Si(105) and Si(114) were determined successfully. The results of Si(105) and Si(114) are reported within the framework of highly optimized empirical potential and first-principles calculations. Finally, a genetic algorithm coupled with Si and Ag tight-binding potentials were used to search for Ag-induced Si(111) reconstructions at various Ag and Si coverages. The optimized structural models of √3 x √3, 3 x 1, and 5 x 2 phases were reported using first-principles calculations. A novel model is found to have lower surface energy than the proposed double-honeycomb chained (DHC) model both for Au/Si(111) 5 x 2 and Ag/Si(111) 5 x 2 systems.

  16. Material discovery by combining stochastic surface walking global optimization with a neural network.

    Science.gov (United States)

    Huang, Si-Da; Shang, Cheng; Zhang, Xiao-Jie; Liu, Zhi-Pan

    2017-09-01

    While the underlying potential energy surface (PES) determines the structure and other properties of a material, it has been frustrating to predict new materials from theory even with the advent of supercomputing facilities. The accuracy of the PES and the efficiency of PES sampling are two major bottlenecks, not least because of the great complexity of the material PES. This work introduces a "Global-to-Global" approach for material discovery by combining for the first time a global optimization method with neural network (NN) techniques. The novel global optimization method, named the stochastic surface walking (SSW) method, is carried out massively in parallel for generating a global training data set, the fitting of which by the atom-centered NN produces a multi-dimensional global PES; the subsequent SSW exploration of large systems with the analytical NN PES can provide key information on the thermodynamics and kinetics stability of unknown phases identified from global PESs. We describe in detail the current implementation of the SSW-NN method with particular focuses on the size of the global data set and the simultaneous energy/force/stress NN training procedure. An important functional material, TiO 2 , is utilized as an example to demonstrate the automated global data set generation, the improved NN training procedure and the application in material discovery. Two new TiO 2 porous crystal structures are identified, which have similar thermodynamics stability to the common TiO 2 rutile phase and the kinetics stability for one of them is further proved from SSW pathway sampling. As a general tool for material simulation, the SSW-NN method provides an efficient and predictive platform for large-scale computational material screening.

  17. Adaptive finite element method for shape optimization

    KAUST Repository

    Morin, Pedro

    2012-01-16

    We examine shape optimization problems in the context of inexact sequential quadratic programming. Inexactness is a consequence of using adaptive finite element methods (AFEM) to approximate the state and adjoint equations (via the dual weighted residual method), update the boundary, and compute the geometric functional. We present a novel algorithm that equidistributes the errors due to shape optimization and discretization, thereby leading to coarse resolution in the early stages and fine resolution upon convergence, and thus optimizing the computational effort. We discuss the ability of the algorithm to detect whether or not geometric singularities such as corners are genuine to the problem or simply due to lack of resolution - a new paradigm in adaptivity. © EDP Sciences, SMAI, 2012.

  18. A global optimization algorithm inspired in the behavior of selfish herds.

    Science.gov (United States)

    Fausto, Fernando; Cuevas, Erik; Valdivia, Arturo; González, Adrián

    2017-10-01

    In this paper, a novel swarm optimization algorithm called the Selfish Herd Optimizer (SHO) is proposed for solving global optimization problems. SHO is based on the simulation of the widely observed selfish herd behavior manifested by individuals within a herd of animals subjected to some form of predation risk. In SHO, individuals emulate the predatory interactions between groups of prey and predators by two types of search agents: the members of a selfish herd (the prey) and a pack of hungry predators. Depending on their classification as either a prey or a predator, each individual is conducted by a set of unique evolutionary operators inspired by such prey-predator relationship. These unique traits allow SHO to improve the balance between exploration and exploitation without altering the population size. To illustrate the proficiency and robustness of the proposed method, it is compared to other well-known evolutionary optimization approaches such as Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Differential Evolution (DE), Genetic Algorithms (GA), Crow Search Algorithm (CSA), Dragonfly Algorithm (DA), Moth-flame Optimization Algorithm (MOA) and Sine Cosine Algorithm (SCA). The comparison examines several standard benchmark functions, commonly considered within the literature of evolutionary algorithms. The experimental results show the remarkable performance of our proposed approach against those of the other compared methods, and as such SHO is proven to be an excellent alternative to solve global optimization problems. Copyright © 2017 Elsevier B.V. All rights reserved.

  19. Method for optimizing harvesting of crops

    DEFF Research Database (Denmark)

    2010-01-01

    In order e.g. to optimize harvesting crops of the kind which may be self dried on a field prior to a harvesting step (116, 118), there is disclosed a method of providing a mobile unit (102) for working (114, 116, 118) the field with crops, equipping the mobile unit (102) with crop biomass measuring...

  20. Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

    Science.gov (United States)

    Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei

    2014-04-01

    Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.

  1. A New Hybrid Whale Optimizer Algorithm with Mean Strategy of Grey Wolf Optimizer for Global Optimization

    Directory of Open Access Journals (Sweden)

    Narinder Singh

    2018-03-01

    Full Text Available The quest for an efficient nature-inspired optimization technique has continued over the last few decades. In this paper, a hybrid nature-inspired optimization technique has been proposed. The hybrid algorithm has been constructed using Mean Grey Wolf Optimizer (MGWO and Whale Optimizer Algorithm (WOA. We have utilized the spiral equation of Whale Optimizer Algorithm for two procedures in the Hybrid Approach GWO (HAGWO algorithm: (i firstly, we used the spiral equation in Grey Wolf Optimizer Algorithm for balance between the exploitation and the exploration process in the new hybrid approach; and (ii secondly, we also applied this equation in the whole population in order to refrain from the premature convergence and trapping in local minima. The feasibility and effectiveness of the hybrid algorithm have been tested by solving some standard benchmarks, XOR, Baloon, Iris, Breast Cancer, Welded Beam Design, Pressure Vessel Design problems and comparing the results with those obtained through other metaheuristics. The solutions prove that the newly existing hybrid variant has higher stronger stability, faster convergence rate and computational accuracy than other nature-inspired metaheuristics on the maximum number of problems and can successfully resolve the function of constrained nonlinear optimization in reality.

  2. A Gradient Taguchi Method for Engineering Optimization

    Science.gov (United States)

    Hwang, Shun-Fa; Wu, Jen-Chih; He, Rong-Song

    2017-10-01

    To balance the robustness and the convergence speed of optimization, a novel hybrid algorithm consisting of Taguchi method and the steepest descent method is proposed in this work. Taguchi method using orthogonal arrays could quickly find the optimum combination of the levels of various factors, even when the number of level and/or factor is quite large. This algorithm is applied to the inverse determination of elastic constants of three composite plates by combining numerical method and vibration testing. For these problems, the proposed algorithm could find better elastic constants in less computation cost. Therefore, the proposed algorithm has nice robustness and fast convergence speed as compared to some hybrid genetic algorithms.

  3. An Adaptive Unified Differential Evolution Algorithm for Global Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Qiang, Ji; Mitchell, Chad

    2014-11-03

    In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

  4. Design and global optimization of high-efficiency thermophotovoltaic systems.

    Science.gov (United States)

    Bermel, Peter; Ghebrebrhan, Michael; Chan, Walker; Yeng, Yi Xiang; Araghchini, Mohammad; Hamam, Rafif; Marton, Christopher H; Jensen, Klavs F; Soljačić, Marin; Joannopoulos, John D; Johnson, Steven G; Celanovic, Ivan

    2010-09-13

    Despite their great promise, small experimental thermophotovoltaic (TPV) systems at 1000 K generally exhibit extremely low power conversion efficiencies (approximately 1%), due to heat losses such as thermal emission of undesirable mid-wavelength infrared radiation. Photonic crystals (PhC) have the potential to strongly suppress such losses. However, PhC-based designs present a set of non-convex optimization problems requiring efficient objective function evaluation and global optimization algorithms. Both are applied to two example systems: improved micro-TPV generators and solar thermal TPV systems. Micro-TPV reactors experience up to a 27-fold increase in their efficiency and power output; solar thermal TPV systems see an even greater 45-fold increase in their efficiency (exceeding the Shockley-Quiesser limit for a single-junction photovoltaic cell).

  5. Remarks on global optimization using space-filling curves

    Science.gov (United States)

    Lera, Daniela; Sergeyev, Yaroslav

    2016-10-01

    The problem of finding the global minimum of a real function on a set S ⊆ RN occurs in many real world problems. In this paper, the global optimization problem with a multiextremal objective function satisfying the Lipschitz condition over a hypercube is considered. We propose a local tuning technique that adaptively estimates the local Lipschitz constants over different zones of the search region and a technique, called the local improvement, in order to accelerate the search. Peano-type space-filling curves for reduction of the dimension of the problem are used. Convergence condition are given. Numerical experiments executed on several hundreds of test functions show quite a promising performance of the introduced acceleration techniques.

  6. DEoptim: An R Package for Global Optimization by Differential Evolution

    Directory of Open Access Journals (Sweden)

    Katharine M. Mullen

    2011-04-01

    Full Text Available This article describes the R package DEoptim, which implements the differential evolution algorithm for global optimization of a real-valued function of a real-valued parameter vector. The implementation of differential evolution in DEoptim interfaces with C code for efficiency. The utility of the package is illustrated by case studies in fitting a Parratt model for X-ray reflectometry data and a Markov-switching generalized autoregressive conditional heteroskedasticity model for the returns of the Swiss Market Index.

  7. A Unified Differential Evolution Algorithm for Global Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Qiang, Ji; Mitchell, Chad

    2014-06-24

    Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

  8. Global optimization of silicon photovoltaic cell front coatings.

    Science.gov (United States)

    Ghebrebrhan, Michael; Bermel, Peter; Avniel, Yehuda; Joannopoulos, John D; Johnson, Steven G

    2009-04-27

    The front-coating (FC) of a solar cell controls its efficiency, determining admission of light into the absorbing material and potentially trapping light to enhance thin absorbers. Single-layer FC designs are well known, especially for thick absorbers where their only purpose is to reduce reflections. Multilayer FCs could improve performance, but require global optimization to design. For narrow bandwidths, one can always achieve nearly 100% absorption. For the entire solar bandwidth, however, a second FC layer improves performance by 6.1% for 256 microm wafer-based cells, or by 3.6% for 2 microm thin-film cells, while additional layers yield rapidly diminishing returns.

  9. PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization

    Directory of Open Access Journals (Sweden)

    Shuangqing Chen

    2018-01-01

    Full Text Available Particle swarm optimization (PSO and fireworks algorithm (FWA are two recently developed optimization methods which have been applied in various areas due to their simplicity and efficiency. However, when being applied to high-dimensional optimization problems, PSO algorithm may be trapped in the local optima owing to the lack of powerful global exploration capability, and fireworks algorithm is difficult to converge in some cases because of its relatively low local exploitation efficiency for noncore fireworks. In this paper, a hybrid algorithm called PS-FW is presented, in which the modified operators of FWA are embedded into the solving process of PSO. In the iteration process, the abandonment and supplement mechanism is adopted to balance the exploration and exploitation ability of PS-FW, and the modified explosion operator and the novel mutation operator are proposed to speed up the global convergence and to avoid prematurity. To verify the performance of the proposed PS-FW algorithm, 22 high-dimensional benchmark functions have been employed, and it is compared with PSO, FWA, stdPSO, CPSO, CLPSO, FIPS, Frankenstein, and ALWPSO algorithms. Results show that the PS-FW algorithm is an efficient, robust, and fast converging optimization method for solving global optimization problems.

  10. A self-learning particle swarm optimizer for global optimization problems.

    Science.gov (United States)

    Li, Changhe; Yang, Shengxiang; Nguyen, Trung Thanh

    2012-06-01

    Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means that all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called self-learning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different situations in the search space. The cooperation of the four strategies is implemented by an adaptive learning framework at the individual level, which can enable a particle to choose the optimal strategy according to its own local fitness landscape. The experimental study on a set of 45 test functions and two real-world problems show that SLPSO has a superior performance in comparison with several other peer algorithms.

  11. Synthetic Dataset To Benchmark Global Tomographic Methods

    Science.gov (United States)

    Qin, Yilong; Capdeville, Yann; Maupin, Valerie; Montagner, Jean-Paul

    2006-11-01

    A new set of global synthetic seismograms calculated in a three-dimensional (3-D), heterogeneous, anisotropic, anelastic model of the Earth using the spectral element method has been released by the European network SPICE (Seismic Wave Propagation and Imaging in Complex Media: a European Network). The set consists of 7424 three-component records with a minimum period of 32 seconds, a sampling rate of one second, and a duration of 10,500 seconds. The aim of this synthetic data set is to conduct a blind test of existing global tomographic methods based on long-period data, in order to test how current imaging techniques are limited by approximations in theory and by the inadequacy of data quality and coverage.

  12. Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration.

    Science.gov (United States)

    Yang, Jiaolong; Li, Hongdong; Campbell, Dylan; Jia, Yunde

    2016-11-01

    The Iterative Closest Point (ICP) algorithm is one of the most widely used methods for point-set registration. However, being based on local iterative optimization, ICP is known to be susceptible to local minima. Its performance critically relies on the quality of the initialization and only local optimality is guaranteed. This paper presents the first globally optimal algorithm, named Go-ICP, for Euclidean (rigid) registration of two 3D point-sets under the L 2 error metric defined in ICP. The Go-ICP method is based on a branch-and-bound scheme that searches the entire 3D motion space SE(3). By exploiting the special structure of SE(3) geometry, we derive novel upper and lower bounds for the registration error function. Local ICP is integrated into the BnB scheme, which speeds up the new method while guaranteeing global optimality. We also discuss extensions, addressing the issue of outlier robustness. The evaluation demonstrates that the proposed method is able to produce reliable registration results regardless of the initialization. Go-ICP can be applied in scenarios where an optimal solution is desirable or where a good initialization is not always available.

  13. STOCHASTIC GRADIENT METHODS FOR UNCONSTRAINED OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Nataša Krejić

    2014-12-01

    Full Text Available This papers presents an overview of gradient based methods for minimization of noisy functions. It is assumed that the objective functions is either given with error terms of stochastic nature or given as the mathematical expectation. Such problems arise in the context of simulation based optimization. The focus of this presentation is on the gradient based Stochastic Approximation and Sample Average Approximation methods. The concept of stochastic gradient approximation of the true gradient can be successfully extended to deterministic problems. Methods of this kind are presented for the data fitting and machine learning problems.

  14. Analyses of Methods and Algorithms for Modelling and Optimization of Biotechnological Processes

    Directory of Open Access Journals (Sweden)

    Stoyan Stoyanov

    2009-08-01

    Full Text Available A review of the problems in modeling, optimization and control of biotechnological processes and systems is given in this paper. An analysis of existing and some new practical optimization methods for searching global optimum based on various advanced strategies - heuristic, stochastic, genetic and combined are presented in the paper. Methods based on the sensitivity theory, stochastic and mix strategies for optimization with partial knowledge about kinetic, technical and economic parameters in optimization problems are discussed. Several approaches for the multi-criteria optimization tasks are analyzed. The problems concerning optimal controls of biotechnological systems are also discussed.

  15. Selective Segmentation for Global Optimization of Depth Estimation in Complex Scenes

    Directory of Open Access Journals (Sweden)

    Sheng Liu

    2013-01-01

    Full Text Available This paper proposes a segmentation-based global optimization method for depth estimation. Firstly, for obtaining accurate matching cost, the original local stereo matching approach based on self-adapting matching window is integrated with two matching cost optimization strategies aiming at handling both borders and occlusion regions. Secondly, we employ a comprehensive smooth term to satisfy diverse smoothness request in real scene. Thirdly, a selective segmentation term is used for enforcing the plane trend constraints selectively on the corresponding segments to further improve the accuracy of depth results from object level. Experiments on the Middlebury image pairs show that the proposed global optimization approach is considerably competitive with other state-of-the-art matching approaches.

  16. Layout optimization with algebraic multigrid methods

    Science.gov (United States)

    Regler, Hans; Ruede, Ulrich

    1993-01-01

    Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.

  17. Adiabatic optimization versus diffusion Monte Carlo methods

    Science.gov (United States)

    Jarret, Michael; Jordan, Stephen P.; Lackey, Brad

    2016-10-01

    Most experimental and theoretical studies of adiabatic optimization use stoquastic Hamiltonians, whose ground states are expressible using only real nonnegative amplitudes. This raises a question as to whether classical Monte Carlo methods can simulate stoquastic adiabatic algorithms with polynomial overhead. Here we analyze diffusion Monte Carlo algorithms. We argue that, based on differences between L1 and L2 normalized states, these algorithms suffer from certain obstructions preventing them from efficiently simulating stoquastic adiabatic evolution in generality. In practice however, we obtain good performance by introducing a method that we call Substochastic Monte Carlo. In fact, our simulations are good classical optimization algorithms in their own right, competitive with the best previously known heuristic solvers for MAX-k -SAT at k =2 ,3 ,4 .

  18. Memetic Algorithms to Solve a Global Nonlinear Optimization Problem. A Review

    Directory of Open Access Journals (Sweden)

    M. K. Sakharov

    2015-01-01

    Full Text Available In recent decades, evolutionary algorithms have proven themselves as the powerful optimization techniques of search engine. Their popularity is due to the fact that they are easy to implement and can be used in all areas, since they are based on the idea of universal evolution. For example, in the problems of a large number of local optima, the traditional optimization methods, usually, fail in finding the global optimum. To solve such problems using a variety of stochastic methods, in particular, the so-called population-based algorithms, which are a kind of evolutionary methods. The main disadvantage of this class of methods is their slow convergence to the exact solution in the neighborhood of the global optimum, as these methods incapable to use the local information about the landscape of the function. This often limits their use in largescale real-world problems where the computation time is a critical factor.One of the promising directions in the field of modern evolutionary computation are memetic algorithms, which can be regarded as a combination of population search of the global optimum and local procedures for verifying solutions, which gives a synergistic effect. In the context of memetic algorithms, the meme is an implementation of the local optimization method to refine solution in the search.The concept of memetic algorithms provides ample opportunities for the development of various modifications of these algorithms, which can vary the frequency of the local search, the conditions of its end, and so on. The practically significant memetic algorithm modifications involve the simultaneous use of different memes. Such algorithms are called multi-memetic.The paper gives statement of the global problem of nonlinear unconstrained optimization, describes the most promising areas of AI modifications, including hybridization and metaoptimization. The main content of the work is the classification and review of existing varieties of

  19. Simulated annealing method for electronic circuits design: adaptation and comparison with other optimization methods

    International Nuclear Information System (INIS)

    Berthiau, G.

    1995-10-01

    The circuit design problem consists in determining acceptable parameter values (resistors, capacitors, transistors geometries ...) which allow the circuit to meet various user given operational criteria (DC consumption, AC bandwidth, transient times ...). This task is equivalent to a multidimensional and/or multi objective optimization problem: n-variables functions have to be minimized in an hyper-rectangular domain ; equality constraints can be eventually specified. A similar problem consists in fitting component models. In this way, the optimization variables are the model parameters and one aims at minimizing a cost function built on the error between the model response and the data measured on the component. The chosen optimization method for this kind of problem is the simulated annealing method. This method, provided by the combinatorial optimization domain, has been adapted and compared with other global optimization methods for the continuous variables problems. An efficient strategy of variables discretization and a set of complementary stopping criteria have been proposed. The different parameters of the method have been adjusted with analytical functions of which minima are known, classically used in the literature. Our simulated annealing algorithm has been coupled with an open electrical simulator SPICE-PAC of which the modular structure allows the chaining of simulations required by the circuit optimization process. We proposed, for high-dimensional problems, a partitioning technique which ensures proportionality between CPU-time and variables number. To compare our method with others, we have adapted three other methods coming from combinatorial optimization domain - the threshold method, a genetic algorithm and the Tabu search method - The tests have been performed on the same set of test functions and the results allow a first comparison between these methods applied to continuous optimization variables. Finally, our simulated annealing program

  20. Layout optimization using the homogenization method

    Science.gov (United States)

    Suzuki, Katsuyuki; Kikuchi, Noboru

    1993-01-01

    A generalized layout problem involving sizing, shape, and topology optimization is solved by using the homogenization method for three-dimensional linearly elastic shell structures in order to seek a possibility of establishment of an integrated design system of automotive car bodies, as an extension of the previous work by Bendsoe and Kikuchi. A formulation of a three-dimensional homogenized shell, a solution algorithm, and several examples of computing the optimum layout are presented in this first part of the two articles.

  1. Spatiotemporal radiotherapy planning using a global optimization approach

    Science.gov (United States)

    Adibi, Ali; Salari, Ehsan

    2018-02-01

    This paper aims at quantifying the extent of potential therapeutic gain, measured using biologically effective dose (BED), that can be achieved by altering the radiation dose distribution over treatment sessions in fractionated radiotherapy. To that end, a spatiotemporally integrated planning approach is developed, where the spatial and temporal dose modulations are optimized simultaneously. The concept of equivalent uniform BED (EUBED) is used to quantify and compare the clinical quality of spatiotemporally heterogeneous dose distributions in target and critical structures. This gives rise to a large-scale non-convex treatment-plan optimization problem, which is solved using global optimization techniques. The proposed spatiotemporal planning approach is tested on two stylized cancer cases resembling two different tumor sites and sensitivity analysis is performed for radio-biological and EUBED parameters. Numerical results validate that spatiotemporal plans are capable of delivering a larger BED to the target volume without increasing the BED in critical structures compared to conventional time-invariant plans. In particular, this additional gain is attributed to the irradiation of different regions of the target volume at different treatment sessions. Additionally, the trade-off between the potential therapeutic gain and the number of distinct dose distributions is quantified, which suggests a diminishing marginal gain as the number of dose distributions increases.

  2. GMG: A Guaranteed, Efficient Global Optimization Algorithm for Remote Sensing.

    Energy Technology Data Exchange (ETDEWEB)

    D' Helon, CD

    2004-08-18

    The monocular passive ranging (MPR) problem in remote sensing consists of identifying the precise range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem may be set as a global optimization problem (GOP) whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. Using additional information about the error function between the predicted and observed radiances of the target, we developed GMG, a new algorithm to find the Global Minimum with a Guarantee. The new algorithm transforms the original continuous GOP into a discrete search problem, thereby guaranteeing to find the position of the global minimum in a reasonably short time. The algorithm is first applied to the golf course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions and then applied to various realizations of the MPR problem.

  3. Lifecycle-Based Swarm Optimization Method for Numerical Optimization

    Directory of Open Access Journals (Sweden)

    Hai Shen

    2014-01-01

    Full Text Available Bioinspired optimization algorithms have been widely used to solve various scientific and engineering problems. Inspired by biological lifecycle, this paper presents a novel optimization algorithm called lifecycle-based swarm optimization (LSO. Biological lifecycle includes four stages: birth, growth, reproduction, and death. With this process, even though individual organism died, the species will not perish. Furthermore, species will have stronger ability of adaptation to the environment and achieve perfect evolution. LSO simulates Biological lifecycle process through six optimization operators: chemotactic, assimilation, transposition, crossover, selection, and mutation. In addition, the spatial distribution of initialization population meets clumped distribution. Experiments were conducted on unconstrained benchmark optimization problems and mechanical design optimization problems. Unconstrained benchmark problems include both unimodal and multimodal cases the demonstration of the optimal performance and stability, and the mechanical design problem was tested for algorithm practicability. The results demonstrate remarkable performance of the LSO algorithm on all chosen benchmark functions when compared to several successful optimization techniques.

  4. SGO: A fast engine for ab initio atomic structure global optimization by differential evolution

    Science.gov (United States)

    Chen, Zhanghui; Jia, Weile; Jiang, Xiangwei; Li, Shu-Shen; Wang, Lin-Wang

    2017-10-01

    As the high throughout calculations and material genome approaches become more and more popular in material science, the search for optimal ways to predict atomic global minimum structure is a high research priority. This paper presents a fast method for global search of atomic structures at ab initio level. The structures global optimization (SGO) engine consists of a high-efficiency differential evolution algorithm, accelerated local relaxation methods and a plane-wave density functional theory code running on GPU machines. The purpose is to show what can be achieved by combining the superior algorithms at the different levels of the searching scheme. SGO can search the global-minimum configurations of crystals, two-dimensional materials and quantum clusters without prior symmetry restriction in a relatively short time (half or several hours for systems with less than 25 atoms), thus making such a task a routine calculation. Comparisons with other existing methods such as minima hopping and genetic algorithm are provided. One motivation of our study is to investigate the properties of magnetic systems in different phases. The SGO engine is capable of surveying the local minima surrounding the global minimum, which provides the information for the overall energy landscape of a given system. Using this capability we have found several new configurations for testing systems, explored their energy landscape, and demonstrated that the magnetic moment of metal clusters fluctuates strongly in different local minima.

  5. portfolio optimization based on nonparametric estimation methods

    Directory of Open Access Journals (Sweden)

    mahsa ghandehari

    2017-03-01

    Full Text Available One of the major issues investors are facing with in capital markets is decision making about select an appropriate stock exchange for investing and selecting an optimal portfolio. This process is done through the risk and expected return assessment. On the other hand in portfolio selection problem if the assets expected returns are normally distributed, variance and standard deviation are used as a risk measure. But, the expected returns on assets are not necessarily normal and sometimes have dramatic differences from normal distribution. This paper with the introduction of conditional value at risk ( CVaR, as a measure of risk in a nonparametric framework, for a given expected return, offers the optimal portfolio and this method is compared with the linear programming method. The data used in this study consists of monthly returns of 15 companies selected from the top 50 companies in Tehran Stock Exchange during the winter of 1392 which is considered from April of 1388 to June of 1393. The results of this study show the superiority of nonparametric method over the linear programming method and the nonparametric method is much faster than the linear programming method.

  6. METAHEURISTIC OPTIMIZATION METHODS FOR PARAMETERS ESTIMATION OF DYNAMIC SYSTEMS

    Directory of Open Access Journals (Sweden)

    V. Panteleev Andrei

    2017-01-01

    Full Text Available The article considers the usage of metaheuristic methods of constrained global optimization: “Big Bang - Big Crunch”, “Fireworks Algorithm”, “Grenade Explosion Method” in parameters of dynamic systems estimation, described with algebraic-differential equations. Parameters estimation is based upon the observation results from mathematical model behavior. Their values are derived after criterion minimization, which describes the total squared error of state vector coordinates from the deduced ones with precise values observation at different periods of time. Paral- lelepiped type restriction is imposed on the parameters values. Used for solving problems, metaheuristic methods of constrained global extremum don’t guarantee the result, but allow to get a solution of a rather good quality in accepta- ble amount of time. The algorithm of using metaheuristic methods is given. Alongside with the obvious methods for solving algebraic-differential equation systems, it is convenient to use implicit methods for solving ordinary differen- tial equation systems. Two ways of solving the problem of parameters evaluation are given, those parameters differ in their mathematical model. In the first example, a linear mathematical model describes the chemical action parameters change, and in the second one, a nonlinear mathematical model describes predator-prey dynamics, which characterize the changes in both kinds’ population. For each of the observed examples there are calculation results from all the three methods of optimization, there are also some recommendations for how to choose methods parameters. The obtained numerical results have demonstrated the efficiency of the proposed approach. The deduced parameters ap- proximate points slightly differ from the best known solutions, which were deduced differently. To refine the results one should apply hybrid schemes that combine classical methods of optimization of zero, first and second orders and

  7. Genetic algorithms as global random search methods

    Science.gov (United States)

    Peck, Charles C.; Dhawan, Atam P.

    1995-01-01

    Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

  8. Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program

    DEFF Research Database (Denmark)

    Le, T.H.A.; Pham, D. T.; Canh, Nam Nguyen

    2010-01-01

    Both the efficient and weakly efficient sets of an affine fractional vector optimization problem, in general, are neither convex nor given explicitly. Optimization problems over one of these sets are thus nonconvex. We propose two methods for optimizing a real-valued function over the efficient...... and weakly efficient sets of an affine fractional vector optimization problem. The first method is a local one. By using a regularization function, we reformulate the problem into a standard smooth mathematical programming problem that allows applying available methods for smooth programming. In case...... the objective function is linear, we have investigated a global algorithm based upon a branch-and-bound procedure. The algorithm uses Lagrangian bound coupling with a simplicial bisection in the criteria space. Preliminary computational results show that the global algorithm is promising....

  9. Global optimization driven by genetic algorithms for disruption predictors based on APODIS architecture

    International Nuclear Information System (INIS)

    Rattá, G.A.; Vega, J.; Murari, A.; Dormido-Canto, S.; Moreno, R.

    2016-01-01

    Highlights: • A global optimization method based on genetic algorithms was developed. • It allowed improving the prediction of disruptions using APODIS architecture. • It also provides the potential opportunity to develop a spectrum of future predictors using different training datasets. • The future analysis of how their structures reassemble and evolve in each test may help to improve the development of disruption predictors for ITER. - Abstract: Since year 2010, the APODIS architecture has proven its accuracy predicting disruptions in JET tokamak. Nevertheless, it has shown margins for improvements, fact indisputable after the enhanced performances achieved in posterior upgrades. In this article, a complete optimization driven by Genetic Algorithms (GA) is applied to it aiming at considering all possible combination of signals, signal features, quantity of models, their characteristics and internal parameters. This global optimization targets the creation of the best possible system with a reduced amount of required training data. The results harbor no doubts about the reliability of the global optimization method, allowing to outperform the ones of previous versions: 91.77% of predictions (89.24% with an anticipation higher than 10 ms) with a 3.55% of false alarms. Beyond its effectiveness, it also provides the potential opportunity to develop a spectrum of future predictors using different training datasets.

  10. Global optimization driven by genetic algorithms for disruption predictors based on APODIS architecture

    Energy Technology Data Exchange (ETDEWEB)

    Rattá, G.A., E-mail: giuseppe.ratta@ciemat.es [Laboratorio Nacional de Fusión, CIEMAT, Madrid (Spain); Vega, J. [Laboratorio Nacional de Fusión, CIEMAT, Madrid (Spain); Murari, A. [Consorzio RFX, Associazione EURATOM/ENEA per la Fusione, Padua (Italy); Dormido-Canto, S. [Dpto. de Informática y Automática, Universidad Nacional de Educación a Distancia, Madrid (Spain); Moreno, R. [Laboratorio Nacional de Fusión, CIEMAT, Madrid (Spain)

    2016-11-15

    Highlights: • A global optimization method based on genetic algorithms was developed. • It allowed improving the prediction of disruptions using APODIS architecture. • It also provides the potential opportunity to develop a spectrum of future predictors using different training datasets. • The future analysis of how their structures reassemble and evolve in each test may help to improve the development of disruption predictors for ITER. - Abstract: Since year 2010, the APODIS architecture has proven its accuracy predicting disruptions in JET tokamak. Nevertheless, it has shown margins for improvements, fact indisputable after the enhanced performances achieved in posterior upgrades. In this article, a complete optimization driven by Genetic Algorithms (GA) is applied to it aiming at considering all possible combination of signals, signal features, quantity of models, their characteristics and internal parameters. This global optimization targets the creation of the best possible system with a reduced amount of required training data. The results harbor no doubts about the reliability of the global optimization method, allowing to outperform the ones of previous versions: 91.77% of predictions (89.24% with an anticipation higher than 10 ms) with a 3.55% of false alarms. Beyond its effectiveness, it also provides the potential opportunity to develop a spectrum of future predictors using different training datasets.

  11. MIND. Optimization method for industrial energy systems

    Energy Technology Data Exchange (ETDEWEB)

    Nilsson, Katarina.

    1990-04-01

    It is of great importance to encourage the consciousness of energy demand and energy conservation issues in industrial applications as the potential for savings in many cases is very good. The MIND optimization method is a tool for life cycle cost minimization of a flexible range of industrial energy systems. It can be used in analyses of energy systems in response to changes within the systems, changes of the boundary conditions and synthesis of industrial energy systems. The aim is to find an optimal structure in the energy system where several alternative process routes and kinds of energy are available. Equipment alternatives may concern choices of recondition, exchange, new tehnology, time of investment and size considerations. Energy can be supplied to the industrial energy system as electricity, steam and with various kinds of fuel. Energy and material flows are represented in the optimization as well as non-linearities in energy demand functions and investment cost functions. Boundary conditions and process variations can be represented with a time division where the length of each time step and the number of time steps can be chosen. Two applications are presented to show the flexibility of the MIND method, heat treating processes in the engineering industry and milk processing in a dairy. (36 refs.).

  12. Double global optimum genetic algorithm-particle swarm optimization-based welding robot path planning

    Science.gov (United States)

    Wang, Xuewu; Shi, Yingpan; Ding, Dongyan; Gu, Xingsheng

    2016-02-01

    Spot-welding robots have a wide range of applications in manufacturing industries. There are usually many weld joints in a welding task, and a reasonable welding path to traverse these weld joints has a significant impact on welding efficiency. Traditional manual path planning techniques can handle a few weld joints effectively, but when the number of weld joints is large, it is difficult to obtain the optimal path. The traditional manual path planning method is also time consuming and inefficient, and cannot guarantee optimality. Double global optimum genetic algorithm-particle swarm optimization (GA-PSO) based on the GA and PSO algorithms is proposed to solve the welding robot path planning problem, where the shortest collision-free paths are used as the criteria to optimize the welding path. Besides algorithm effectiveness analysis and verification, the simulation results indicate that the algorithm has strong searching ability and practicality, and is suitable for welding robot path planning.

  13. METHODS OF INTEGRATED OPTIMIZATION MAGLEV TRANSPORT SYSTEMS

    Directory of Open Access Journals (Sweden)

    A. Lasher

    2013-09-01

    example, this research proved the sustainability of the proposed integrated optimization parameters of transport systems. This approach could be applied not only for MTS, but also for other transport systems. Originality. The bases of the complex optimization of transport presented are the new system of universal scientific methods and approaches that ensure high accuracy and authenticity of calculations with the simulation of transport systems and transport networks taking into account the dynamics of their development. Practical value. The development of the theoretical and technological bases of conducting the complex optimization of transport makes it possible to create the scientific tool, which ensures the fulfillment of the automated simulation and calculating of technical and economic structure and technology of the work of different objects of transport, including its infrastructure.

  14. Globalization of the pharmaceutical industry: the physician's role in optimizing drug use.

    Science.gov (United States)

    Young, M D

    1990-11-01

    In this new era of globalization, the physician must consider cultural differences in choosing methods of disseminating information so that practitioners in diverse settings may optimize drug usage. In addition, increasing competition, stimulated by the imminent unification of the European market in 1992, demands that the industry physician be concerned with developing possible new indications and cost-effective applications. These factors will enhance roles for the medical affairs physician in the pharmaceutical industry.

  15. Gradient gravitational search: An efficient metaheuristic algorithm for global optimization.

    Science.gov (United States)

    Dash, Tirtharaj; Sahu, Prabhat K

    2015-05-30

    The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. © 2015 Wiley Periodicals, Inc.

  16. Implementation and verification of global optimization benchmark problems

    Science.gov (United States)

    Posypkin, Mikhail; Usov, Alexander

    2017-12-01

    The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its' gradient at a given point and the interval estimates of a function and its' gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

  17. Implementation and verification of global optimization benchmark problems

    Directory of Open Access Journals (Sweden)

    Posypkin Mikhail

    2017-12-01

    Full Text Available The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its’ gradient at a given point and the interval estimates of a function and its’ gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

  18. Global optimization numerical strategies for rate-independent processes

    Czech Academy of Sciences Publication Activity Database

    Benešová, Barbora

    2011-01-01

    Roč. 50, č. 2 (2011), s. 197-220 ISSN 0925-5001 R&D Projects: GA ČR GAP201/10/0357 Grant - others:GA MŠk(CZ) LC06052 Program:LC Institutional research plan: CEZ:AV0Z20760514 Keywords : rate-independent processes * numerical global optimization * energy estimates based algorithm Subject RIV: BA - General Mathematics Impact factor: 1.196, year: 2011 http://math.hnue.edu.vn/portal/rss.viewpage.php?id=0000037780&ap=L3BvcnRhbC9ncmFiYmVyLnBocD9jYXRpZD0xMDEyJnBhZ2U9Mg==

  19. Adjusting process count on demand for petascale global optimization

    KAUST Repository

    Sosonkina, Masha

    2013-01-01

    There are many challenges that need to be met before efficient and reliable computation at the petascale is possible. Many scientific and engineering codes running at the petascale are likely to be memory intensive, which makes thrashing a serious problem for many petascale applications. One way to overcome this challenge is to use a dynamic number of processes, so that the total amount of memory available for the computation can be increased on demand. This paper describes modifications made to the massively parallel global optimization code pVTdirect in order to allow for a dynamic number of processes. In particular, the modified version of the code monitors memory use and spawns new processes if the amount of available memory is determined to be insufficient. The primary design challenges are discussed, and performance results are presented and analyzed.

  20. A new global particle swarm optimization for the economic emission dispatch with or without transmission losses

    International Nuclear Information System (INIS)

    Zou, Dexuan; Li, Steven; Li, Zongyan; Kong, Xiangyong

    2017-01-01

    Highlights: • A new global particle swarm optimization (NGPSO) is proposed. • NGPSO has strong convergence and desirable accuracy. • NGPSO is used to handle the economic emission dispatch with or without transmission losses. • The equality constraint can be satisfied by solving a quadratic equation. • The inequality constraints can be satisfied by using penalty function method. - Abstract: A new global particle swarm optimization (NGPSO) algorithm is proposed to solve the economic emission dispatch (EED) problems in this paper. NGPSO is different from the traditional particle swarm optimization (PSO) algorithm in two aspects. First, NGPSO uses a new position updating equation which relies on the global best particle to guide the searching activities of all particles. Second, it uses the randomization based on the uniform distribution to slightly disturb the flight trajectories of particles during the late evolutionary process. The two steps enable NGPSO to effectively execute a number of global searches, and thus they increase the chance of exploring promising solution space, and reduce the probabilities of getting trapped into local optima for all particles. On the other hand, the two objective functions of EED are normalized separately according to all candidate solutions, and then they are incorporated into one single objective function. The transformation steps are very helpful in eliminating the difference caused by the different dimensions of the two functions, and thus they strike a balance between the fuel cost and emission. In addition, a simple and common penalty function method is employed to facilitate the satisfactions of EED’s constraints. Based on these improvements in PSO, objective functions and constraints handling, high-quality solutions can be obtained for EED problems. Five examples are chosen to testify the performance of three improved PSOs on solving EED problems with or without transmission losses. Experimental results show that

  1. Methods for Distributed Optimal Energy Management

    DEFF Research Database (Denmark)

    Brehm, Robert

    micro-grids by prevention of meteorologic power flows into high voltage grids. A method, based on mathematical optimisation and a consensus algorithm is introduced and evaluated to coordinate charge/discharge scheduling for batteries between a number of buildings in order to improve self......The presented research deals with the fundamental underlying methods and concepts of how the growing number of distributed generation units based on renewable energy resources and distributed storage devices can be most efficiently integrated into the existing utility grid. In contrast......-consumption of renewable energy resources in low voltage grids. It can be shown that this method prevents mutual discharging of batteries and prevents peak loads, a supervisory control instance can dictate the level of autarchy from the utility grid. Further it is shown that the problem of optimal energy flow management...

  2. Parametric Method For Evaluating Optimal Ship Deadweight

    Directory of Open Access Journals (Sweden)

    Michalski Jan P.

    2014-04-01

    Full Text Available The paper presents a method of choosing the optimal value of the cargo ships deadweight. The method may be useful at the stage of establishing the main owners requirements concerning the ship design parameters as well as for choosing a proper ship for a given transportation task. The deadweight is determined on the basis of a selected economic measure of the transport effectiveness of ship - the Required Freight Rate (RFR. The mathematical model of the problem is of a deterministic character and the simplifying assumptions are justified for ships operating in the liner trade. The assumptions are so selected that solution of the problem is obtained in analytical closed form. The presented method can be useful for application in the pre-investment ships designing parameters simulation or transportation task studies.

  3. Game Theory-Inspired Evolutionary Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Guanci Yang

    2017-09-01

    Full Text Available Many approaches that model specific intelligent behaviors perform excellently in solving complex optimization problems. Game theory is widely recognized as an important tool in many fields. This paper introduces a game theory-inspired evolutionary algorithm for global optimization (GameEA. A formulation to estimate payoff expectations is provided, which is a mechanism to make a player become a rational decision-maker. GameEA has one population (i.e., set of players and generates new offspring only through an imitation operator and a belief-learning operator. An imitation operator adopts learning strategies and actions from other players to improve its competitiveness and applies these strategies to future games where one player updates its chromosome by strategically copying segments of gene sequences from a competitor. Belief learning refers to models in which a player adjusts his/her strategies, behavior or chromosomes by analyzing the current history information to improve solution quality. Experimental results on various classes of problems show that GameEA outperforms the other four algorithms on stability, robustness, and accuracy.

  4. Quantum-inspired immune clonal algorithm for global optimization.

    Science.gov (United States)

    Jiao, Licheng; Li, Yangyang; Gong, Maoguo; Zhang, Xiangrong

    2008-10-01

    Based on the concepts and principles of quantum computing, a novel immune clonal algorithm, called a quantum-inspired immune clonal algorithm (QICA), is proposed to deal with the problem of global optimization. In QICA, the antibody is proliferated and divided into a set of subpopulation groups. The antibodies in a subpopulation group are represented by multistate gene quantum bits. In the antibody's updating, the general quantum rotation gate strategy and the dynamic adjusting angle mechanism are applied to accelerate convergence. The quantum not gate is used to realize quantum mutation to avoid premature convergences. The proposed quantum recombination realizes the information communication between subpopulation groups to improve the search efficiency. Theoretical analysis proves that QICA converges to the global optimum. In the first part of the experiments, 10 unconstrained and 13 constrained benchmark functions are used to test the performance of QICA. The results show that QICA performs much better than the other improved genetic algorithms in terms of the quality of solution and computational cost. In the second part of the experiments, QICA is applied to a practical problem (i.e., multiuser detection in direct-sequence code-division multiple-access systems) with a satisfying result.

  5. Optimal management strategies in variable environments: Stochastic optimal control methods

    Science.gov (United States)

    Williams, B.K.

    1985-01-01

    Dynamic optimization was used to investigate the optimal defoliation of salt desert shrubs in north-western Utah. Management was formulated in the context of optimal stochastic control theory, with objective functions composed of discounted or time-averaged biomass yields. Climatic variability and community patterns of salt desert shrublands make the application of stochastic optimal control both feasible and necessary. A primary production model was used to simulate shrub responses and harvest yields under a variety of climatic regimes and defoliation patterns. The simulation results then were used in an optimization model to determine optimal defoliation strategies. The latter model encodes an algorithm for finite state, finite action, infinite discrete time horizon Markov decision processes. Three questions were addressed: (i) What effect do changes in weather patterns have on optimal management strategies? (ii) What effect does the discounting of future returns have? (iii) How do the optimal strategies perform relative to certain fixed defoliation strategies? An analysis was performed for the three shrub species, winterfat (Ceratoides lanata), shadscale (Atriplex confertifolia) and big sagebrush (Artemisia tridentata). In general, the results indicate substantial differences among species in optimal control strategies, which are associated with differences in physiological and morphological characteristics. Optimal policies for big sagebrush varied less with variation in climate, reserve levels and discount rates than did either shadscale or winterfat. This was attributed primarily to the overwintering of photosynthetically active tissue and to metabolic activity early in the growing season. Optimal defoliation of shadscale and winterfat generally was more responsive to differences in plant vigor and climate, reflecting the sensitivity of these species to utilization and replenishment of carbohydrate reserves. Similarities could be seen in the influence of both

  6. PRODUCT OPTIMIZATION METHOD BASED ON ANALYSIS OF OPTIMAL VALUES OF THEIR CHARACTERISTICS

    Directory of Open Access Journals (Sweden)

    Constantin D. STANESCU

    2016-05-01

    Full Text Available The paper presents an original method of optimizing products based on the analysis of optimal values of their characteristics . Optimization method comprises statistical model and analytical model . With this original method can easily and quickly obtain optimal product or material .

  7. Optimal Variational Method for Truly Nonlinear Oscillators

    Directory of Open Access Journals (Sweden)

    Vasile Marinca

    2013-01-01

    Full Text Available The Optimal Variational Method (OVM is introduced and applied for calculating approximate periodic solutions of “truly nonlinear oscillators”. The main advantage of this procedure consists in that it provides a convenient way to control the convergence of approximate solutions in a very rigorous way and allows adjustment of convergence regions where necessary. This approach does not depend upon any small or large parameters. A very good agreement was found between approximate and numerical solution, which proves that OVM is very efficient and accurate.

  8. Solving Nonlinear Optimization Problems of Real Functions in Complex Variables by Complex-Valued Iterative Methods.

    Science.gov (United States)

    Zhang, Songchuan; Xia, Youshen

    2018-01-01

    Much research has been devoted to complex-variable optimization problems due to their engineering applications. However, the complex-valued optimization method for solving complex-variable optimization problems is still an active research area. This paper proposes two efficient complex-valued optimization methods for solving constrained nonlinear optimization problems of real functions in complex variables, respectively. One solves the complex-valued nonlinear programming problem with linear equality constraints. Another solves the complex-valued nonlinear programming problem with both linear equality constraints and an -norm constraint. Theoretically, we prove the global convergence of the proposed two complex-valued optimization algorithms under mild conditions. The proposed two algorithms can solve the complex-valued optimization problem completely in the complex domain and significantly extend existing complex-valued optimization algorithms. Numerical results further show that the proposed two algorithms have a faster speed than several conventional real-valued optimization algorithms.

  9. SPICE benchmark for global tomographic methods

    Science.gov (United States)

    Qin, Yilong; Capdeville, Yann; Maupin, Valerie; Montagner, Jean-Paul; Lebedev, Sergei; Beucler, Eric

    2008-11-01

    The existing global tomographic methods result in different models due to different parametrization, scale resolution and theoretical approach. To test how current imaging techniques are limited by approximations in theory and by the inadequacy of data quality and coverage, it is necessary to perform a global-scale benchmark to understand the resolving properties of each specific imaging algorithm. In the framework of the Seismic wave Propagation and Imaging in Complex media: a European network (SPICE) project, it was decided to perform a benchmark experiment of global inversion algorithms. First, a preliminary benchmark with a simple isotropic model is carried out to check the feasibility in terms of acquisition geometry and numerical accuracy. Then, to fully validate tomographic schemes with a challenging synthetic data set, we constructed one complex anisotropic global model, which is characterized by 21 elastic constants and includes 3-D heterogeneities in velocity, anisotropy (radial and azimuthal anisotropy), attenuation, density, as well as surface topography and bathymetry. The intermediate-period (>32 s), high fidelity anisotropic modelling was performed by using state-of-the-art anisotropic anelastic modelling code, that is, coupled spectral element method (CSEM), on modern massively parallel computing resources. The benchmark data set consists of 29 events and three-component seismograms are recorded by 256 stations. Because of the limitation of the available computing power, synthetic seismograms have a minimum period of 32 s and a length of 10 500 s. The inversion of the benchmark data set demonstrates several well-known problems of classical surface wave tomography, such as the importance of crustal correction to recover the shallow structures, the loss of resolution with depth, the smearing effect, both horizontal and vertical, the inaccuracy of amplitude of isotropic S-wave velocity variation, the difficulty of retrieving the magnitude of azimuthal

  10. The methods and applications of optimization of radiation protection

    International Nuclear Information System (INIS)

    Liu Hua

    2007-01-01

    Optimization is the most important principle in radiation protection. The present article briefs the concept and up-to-date progress of optimization of protection, introduces some methods used in current optimization analysis, and presents various applications of optimization of protection. The author emphasizes that optimization of protection is a forward-looking iterative process aimed at preventing exposures before they occur. (author)

  11. Circular SAR Optimization Imaging Method of Buildings

    Directory of Open Access Journals (Sweden)

    Wang Jian-feng

    2015-12-01

    Full Text Available The Circular Synthetic Aperture Radar (CSAR can obtain the entire scattering properties of targets because of its great ability of 360° observation. In this study, an optimal orientation of the CSAR imaging algorithm of buildings is proposed by applying a combination of coherent and incoherent processing techniques. FEKO software is used to construct the electromagnetic scattering modes and simulate the radar echo. The FEKO imaging results are compared with the isotropic scattering results. On comparison, the optimal azimuth coherent accumulation angle of CSAR imaging of buildings is obtained. Practically, the scattering directions of buildings are unknown; therefore, we divide the 360° echo of CSAR into many overlapped and few angle echoes corresponding to the sub-aperture and then perform an imaging procedure on each sub-aperture. Sub-aperture imaging results are applied to obtain the all-around image using incoherent fusion techniques. The polarimetry decomposition method is used to decompose the all-around image and further retrieve the edge information of buildings successfully. The proposed method is validated with P-band airborne CSAR data from Sichuan, China.

  12. Optimization methods for activities selection problems

    Science.gov (United States)

    Mahad, Nor Faradilah; Alias, Suriana; Yaakop, Siti Zulaika; Arshad, Norul Amanina Mohd; Mazni, Elis Sofia

    2017-08-01

    Co-curriculum activities must be joined by every student in Malaysia and these activities bring a lot of benefits to the students. By joining these activities, the students can learn about the time management and they can developing many useful skills. This project focuses on the selection of co-curriculum activities in secondary school using the optimization methods which are the Analytic Hierarchy Process (AHP) and Zero-One Goal Programming (ZOGP). A secondary school in Negeri Sembilan, Malaysia was chosen as a case study. A set of questionnaires were distributed randomly to calculate the weighted for each activity based on the 3 chosen criteria which are soft skills, interesting activities and performances. The weighted was calculated by using AHP and the results showed that the most important criteria is soft skills. Then, the ZOGP model will be analyzed by using LINGO Software version 15.0. There are two priorities to be considered. The first priority which is to minimize the budget for the activities is achieved since the total budget can be reduced by RM233.00. Therefore, the total budget to implement the selected activities is RM11,195.00. The second priority which is to select the co-curriculum activities is also achieved. The results showed that 9 out of 15 activities were selected. Thus, it can concluded that AHP and ZOGP approach can be used as the optimization methods for activities selection problem.

  13. Computational methods applied to wind tunnel optimization

    Science.gov (United States)

    Lindsay, David

    This report describes computational methods developed for optimizing the nozzle of a three-dimensional subsonic wind tunnel. This requires determination of a shape that delivers flow to the test section, typically with a speed increase of 7 or more and a velocity uniformity of .25% or better, in a compact length without introducing boundary layer separation. The need for high precision, smooth solutions, and three-dimensional modeling required the development of special computational techniques. These include: (1) alternative formulations to Neumann and Dirichlet boundary conditions, to deal with overspecified, ill-posed, or cyclic problems, and to reduce the discrepancy between numerical solutions and boundary conditions; (2) modification of the Finite Element Method to obtain solutions with numerically exact conservation properties; (3) a Matlab implementation of general degree Finite Element solvers for various element designs in two and three dimensions, exploiting vector indexing to obtain optimal efficiency; (4) derivation of optimal quadrature formulas for integration over simplexes in two and three dimensions, and development of a program for semi-automated generation of formulas for any degree and dimension; (5) a modification of a two-dimensional boundary layer formulation to provide accurate flow conservation in three dimensions, and modification of the algorithm to improve stability; (6) development of multi-dimensional spline functions to achieve smoother solutions in three dimensions by post-processing, new three-dimensional elements for C1 basis functions, and a program to assist in the design of elements with higher continuity; and (7) a development of ellipsoidal harmonics and Lame's equation, with generalization to any dimension and a demonstration that Cartesian, cylindrical, spherical, spheroidal, and sphero-conical harmonics are all limiting cases. The report includes a description of the Finite Difference, Finite Volume, and domain remapping

  14. Multi-modulus algorithm based on global artificial fish swarm intelligent optimization of DNA encoding sequences.

    Science.gov (United States)

    Guo, Y C; Wang, H; Wu, H P; Zhang, M Q

    2015-12-21

    Aimed to address the defects of the large mean square error (MSE), and the slow convergence speed in equalizing the multi-modulus signals of the constant modulus algorithm (CMA), a multi-modulus algorithm (MMA) based on global artificial fish swarm (GAFS) intelligent optimization of DNA encoding sequences (GAFS-DNA-MMA) was proposed. To improve the convergence rate and reduce the MSE, this proposed algorithm adopted an encoding method based on DNA nucleotide chains to provide a possible solution to the problem. Furthermore, the GAFS algorithm, with its fast convergence and global search ability, was used to find the best sequence. The real and imaginary parts of the initial optimal weight vector of MMA were obtained through DNA coding of the best sequence. The simulation results show that the proposed algorithm has a faster convergence speed and smaller MSE in comparison with the CMA, the MMA, and the AFS-DNA-MMA.

  15. SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

    International Nuclear Information System (INIS)

    Li, Dengwang; Wang, Jie; Kapp, Daniel S.; Xing, Lei

    2015-01-01

    Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is

  16. Design of large Francis turbine using optimal methods

    International Nuclear Information System (INIS)

    Flores, E; Bornard, L; Tomas, L; Couston, M; Liu, J

    2012-01-01

    Among a high number of Francis turbine references all over the world, covering the whole market range of heads, Alstom has especially been involved in the development and equipment of the largest power plants in the world : Three Gorges (China −32×767 MW - 61 to 113 m), Itaipu (Brazil- 20x750 MW - 98.7m to 127m) and Xiangjiaba (China - 8x812 MW - 82.5m to 113.6m - in erection). Many new projects are under study to equip new power plants with Francis turbines in order to answer an increasing demand of renewable energy. In this context, Alstom Hydro is carrying out many developments to answer those needs, especially for jumbo units such the planned 1GW type units in China. The turbine design for such units requires specific care by using the state of the art in computation methods and the latest technologies in model testing as well as the maximum feedback from operation of Jumbo plants already in operation. We present in this paper how a large Francis turbine can be designed using specific design methods, including the global and local optimization methods. The design of the spiral case, the tandem cascade profiles, the runner and the draft tube are designed with optimization loops involving a blade design tool, an automatic meshing software and a Navier-Stokes solver, piloted by a genetic algorithm. These automated optimization methods, presented in different papers over the last decade, are nowadays widely used, thanks to the growing computation capacity of the HPC clusters: the intensive use of such optimization methods at the turbine design stage allows to reach very high level of performances, while the hydraulic flow characteristics are carefully studied over the whole water passage to avoid any unexpected hydraulic phenomena.

  17. Design of large Francis turbine using optimal methods

    Science.gov (United States)

    Flores, E.; Bornard, L.; Tomas, L.; Liu, J.; Couston, M.

    2012-11-01

    Among a high number of Francis turbine references all over the world, covering the whole market range of heads, Alstom has especially been involved in the development and equipment of the largest power plants in the world : Three Gorges (China -32×767 MW - 61 to 113 m), Itaipu (Brazil- 20x750 MW - 98.7m to 127m) and Xiangjiaba (China - 8x812 MW - 82.5m to 113.6m - in erection). Many new projects are under study to equip new power plants with Francis turbines in order to answer an increasing demand of renewable energy. In this context, Alstom Hydro is carrying out many developments to answer those needs, especially for jumbo units such the planned 1GW type units in China. The turbine design for such units requires specific care by using the state of the art in computation methods and the latest technologies in model testing as well as the maximum feedback from operation of Jumbo plants already in operation. We present in this paper how a large Francis turbine can be designed using specific design methods, including the global and local optimization methods. The design of the spiral case, the tandem cascade profiles, the runner and the draft tube are designed with optimization loops involving a blade design tool, an automatic meshing software and a Navier-Stokes solver, piloted by a genetic algorithm. These automated optimization methods, presented in different papers over the last decade, are nowadays widely used, thanks to the growing computation capacity of the HPC clusters: the intensive use of such optimization methods at the turbine design stage allows to reach very high level of performances, while the hydraulic flow characteristics are carefully studied over the whole water passage to avoid any unexpected hydraulic phenomena.

  18. On Best Practice Optimization Methods in R

    Directory of Open Access Journals (Sweden)

    John C. Nash

    2014-09-01

    Full Text Available R (R Core Team 2014 provides a powerful and flexible system for statistical computations. It has a default-install set of functionality that can be expanded by the use of several thousand add-in packages as well as user-written scripts. While R is itself a programming language, it has proven relatively easy to incorporate programs in other languages, particularly Fortran and C. Success, however, can lead to its own costs: • Users face a confusion of choice when trying to select packages in approaching a problem. • A need to maintain workable examples using early methods may mean some tools offered as a default may be dated. • In an open-source project like R, how to decide what tools offer "best practice" choices, and how to implement such a policy, present a serious challenge. We discuss these issues with reference to the tools in R for nonlinear parameter estimation (NLPE and optimization, though for the present article `optimization` will be limited to function minimization of essentially smooth functions with at most bounds constraints on the parameters. We will abbreviate this class of problems as NLPE. We believe that the concepts proposed are transferable to other classes of problems seen by R users.

  19. Electro-Fenton oxidation of coking wastewater: optimization using the combination of central composite design and convex optimization method.

    Science.gov (United States)

    Zhang, Bo; Sun, Jiwei; Wang, Qin; Fan, Niansi; Ni, Jialing; Li, Weicheng; Gao, Yingxin; Li, Yu-You; Xu, Changyou

    2017-10-01

    The electro-Fenton treatment of coking wastewater was evaluated experimentally in a batch electrochemical reactor. Based on central composite design coupled with response surface methodology, a regression quadratic equation was developed to model the total organic carbon (TOC) removal efficiency. This model was further proved to accurately predict the optimization of process variables by means of analysis of variance. With the aid of the convex optimization method, which is a global optimization method, the optimal parameters were determined as current density of 30.9 mA/cm 2 , Fe 2+ concentration of 0.35 mg/L, and pH of 4.05. Under the optimized conditions, the corresponding TOC removal efficiency was up to 73.8%. The maximum TOC removal efficiency achieved can be further confirmed by the results of gas chromatography-mass spectrum analysis.

  20. Annealing evolutionary stochastic approximation Monte Carlo for global optimization

    KAUST Repository

    Liang, Faming

    2010-04-08

    In this paper, we propose a new algorithm, the so-called annealing evolutionary stochastic approximation Monte Carlo (AESAMC) algorithm as a general optimization technique, and study its convergence. AESAMC possesses a self-adjusting mechanism, whose target distribution can be adapted at each iteration according to the current samples. Thus, AESAMC falls into the class of adaptive Monte Carlo methods. This mechanism also makes AESAMC less trapped by local energy minima than nonadaptive MCMC algorithms. Under mild conditions, we show that AESAMC can converge weakly toward a neighboring set of global minima in the space of energy. AESAMC is tested on multiple optimization problems. The numerical results indicate that AESAMC can potentially outperform simulated annealing, the genetic algorithm, annealing stochastic approximation Monte Carlo, and some other metaheuristics in function optimization. © 2010 Springer Science+Business Media, LLC.

  1. Models and Methods for Structural Topology Optimization with Discrete Design Variables

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    Structural topology optimization is a multi-disciplinary research field covering optimal design of load carrying mechanical structures such as bridges, airplanes, wind turbines, cars, etc. Topology optimization is a collection of theory, mathematical models, and numerical methods and is often used...... or stresses, or fundamental frequencies. The design variables are either continuous or discrete and model dimensions, thicknesses, densities, or material properties. Structural topology optimization is a multi-disciplinary research field covering optimal design of load carrying mechanical structures......, densities, or material properties. This thesis is devoted to the development of mathematical models, theory, and advanced numerical optimization methods for solving structural topology optimization problems with discrete design variables to proven global optimality. The thesis begins with an introduction...

  2. Comparison of global optimization approaches for robust calibration of hydrologic model parameters

    Science.gov (United States)

    Jung, I. W.

    2015-12-01

    Robustness of the calibrated parameters of hydrologic models is necessary to provide a reliable prediction of future performance of watershed behavior under varying climate conditions. This study investigated calibration performances according to the length of calibration period, objective functions, hydrologic model structures and optimization methods. To do this, the combination of three global optimization methods (i.e. SCE-UA, Micro-GA, and DREAM) and four hydrologic models (i.e. SAC-SMA, GR4J, HBV, and PRMS) was tested with different calibration periods and objective functions. Our results showed that three global optimization methods provided close calibration performances under different calibration periods, objective functions, and hydrologic models. However, using the agreement of index, normalized root mean square error, Nash-Sutcliffe efficiency as the objective function showed better performance than using correlation coefficient and percent bias. Calibration performances according to different calibration periods from one year to seven years were hard to generalize because four hydrologic models have different levels of complexity and different years have different information content of hydrological observation. Acknowledgements This research was supported by a grant (14AWMP-B082564-01) from Advanced Water Management Research Program funded by Ministry of Land, Infrastructure and Transport of Korean government.

  3. Automatic 3D liver segmentation based on deep learning and globally optimized surface evolution

    Science.gov (United States)

    Hu, Peijun; Wu, Fa; Peng, Jialin; Liang, Ping; Kong, Dexing

    2016-12-01

    The detection and delineation of the liver from abdominal 3D computed tomography (CT) images are fundamental tasks in computer-assisted liver surgery planning. However, automatic and accurate segmentation, especially liver detection, remains challenging due to complex backgrounds, ambiguous boundaries, heterogeneous appearances and highly varied shapes of the liver. To address these difficulties, we propose an automatic segmentation framework based on 3D convolutional neural network (CNN) and globally optimized surface evolution. First, a deep 3D CNN is trained to learn a subject-specific probability map of the liver, which gives the initial surface and acts as a shape prior in the following segmentation step. Then, both global and local appearance information from the prior segmentation are adaptively incorporated into a segmentation model, which is globally optimized in a surface evolution way. The proposed method has been validated on 42 CT images from the public Sliver07 database and local hospitals. On the Sliver07 online testing set, the proposed method can achieve an overall score of 80.3+/- 4.5 , yielding a mean Dice similarity coefficient of 97.25+/- 0.65 % , and an average symmetric surface distance of 0.84+/- 0.25 mm. The quantitative validations and comparisons show that the proposed method is accurate and effective for clinical application.

  4. Automatic 3D liver segmentation based on deep learning and globally optimized surface evolution.

    Science.gov (United States)

    Hu, Peijun; Wu, Fa; Peng, Jialin; Liang, Ping; Kong, Dexing

    2016-12-21

    The detection and delineation of the liver from abdominal 3D computed tomography (CT) images are fundamental tasks in computer-assisted liver surgery planning. However, automatic and accurate segmentation, especially liver detection, remains challenging due to complex backgrounds, ambiguous boundaries, heterogeneous appearances and highly varied shapes of the liver. To address these difficulties, we propose an automatic segmentation framework based on 3D convolutional neural network (CNN) and globally optimized surface evolution. First, a deep 3D CNN is trained to learn a subject-specific probability map of the liver, which gives the initial surface and acts as a shape prior in the following segmentation step. Then, both global and local appearance information from the prior segmentation are adaptively incorporated into a segmentation model, which is globally optimized in a surface evolution way. The proposed method has been validated on 42 CT images from the public Sliver07 database and local hospitals. On the Sliver07 online testing set, the proposed method can achieve an overall score of [Formula: see text], yielding a mean Dice similarity coefficient of [Formula: see text], and an average symmetric surface distance of [Formula: see text] mm. The quantitative validations and comparisons show that the proposed method is accurate and effective for clinical application.

  5. Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and Pareto filters.

    Directory of Open Access Journals (Sweden)

    Carlos Pozo

    Full Text Available Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study

  6. Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and Pareto filters.

    Science.gov (United States)

    Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Sorribas, Albert; Jiménez, Laureano

    2012-01-01

    Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA) representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study that optimizes the

  7. A low-complexity global optimization algorithm for temperature and pollution control in flames with complex chemistry

    Science.gov (United States)

    Debiane, L.; Ivorra, B.; Mohammadi, B.; Nicoud, F.; Poinsot, T.; Ern, A.; Pitsch, H.

    2006-02-01

    Controlling flame shapes and emissions is a major objective for all combustion engineers. Considering the complexity of reacting flows, novel optimization methods are required: this paper explores the application of control theory for partial differential equations to combustion. Both flame temperature and pollutant levels are optimized in a laminar Bunsen burner computed with complex chemistry using a recursive semi-deterministic global optimization algorithm. In order to keep the computational time low, the optimization procedure is coupled with mesh adaptation and incomplete gradient techniques.

  8. Numerical methods and optimization a consumer guide

    CERN Document Server

    Walter, Éric

    2014-01-01

    Initial training in pure and applied sciences tends to present problem-solving as the process of elaborating explicit closed-form solutions from basic principles, and then using these solutions in numerical applications. This approach is only applicable to very limited classes of problems that are simple enough for such closed-form solutions to exist. Unfortunately, most real-life problems are too complex to be amenable to this type of treatment. Numerical Methods and Optimization – A Consumer Guide presents methods for dealing with them. Shifting the paradigm from formal calculus to numerical computation, the text makes it possible for the reader to ·         discover how to escape the dictatorship of those particular cases that are simple enough to receive a closed-form solution, and thus gain the ability to solve complex, real-life problems; ·         understand the principles behind recognized algorithms used in state-of-the-art numerical software; ·         learn the advantag...

  9. Optimization of radiation monitoring methods of environment

    International Nuclear Information System (INIS)

    Bondarkov, M.D.

    2012-01-01

    Full text : Report is devoted to the substantiation of the ways to optimize methods of providing radioecological monitoring (RM) in Ukraine. For this purpose the design features of RM at different levels, the analysis of modern requirements for the RM, the methods for RM ensuring were considered in the dissertation, the use for instrumentation supply of laboratories of new simplified methods, that were developed in this paper, was proposed. This work proposed to strengthen radiobiological component of monitoring, the advantages and disadvantages of the proposed methods were analyzed. The research of the spatial and vertical distribution of radionuclides in soils of the most polluted part of the Chernobyl zone was conducted using the proposed methods. For the first time the parameters of vertical migration of the isotopes 154Eu, 238-240Pu and 241Am in soil profiles of Ch NPP close zone were calculated. The parameters of vertical migration of 90Sr, 137Cs were refined. The calculations of effective environmental and semi-refined periods of above mentioned isotopes for different soil types were conducted, the estimation of dose rates to biota was done, and radioecological characterization of the test sites of the cooling pond was conducted. The features of radioecology of birds, rodents and shrews, bats and amphibians were studied. The dose rates for these species were assessed and their compliance with 103 ICRP Guiding. The species differences in the pollution of wild rodents, insectivores, passerine birds, amphibians and bats on a large amount of factual material were estimated. The investigation of the radioecological contamination of the features of the urbanized landscape was conducted on the example of Pripyat silty. The practical significance of the work is that the developed methods of non radiochemical determination of radiostrontium activity, alpha emitting isotopes of plutonium, which can significantly hasten and facilitate the evaluation of the

  10. A new conjugate gradient method and its global convergence under the exact line search

    Science.gov (United States)

    Omer, Osman; Rivaie, Mohd; Mamat, Mustafa; Abdalla, Awad

    2014-12-01

    The conjugate gradient methods are numerously used for solving nonlinear unconstrained optimization problems, especially of large scale. Their wide applications are due to their simplicity and low memory requirement. To analyze conjugate gradient methods, two types of line searches are used; exact and inexact. In this paper, we present a new method of nonlinear conjugate gradient methods under the exact line search. The theoretical analysis shows that the new method generates a descent direction in each iteration and globally convergent under the exact line search. Moreover, numerical experiments based on comparing the new method with other well known conjugate gradient methods show that the new is efficient for some unconstrained optimization problems.

  11. Global optimal hybrid geometric active contour for automated lung segmentation on CT images.

    Science.gov (United States)

    Zhang, Weihang; Wang, Xue; Zhang, Pengbo; Chen, Junfeng

    2017-12-01

    Lung segmentation on thoracic CT images plays an important role in early detection, diagnosis and 3D visualization of lung cancer. The segmentation accuracy, stability, and efficiency of serial CT scans have a significant impact on the performance of computer-aided detection. This paper proposes a global optimal hybrid geometric active contour model for automated lung segmentation on CT images. Firstly, the combination of global region and edge information leads to high segmentation accuracy in lung regions with weak boundaries or narrow bands. Secondly, due to the global optimality of energy functional, the proposed model is robust to the initial position of level set function and requires fewer iterations. Thus, the stability and efficiency of lung segmentation on serial CT slices can be greatly improved by taking advantage of the information between adjacent slices. In addition, to achieve the whole process of automated segmentation for lung cancer, two assistant algorithms based on prior shape and anatomical knowledge are proposed. The algorithms not only automatically separate the left and right lungs, but also include juxta-pleural tumors into the segmentation result. The proposed method was quantitatively validated on subjects from the publicly available LIDC-IDRI and our own data sets. Exhaustive experimental results demonstrate the superiority and competency of our method, especially compared with the typical edge-based geometric active contour model. Copyright © 2017 Elsevier Ltd. All rights reserved.

  12. Elite Opposition-Based Water Wave Optimization Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Xiuli Wu

    2017-01-01

    Full Text Available Water wave optimization (WWO is a novel metaheuristic method that is based on shallow water wave theory, which has simple structure, easy realization, and good performance even with a small population. To improve the convergence speed and calculation precision even further, this paper on elite opposition-based strategy water wave optimization (EOBWWO is proposed, and it has been applied for function optimization and structure engineering design problems. There are three major optimization strategies in the improvement: elite opposition-based (EOB learning strategy enhances the diversity of population, local neighborhood search strategy is introduced to enhance local search in breaking operation, and improved propagation operator provides the improved algorithm with a better balance between exploration and exploitation. EOBWWO algorithm is verified by using 20 benchmark functions and two structure engineering design problems and the performance of EOBWWO is compared against those of the state-of-the-art algorithms. Experimental results show that the proposed algorithm has faster convergence speed, higher calculation precision, with the exact solution being even obtained on some benchmark functions, and a higher degree of stability than other comparative algorithms.

  13. Global stability-based design optimization of truss structures using ...

    Indian Academy of Sciences (India)

    Furthermore, a pure pareto-ranking based multi-objective optimization model is employed for the design optimization of the truss structure with multiple objectives. The computational performance of the optimization model is increased by implementing an island model into its evolutionary search mechanism. The proposed ...

  14. Hybrid Training Method for MLP: Optimization of Architecture and Training.

    Science.gov (United States)

    Zanchettin, C; Ludermir, T B; Almeida, L M

    2011-08-01

    The performance of an artificial neural network (ANN) depends upon the selection of proper connection weights, network architecture, and cost function during network training. This paper presents a hybrid approach (GaTSa) to optimize the performance of the ANN in terms of architecture and weights. GaTSa is an extension of a previous method (TSa) proposed by the authors. GaTSa is based on the integration of the heuristic simulated annealing (SA), tabu search (TS), genetic algorithms (GA), and backpropagation, whereas TSa does not use GA. The main advantages of GaTSa are the following: a constructive process to add new nodes in the architecture based on GA, the ability to escape from local minima with uphill moves (SA feature), and faster convergence by the evaluation of a set of solutions (TS feature). The performance of GaTSa is investigated through an empirical evaluation of 11 public-domain data sets using different cost functions in the simultaneous optimization of the multilayer perceptron ANN architecture and weights. Experiments demonstrated that GaTSa can also be used for relevant feature selection. GaTSa presented statistically relevant results in comparison with other global and local optimization techniques.

  15. Method for optimizing harvesting of crops

    DEFF Research Database (Denmark)

    2008-01-01

      In order e.g. to optimize harvesting crops of the kind which may be self dried on a field prior to a harvesting step (116, 118), there is disclosed a method of providing a mobile unit (102) for working (114, 116, 118) the field with crops, equipping the mobile unit (102) with crop biomass...... measuring means (108) and with crop moisture content measurement means (106), measuring crop biomass (107a, 107b) and crop moisture content (109a, 109b) of the crop, providing a spatial crop biomass and crop moisture content characteristics map of the field  based on the biomass data (107a, 107b) provided...... from moving the mobile unit on the field and the moisture content (109a, 109b), and determining an optimised drying time (104a, 104b) prior to the following harvesting step (116, 118) in response to the spatial crop biomass and crop moisture content characteristics map and in response to a weather...

  16. An efficient global energy optimization approach for robust 3D plane segmentation of point clouds

    Science.gov (United States)

    Dong, Zhen; Yang, Bisheng; Hu, Pingbo; Scherer, Sebastian

    2018-03-01

    Automatic 3D plane segmentation is necessary for many applications including point cloud registration, building information model (BIM) reconstruction, simultaneous localization and mapping (SLAM), and point cloud compression. However, most of the existing 3D plane segmentation methods still suffer from low precision and recall, and inaccurate and incomplete boundaries, especially for low-quality point clouds collected by RGB-D sensors. To overcome these challenges, this paper formulates the plane segmentation problem as a global energy optimization because it is robust to high levels of noise and clutter. First, the proposed method divides the raw point cloud into multiscale supervoxels, and considers planar supervoxels and individual points corresponding to nonplanar supervoxels as basic units. Then, an efficient hybrid region growing algorithm is utilized to generate initial plane set by incrementally merging adjacent basic units with similar features. Next, the initial plane set is further enriched and refined in a mutually reinforcing manner under the framework of global energy optimization. Finally, the performances of the proposed method are evaluated with respect to six metrics (i.e., plane precision, plane recall, under-segmentation rate, over-segmentation rate, boundary precision, and boundary recall) on two benchmark datasets. Comprehensive experiments demonstrate that the proposed method obtained good performances both in high-quality TLS point clouds (i.e., http://SEMANTIC3D.NET)

  17. Bellman – Ford Method for Solving the Optimal Route Problem

    Directory of Open Access Journals (Sweden)

    Laima Greičiūnė

    2014-12-01

    Full Text Available The article aims to adapt the dynamic programming method for optimal route determination using real-time data on ITS equipment. For this purpose, VBA code has been applied for solving the Bellman - Ford method for an optimal route considering optimality criteria for time, distance and the amount of emissions.

  18. Global warming and climate change: control methods

    International Nuclear Information System (INIS)

    Laal, M.; Aliramaie, A.

    2008-01-01

    This paper aimed at finding causes of global warming and ways to bring it under control. Data based on scientific opinion as given by synthesis reports of news, articles, web sites, and books. global warming is the observed and projected increases in average temperature of Earth's atmosphere and oceans. Carbon dioxide and other air pollution that is collecting in the atmosphere like a thickening blanket, trapping the sun's heat and causing the planet to warm up. Pollution is one of the biggest man-made problems. Burning fossil fuels is the main factor of pollution. As average temperature increases, habitats, species and people are threatened by drought, changes in rainfall, altered seasons, and more violent storms and floods. Indeed the life cycle of nuclear power results in relatively little pollution. Energy efficiency, solar, wind and other renewable fuels are other weapons against global warming . Human activity, primarily burning fossil fuels, is the major driving factor in global warming . Curtailing the release of carbon dioxide into the atmosphere by reducing use of oil, gasoline, coal and employment of alternate energy, sources are the tools for keeping global warming under control. global warming can be slowed and stopped, with practical actions thal yield a cleaner, healthier atmosphere

  19. Research on optimal investment path of transmission corridor under the global energy Internet

    Science.gov (United States)

    Huang, Yuehui; Li, Pai; Wang, Qi; Liu, Jichun; Gao, Han

    2018-02-01

    Under the background of the global energy Internet, the investment planning of transmission corridor from XinJiang to Germany is studied in this article, which passes through four countries: Kazakhstan, Russia, Belarus and Poland. Taking the specific situation of different countries into account, including the length of transmission line, unit construction cost, completion time, transmission price, state tariff, inflation rate and so on, this paper constructed a power transmission investment model. Finally, the dynamic programming method is used to simulate the example, and the optimal strategies under different objective functions are obtained.

  20. Topology Optimization Methods for Acoustic-Mechanical Coupling Problems

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard; Dilgen, Cetin Batur; Dilgen, Sümer Bartug

    2017-01-01

    A comparative overview of methods for topology optimization of acoustic mechanical coupling problems is provided. The goal is to pave the road for developing efficient optimization schemes for the design of complex acoustic devices such as hearingaids.......A comparative overview of methods for topology optimization of acoustic mechanical coupling problems is provided. The goal is to pave the road for developing efficient optimization schemes for the design of complex acoustic devices such as hearingaids....

  1. A Review of Deterministic Optimization Methods in Engineering and Management

    Directory of Open Access Journals (Sweden)

    Ming-Hua Lin

    2012-01-01

    Full Text Available With the increasing reliance on modeling optimization problems in practical applications, a number of theoretical and algorithmic contributions of optimization have been proposed. The approaches developed for treating optimization problems can be classified into deterministic and heuristic. This paper aims to introduce recent advances in deterministic methods for solving signomial programming problems and mixed-integer nonlinear programming problems. A number of important applications in engineering and management are also reviewed to reveal the usefulness of the optimization methods.

  2. A new family of conjugate gradient methods for small-scale unconstrained optimization

    Science.gov (United States)

    Jusoh, Ibrahim; Mamat, Mustafa; Rivaie, Mohd

    2013-04-01

    Conjugate gradient (CG) methods are famous for solving nonlinear unconstrained optimization problems because they only need low computer memory. In this paper, we propose a new CG coefficient (βk) which has global convergence properties using exact line search. Numerical results based on the number of iterations have shown that the new βk performs better than some other CG methods.

  3. Method of optimization onboard communication network

    Science.gov (United States)

    Platoshin, G. A.; Selvesuk, N. I.; Semenov, M. E.; Novikov, V. M.

    2018-02-01

    In this article the optimization levels of onboard communication network (OCN) are proposed. We defined the basic parameters, which are necessary for the evaluation and comparison of modern OCN, we identified also a set of initial data for possible modeling of the OCN. We also proposed a mathematical technique for implementing the OCN optimization procedure. This technique is based on the principles and ideas of binary programming. It is shown that the binary programming technique allows to obtain an inherently optimal solution for the avionics tasks. An example of the proposed approach implementation to the problem of devices assignment in OCN is considered.

  4. On the Convergence Analysis of the Optimized Gradient Method.

    Science.gov (United States)

    Kim, Donghwan; Fessler, Jeffrey A

    2017-01-01

    This paper considers the problem of unconstrained minimization of smooth convex functions having Lipschitz continuous gradients with known Lipschitz constant. We recently proposed the optimized gradient method for this problem and showed that it has a worst-case convergence bound for the cost function decrease that is twice as small as that of Nesterov's fast gradient method, yet has a similarly efficient practical implementation. Drori showed recently that the optimized gradient method has optimal complexity for the cost function decrease over the general class of first-order methods. This optimality makes it important to study fully the convergence properties of the optimized gradient method. The previous worst-case convergence bound for the optimized gradient method was derived for only the last iterate of a secondary sequence. This paper provides an analytic convergence bound for the primary sequence generated by the optimized gradient method. We then discuss additional convergence properties of the optimized gradient method, including the interesting fact that the optimized gradient method has two types of worstcase functions: a piecewise affine-quadratic function and a quadratic function. These results help complete the theory of an optimal first-order method for smooth convex minimization.

  5. Globally Optimized Targeted Mass Spectrometry: Reliable Metabolomics Analysis with Broad Coverage.

    Science.gov (United States)

    Gu, Haiwei; Zhang, Ping; Zhu, Jiangjiang; Raftery, Daniel

    2015-12-15

    Targeted detection is one of the most important methods in mass spectrometry (MS)-based metabolomics; however, its major limitation is the reduced metabolome coverage that results from the limited set of targeted metabolites typically used in the analysis. In this study we describe a new approach, globally optimized targeted (GOT)-MS, that combines many of the advantages of targeted detection and global profiling in metabolomics analysis, including the capability to detect unknowns, broad metabolite coverage, and excellent quantitation. The key step in GOT-MS is a global search of precursor and product ions using a single liquid chromatography-triple quadrupole (LC-QQQ) mass spectrometer. Here, focused on measuring serum metabolites, we obtained 595 precursor ions and 1 890 multiple reaction monitoring (MRM) transitions, under positive and negative ionization modes in the mass range of 60-600 Da. For many of the MRMs/metabolites under investigation, the analytical performance of GOT-MS is better than or at least comparable to that obtained by global profiling using a quadrupole-time-of-flight (Q-TOF) instrument of similar vintage. Using a study of serum metabolites in colorectal cancer (CRC) as a representative example, GOT-MS significantly outperformed a large targeted MS assay containing ∼160 biologically important metabolites and provided a complementary approach to traditional global profiling using Q-TOF-MS. GOT-MS thus expands and optimizes the detection capabilities for QQQ-MS through a novel approach and should have the potential to significantly advance both basic and clinical metabolic research.

  6. A simple method to optimize HMC performance

    CERN Document Server

    Bussone, Andrea; Drach, Vincent; Hansen, Martin; Hietanen, Ari; Rantaharju, Jarno; Pica, Claudio

    2016-01-01

    We present a practical strategy to optimize a set of Hybrid Monte Carlo parameters in simulations of QCD and QCD-like theories. We specialize to the case of mass-preconditioning, with multiple time-step Omelyan integrators. Starting from properties of the shadow Hamiltonian we show how the optimal setup for the integrator can be chosen once the forces and their variances are measured, assuming that those only depend on the mass-preconditioning parameter.

  7. A simple method to optimize HMC performance

    Science.gov (United States)

    Bussone, A.; Della Morte, M.; Drach, V.; Hansen, M.; Hietanen, A.; Rantaharju, J.; Pica, C.

    We present a practical strategy to optimize a set of Hybrid Monte Carlo parameters in simulations of QCD and QCD-like theories. We specialize to the case of mass-preconditioning, with multiple time-step Omelyan integrators. Starting from properties of the shadow Hamiltonian we show how the optimal setup for the integrator can be chosen once the forces and their variances are measured, assuming that those only depend on the mass-preconditioning parameter.

  8. Chaotic Teaching-Learning-Based Optimization with Lévy Flight for Global Numerical Optimization.

    Science.gov (United States)

    He, Xiangzhu; Huang, Jida; Rao, Yunqing; Gao, Liang

    2016-01-01

    Recently, teaching-learning-based optimization (TLBO), as one of the emerging nature-inspired heuristic algorithms, has attracted increasing attention. In order to enhance its convergence rate and prevent it from getting stuck in local optima, a novel metaheuristic has been developed in this paper, where particular characteristics of the chaos mechanism and Lévy flight are introduced to the basic framework of TLBO. The new algorithm is tested on several large-scale nonlinear benchmark functions with different characteristics and compared with other methods. Experimental results show that the proposed algorithm outperforms other algorithms and achieves a satisfactory improvement over TLBO.

  9. Topology optimization based on the harmony search method

    International Nuclear Information System (INIS)

    Lee, Seung-Min; Han, Seog-Young

    2017-01-01

    A new topology optimization scheme based on a Harmony search (HS) as a metaheuristic method was proposed and applied to static stiffness topology optimization problems. To apply the HS to topology optimization, the variables in HS were transformed to those in topology optimization. Compliance was used as an objective function, and harmony memory was defined as the set of the optimized topology. Also, a parametric study for Harmony memory considering rate (HMCR), Pitch adjusting rate (PAR), and Bandwidth (BW) was performed to find the appropriate range for topology optimization. Various techniques were employed such as a filtering scheme, simple average scheme and harmony rate. To provide a robust optimized topology, the concept of the harmony rate update rule was also implemented. Numerical examples are provided to verify the effectiveness of the HS by comparing the optimal layouts of the HS with those of Bidirectional evolutionary structural optimization (BESO) and Artificial bee colony algorithm (ABCA). The following conclu- sions could be made: (1) The proposed topology scheme is very effective for static stiffness topology optimization problems in terms of stability, robustness and convergence rate. (2) The suggested method provides a symmetric optimized topology despite the fact that the HS is a stochastic method like the ABCA. (3) The proposed scheme is applicable and practical in manufacturing since it produces a solid-void design of the optimized topology. (4) The suggested method appears to be very effective for large scale problems like topology optimization.

  10. Topology optimization based on the harmony search method

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Seung-Min; Han, Seog-Young [Hanyang University, Seoul (Korea, Republic of)

    2017-06-15

    A new topology optimization scheme based on a Harmony search (HS) as a metaheuristic method was proposed and applied to static stiffness topology optimization problems. To apply the HS to topology optimization, the variables in HS were transformed to those in topology optimization. Compliance was used as an objective function, and harmony memory was defined as the set of the optimized topology. Also, a parametric study for Harmony memory considering rate (HMCR), Pitch adjusting rate (PAR), and Bandwidth (BW) was performed to find the appropriate range for topology optimization. Various techniques were employed such as a filtering scheme, simple average scheme and harmony rate. To provide a robust optimized topology, the concept of the harmony rate update rule was also implemented. Numerical examples are provided to verify the effectiveness of the HS by comparing the optimal layouts of the HS with those of Bidirectional evolutionary structural optimization (BESO) and Artificial bee colony algorithm (ABCA). The following conclu- sions could be made: (1) The proposed topology scheme is very effective for static stiffness topology optimization problems in terms of stability, robustness and convergence rate. (2) The suggested method provides a symmetric optimized topology despite the fact that the HS is a stochastic method like the ABCA. (3) The proposed scheme is applicable and practical in manufacturing since it produces a solid-void design of the optimized topology. (4) The suggested method appears to be very effective for large scale problems like topology optimization.

  11. Local versus global optimal sports techniques in a group of athletes.

    Science.gov (United States)

    Huchez, Aurore; Haering, Diane; Holvoët, Patrice; Barbier, Franck; Begon, Mickael

    2015-01-01

    Various optimization algorithms have been used to achieve optimal control of sports movements. Nevertheless, no local or global optimization algorithm could be the most effective for solving all optimal control problems. This study aims at comparing local and global optimal solutions in a multistart gradient-based optimization by considering actual repetitive performances of a group of athletes performing a transition move on the uneven bars. Twenty-four trials by eight national-level female gymnasts were recorded using a motion capture system, and then multistart sequential quadratic programming optimizations were performed to obtain global optimal, local optimal and suboptimal solutions. The multistart approach combined with a gradient-based algorithm did not often find the local solution to be the best and proposed several other solutions including global optimal and suboptimal techniques. The qualitative change between actual and optimal techniques provided three directions for training: to increase hip flexion-abduction, to transfer leg and arm angular momentum to the trunk and to straighten hand path to the bar.

  12. Global stability-based design optimization of truss structures using ...

    Indian Academy of Sciences (India)

    mation, which is obtained from the nonlinear structural analysis, for optimal design of truss structures. Cardoso ... tive function related to joint displacements is included into optimization procedure. Although ... quadratic form; when an inappropriate root is used for the constraint equation, the computational procedure fails.

  13. Global Optimization of Low-Thrust Interplanetary Trajectories Subject to Operational Constraints

    Science.gov (United States)

    Englander, Jacob A.; Vavrina, Matthew A.; Hinckley, David

    2016-01-01

    Low-thrust interplanetary space missions are highly complex and there can be many locally optimal solutions. While several techniques exist to search for globally optimal solutions to low-thrust trajectory design problems, they are typically limited to unconstrained trajectories. The operational design community in turn has largely avoided using such techniques and has primarily focused on accurate constrained local optimization combined with grid searches and intuitive design processes at the expense of efficient exploration of the global design space. This work is an attempt to bridge the gap between the global optimization and operational design communities by presenting a mathematical framework for global optimization of low-thrust trajectories subject to complex constraints including the targeting of planetary landing sites, a solar range constraint to simplify the thermal design of the spacecraft, and a real-world multi-thruster electric propulsion system that must switch thrusters on and off as available power changes over the course of a mission.

  14. Review of design optimization methods for turbomachinery aerodynamics

    Science.gov (United States)

    Li, Zhihui; Zheng, Xinqian

    2017-08-01

    In today's competitive environment, new turbomachinery designs need to be not only more efficient, quieter, and ;greener; but also need to be developed at on much shorter time scales and at lower costs. A number of advanced optimization strategies have been developed to achieve these requirements. This paper reviews recent progress in turbomachinery design optimization to solve real-world aerodynamic problems, especially for compressors and turbines. This review covers the following topics that are important for optimizing turbomachinery designs. (1) optimization methods, (2) stochastic optimization combined with blade parameterization methods and the design of experiment methods, (3) gradient-based optimization methods for compressors and turbines and (4) data mining techniques for Pareto Fronts. We also present our own insights regarding the current research trends and the future optimization of turbomachinery designs.

  15. An auto-adapting global-to-local color balancing method for optical imagery mosaic

    Science.gov (United States)

    Yu, Lei; Zhang, Yongjun; Sun, Mingwei; Zhou, Xiuguang; Liu, Chi

    2017-10-01

    This paper presents a novel auto-adapting global-to-local color balancing method which aims to eliminate the effects of color differences between adjacent optical images to achieve seamless image mosaicking. The proposed method combines global and local optimization strategies to eliminate color differences between different target images adaptively without assigning the reference image. The global optimization strategy takes the constraint that the color information of the image before and after the color balancing process should be minimal, by which the assigning of reference images can be avoided. The strategy takes all target images as a whole and solves the normalization regression models simultaneously, which transfers the color difference elimination problem into the least square optimization one and eliminates the total color differences effectively. The local optimization strategy is a supplement for the global one, which focuses on the local information to eliminate the color differences in the overlap areas of the target images with the Gamma transform algorithm. It is worth noting that the proposed method can select a suitable processing flow from both the global and local optimization aspects based on the characteristics of the target images. When the total overlap rate of the target images is small, both the global and local strategies are employed; and when the total overlap rate of the target images is large, only the local optimization strategy is employed, by which a seamless color balancing result can be generated. The experimental results in this paper demonstrate that the proposed method performs well in color balancing for multi-type optical datasets.

  16. A Method for Determining Optimal Residential Energy Efficiency Packages

    Energy Technology Data Exchange (ETDEWEB)

    Polly, B. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Gestwick, M. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Bianchi, M. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Anderson, R. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Horowitz, S. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Christensen, C. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Judkoff, R. [National Renewable Energy Lab. (NREL), Golden, CO (United States)

    2011-04-01

    This report describes an analysis method for determining optimal residential energy efficiency retrofit packages and, as an illustrative example, applies the analysis method to a 1960s-era home in eight U.S. cities covering a range of International Energy Conservation Code (IECC) climate regions. The method uses an optimization scheme that considers average energy use (determined from building energy simulations) and equivalent annual cost to recommend optimal retrofit packages specific to the building, occupants, and location.

  17. A modified form of conjugate gradient method for unconstrained optimization problems

    Science.gov (United States)

    Ghani, Nur Hamizah Abdul; Rivaie, Mohd.; Mamat, Mustafa

    2016-06-01

    Conjugate gradient (CG) methods have been recognized as an interesting technique to solve optimization problems, due to the numerical efficiency, simplicity and low memory requirements. In this paper, we propose a new CG method based on the study of Rivaie et al. [7] (Comparative study of conjugate gradient coefficient for unconstrained Optimization, Aus. J. Bas. Appl. Sci. 5(2011) 947-951). Then, we show that our method satisfies sufficient descent condition and converges globally with exact line search. Numerical results show that our proposed method is efficient for given standard test problems, compare to other existing CG methods.

  18. Optimal Detection of Global Warming using Temperature Profiles

    Science.gov (United States)

    Leroy, Stephen S.

    1997-01-01

    Optimal fingerprinting is applied to estimate the amount of time it would take to detect warming by increased concentrations of carbon dioxide in monthly averages of temperature profiles over the Indian Ocean.

  19. COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Y.; Borland, Michael

    2017-06-25

    Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.

  20. Augmented Lagrangian Method For Discretized Optimal Control ...

    African Journals Online (AJOL)

    In this paper, we are concerned with one-dimensional time invariant optimal control problem, whose objective function is quadratic and the dynamical system is a differential equation with initial condition .Since most real life problems are nonlinear and their analytical solutions are not readily available, we resolve to ...

  1. METHOD FOR OPTIMIZING THE ENERGY OF PUMPS

    NARCIS (Netherlands)

    Skovmose Kallesøe, Carsten; De Persis, Claudio

    2013-01-01

    The device for energy-optimization on operation of several centrifugal pumps controlled in rotational speed, in a hydraulic installation, begins firstly with determining which pumps as pilot pumps are assigned directly to a consumer and which pumps are hydraulically connected in series upstream of

  2. Parallel optimization methods for agile manufacturing

    Energy Technology Data Exchange (ETDEWEB)

    Meza, J.C.; Moen, C.D.; Plantenga, T.D.; Spence, P.A.; Tong, C.H. [Sandia National Labs., Livermore, CA (United States); Hendrickson, B.A.; Leland, R.W.; Reese, G.M. [Sandia National Labs., Albuquerque, NM (United States)

    1997-08-01

    The rapid and optimal design of new goods is essential for meeting national objectives in advanced manufacturing. Currently almost all manufacturing procedures involve the determination of some optimal design parameters. This process is iterative in nature and because it is usually done manually it can be expensive and time consuming. This report describes the results of an LDRD, the goal of which was to develop optimization algorithms and software tools that will enable automated design thereby allowing for agile manufacturing. Although the design processes vary across industries, many of the mathematical characteristics of the problems are the same, including large-scale, noisy, and non-differentiable functions with nonlinear constraints. This report describes the development of a common set of optimization tools using object-oriented programming techniques that can be applied to these types of problems. The authors give examples of several applications that are representative of design problems including an inverse scattering problem, a vibration isolation problem, a system identification problem for the correlation of finite element models with test data and the control of a chemical vapor deposition reactor furnace. Because the function evaluations are computationally expensive, they emphasize algorithms that can be adapted to parallel computers.

  3. Global optimization for overall HVAC systems - Part I problem formulation and analysis

    International Nuclear Information System (INIS)

    Lu Lu; Cai Wenjian; Chai, Y.S.; Xie Lihua

    2005-01-01

    This paper presents the global optimization technologies for overall heating, ventilating and air conditioning (HVAC) systems. The objective function of global optimization and constraints are formulated based on mathematical models of the major components. All these models are associated with power consumption components and heat exchangers for transferring cooling load. The characteristics of all the major components are briefly introduced by models, and the interactions between them are analyzed and discussed to show the complications of the problem. According to the characteristics of the operating components, the complicated original optimization problem for overall HVAC systems is transformed and simplified into a compact form ready for optimization

  4. Advanced Topology Optimization Methods for Conceptual Architectural Design

    DEFF Research Database (Denmark)

    Aage, Niels; Amir, Oded; Clausen, Anders

    2015-01-01

    in topological optimization: Interactive control and continuous visualization; embedding flexible voids within the design space; consideration of distinct tension / compression properties; and optimization of dual material systems. In extension, optimization procedures for skeletal structures such as trusses......This paper presents a series of new, advanced topology optimization methods, developed specifically for conceptual architectural design of structures. The proposed computational procedures are implemented as components in the framework of a Grasshopper plugin, providing novel capacities...

  5. Logic-based methods for optimization combining optimization and constraint satisfaction

    CERN Document Server

    Hooker, John

    2011-01-01

    A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible

  6. Trajectory Optimization Based on Multi-Interval Mesh Refinement Method

    Directory of Open Access Journals (Sweden)

    Ningbo Li

    2017-01-01

    Full Text Available In order to improve the optimization accuracy and convergence rate for trajectory optimization of the air-to-air missile, a multi-interval mesh refinement Radau pseudospectral method was introduced. This method made the mesh endpoints converge to the practical nonsmooth points and decreased the overall collocation points to improve convergence rate and computational efficiency. The trajectory was divided into four phases according to the working time of engine and handover of midcourse and terminal guidance, and then the optimization model was built. The multi-interval mesh refinement Radau pseudospectral method with different collocation points in each mesh interval was used to solve the trajectory optimization model. Moreover, this method was compared with traditional h method. Simulation results show that this method can decrease the dimensionality of nonlinear programming (NLP problem and therefore improve the efficiency of pseudospectral methods for solving trajectory optimization problems.

  7. Complex Method Mixed with PSO Applying to Optimization Design of Bridge Crane Girder

    Directory of Open Access Journals (Sweden)

    He Yan

    2017-01-01

    Full Text Available In engineer design, basic complex method has not enough global search ability for the nonlinear optimization problem, so it mixed with particle swarm optimization (PSO has been presented in the paper,that is the optimal particle evaluated from fitness function of particle swarm displacement complex vertex in order to realize optimal principle of the largest complex central distance.This method is applied to optimization design problems of box girder of bridge crane with constraint conditions.At first a mathematical model of the girder optimization has been set up,in which box girder cross section area of bridge crane is taken as the objective function, and its four sizes parameters as design variables, girder mechanics performance, manufacturing process, border sizes and so on requirements as constraint conditions. Then complex method mixed with PSO is used to solve optimization design problem of cane box girder from constrained optimization studying approach, and its optimal results have achieved the goal of lightweight design and reducing the crane manufacturing cost . The method is reliable, practical and efficient by the practical engineer calculation and comparative analysis with basic complex method.

  8. Global optimization of maintenance and surveillance testing based on reliability and probabilistic safety assessment. Research project

    International Nuclear Information System (INIS)

    Martorell, S.; Serradell, V.; Munoz, A.; Sanchez, A.

    1997-01-01

    Background, objective, scope, detailed working plan and follow-up and final product of the project ''Global optimization of maintenance and surveillance testing based on reliability and probabilistic safety assessment'' are described

  9. Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants

    Science.gov (United States)

    Lera, Daniela; Sergeyev, Yaroslav D.

    2015-06-01

    In this paper, the global optimization problem miny∈S F (y) with S being a hyperinterval in RN and F (y) satisfying the Lipschitz condition with an unknown Lipschitz constant is considered. It is supposed that the function F (y) can be multiextremal, non-differentiable, and given as a 'black-box'. To attack the problem, a new global optimization algorithm based on the following two ideas is proposed and studied both theoretically and numerically. First, the new algorithm uses numerical approximations to space-filling curves to reduce the original Lipschitz multi-dimensional problem to a univariate one satisfying the Hölder condition. Second, the algorithm at each iteration applies a new geometric technique working with a number of possible Hölder constants chosen from a set of values varying from zero to infinity showing so that ideas introduced in a popular DIRECT method can be used in the Hölder global optimization. Convergence conditions of the resulting deterministic global optimization method are established. Numerical experiments carried out on several hundreds of test functions show quite a promising performance of the new algorithm in comparison with its direct competitors.

  10. Numerical methods of mathematical optimization with Algol and Fortran programs

    CERN Document Server

    Künzi, Hans P; Zehnder, C A; Rheinboldt, Werner

    1971-01-01

    Numerical Methods of Mathematical Optimization: With ALGOL and FORTRAN Programs reviews the theory and the practical application of the numerical methods of mathematical optimization. An ALGOL and a FORTRAN program was developed for each one of the algorithms described in the theoretical section. This should result in easy access to the application of the different optimization methods.Comprised of four chapters, this volume begins with a discussion on the theory of linear and nonlinear optimization, with the main stress on an easily understood, mathematically precise presentation. In addition

  11. Primal Interior-Point Method for Large Sparse Minimax Optimization

    Czech Academy of Sciences Publication Activity Database

    Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan

    2009-01-01

    Roč. 45, č. 5 (2009), s. 841-864 ISSN 0023-5954 R&D Projects: GA AV ČR IAA1030405; GA ČR GP201/06/P397 Institutional research plan: CEZ:AV0Z10300504 Keywords : unconstrained optimization * large-scale optimization * minimax optimization * nonsmooth optimization * interior-point methods * modified Newton methods * variable metric methods * computational experiments Subject RIV: BA - General Mathematics Impact factor: 0.445, year: 2009 http://dml.cz/handle/10338.dmlcz/140034

  12. An Optimized Replica Distribution Method in Cloud Storage System

    Directory of Open Access Journals (Sweden)

    Yan Wang

    2017-01-01

    Full Text Available Aiming at establishing a shared storage environment, cloud storage systems are typical applications of cloud computing. Therefore, data replication technology has become a key research issue in storage systems. Considering the performance of data access and balancing the relationship between replica consistency maintenance costs and the performance of multiple replicas access, the methods of replica catalog design and the information acquisition method are proposed. Moreover, the deputy catalog acquisition method to design and copy the information is given. Then, the nodes with the global replica of the information replicate data resources, which have the high access frequency and the long response time. Afterwards, the Markov chain model is constructed. And a matrix geometric solution is used to export the steady-state solution of the model. The performance parameters in terms of the average response time, finish time, and the replica frequency are given to optimize the number of replicas in the storage system. Finally, numerical results with analysis are proposed to demonstrate the influence of the above parameters on the system performance.

  13. Travelling Methods: Tracing the Globalization of Qualitative Communication Research

    Directory of Open Access Journals (Sweden)

    Bryan C. Taylor

    2016-05-01

    Full Text Available Existing discussion of the relationships between globalization, communication research, and qualitative methods emphasizes two images: the challenges posed by globalization to existing communication theory and research methods, and the impact of post-colonial politics and ethics on qualitative research. We draw in this paper on a third image – qualitative research methods as artifacts of globalization – to explore the globalization of qualitative communication research methods. Following a review of literature which tentatively models this process, we discuss two case studies of qualitative research in the disciplinary subfields of intercultural communication and media audience studies. These cases elaborate the forces which influence the articulation of national, disciplinary, and methodological identities which mediate the globalization of qualitative communication research methods.

  14. Globally Optimal Segmentation of Permanent-Magnet Systems

    DEFF Research Database (Denmark)

    Insinga, Andrea Roberto; Bjørk, Rasmus; Smith, Anders

    2016-01-01

    Permanent-magnet systems are widely used for generation of magnetic fields with specific properties. The reciprocity theorem, an energy-equivalence principle in magnetostatics, can be employed to calculate the optimal remanent flux density of the permanent-magnet system, given any objective...... functional that is linear in the magnetic field. This approach, however, yields a continuously varying remanent flux density, while in practical applications, magnetic assemblies are realized by combining uniformly magnetized segments. The problem of determining the optimal shape of each of these segments...... remains unsolved. We show that the problem of optimal segmentation of a two-dimensional permanent-magnet assembly with respect to a linear objective functional can be reduced to the problem of piecewise linear approximation of a plane curve by perimeter maximization. Once the problem has been cast...

  15. Review of dynamic optimization methods in renewable natural resource management

    Science.gov (United States)

    Williams, B.K.

    1989-01-01

    In recent years, the applications of dynamic optimization procedures in natural resource management have proliferated. A systematic review of these applications is given in terms of a number of optimization methodologies and natural resource systems. The applicability of the methods to renewable natural resource systems are compared in terms of system complexity, system size, and precision of the optimal solutions. Recommendations are made concerning the appropriate methods for certain kinds of biological resource problems.

  16. Optimization and control methods in industrial engineering and construction

    CERN Document Server

    Wang, Xiangyu

    2014-01-01

    This book presents recent advances in optimization and control methods with applications to industrial engineering and construction management. It consists of 15 chapters authored by recognized experts in a variety of fields including control and operation research, industrial engineering, and project management. Topics include numerical methods in unconstrained optimization, robust optimal control problems, set splitting problems, optimum confidence interval analysis, a monitoring networks optimization survey, distributed fault detection, nonferrous industrial optimization approaches, neural networks in traffic flows, economic scheduling of CCHP systems, a project scheduling optimization survey, lean and agile construction project management, practical construction projects in Hong Kong, dynamic project management, production control in PC4P, and target contracts optimization.   The book offers a valuable reference work for scientists, engineers, researchers and practitioners in industrial engineering and c...

  17. Full-step interior-point methods for symmetric optimization

    NARCIS (Netherlands)

    Gu, G.

    2009-01-01

    In [SIAM J. Optim., 16(4):1110--1136 (electronic), 2006] Roos proposed a full-Newton step Infeasible Interior-Point Method (IIPM) for Linear Optimization (LO). It is a primal-dual homotopy method; it differs from the classical IIPMs in that it uses only full steps. This means that no line searches

  18. Exploration of Stellarator Configuration Space with Global Search Methods

    International Nuclear Information System (INIS)

    Mynick, H.E.; Pomphrey, N.; Ethier, S.

    2001-01-01

    An exploration of stellarator configuration space z for quasi-axisymmetric stellarator (QAS) designs is discussed, using methods which provide a more global view of that space. To this end, we have implemented a ''differential evolution'' (DE) search algorithm in an existing stellarator optimizer, which is much less prone to become trapped in local, suboptimal minima of the cost function chi than the local search methods used previously. This search algorithm is complemented by mapping studies of chi over z aimed at gaining insight into the results of the automated searches. We find that a wide range of the attractive QAS configurations previously found fall into a small number of classes, with each class corresponding to a basin of chi(z). We develop maps on which these earlier stellarators can be placed, the relations among them seen, and understanding gained into the physics differences between them. It is also found that, while still large, the region of z space containing practically realizable QAS configurations is much smaller than earlier supposed

  19. A dynamic lattice searching method with rotation operation for optimization of large clusters

    International Nuclear Information System (INIS)

    Wu Xia; Cai Wensheng; Shao Xueguang

    2009-01-01

    Global optimization of large clusters has been a difficult task, though much effort has been paid and many efficient methods have been proposed. During our works, a rotation operation (RO) is designed to realize the structural transformation from decahedra to icosahedra for the optimization of large clusters, by rotating the atoms below the center atom with a definite degree around the fivefold axis. Based on the RO, a development of the previous dynamic lattice searching with constructed core (DLSc), named as DLSc-RO, is presented. With an investigation of the method for the optimization of Lennard-Jones (LJ) clusters, i.e., LJ 500 , LJ 561 , LJ 600 , LJ 665-667 , LJ 670 , LJ 685 , and LJ 923 , Morse clusters, silver clusters by Gupta potential, and aluminum clusters by NP-B potential, it was found that both the global minima with icosahedral and decahedral motifs can be obtained, and the method is proved to be efficient and universal.

  20. Global stability-based design optimization of truss structures using ...

    Indian Academy of Sciences (India)

    model is recommended to optimize the design of truss structure possessing geometric nonlinearity. Keywords. Nonlinear ... Choi (1988) obtained the design sensitivity information using the virtual work principle. ..... Differentiation in MOMs architecture makes it difficult to lay down the different aspects of MOMs' computational ...

  1. Global Launcher Trajectory Optimization for Lunar Base Settlement

    NARCIS (Netherlands)

    Pagano, A.; Mooij, E.

    2010-01-01

    The problem of a mission to the Moon to set a permanent outpost can be tackled by dividing the journey into three phases: the Earth ascent, the Earth-Moon transfer and the lunar landing. In this paper we present an optimization analysis of Earth ascent trajectories of existing launch vehicles

  2. Optimal function explains forest responses to global change

    Science.gov (United States)

    Roderick Dewar; Oskar Franklin; Annikki Makela; Ross E. McMurtrie; Harry T. Valentine

    2009-01-01

    Plant responses to global changes in carbon dioxide (CO2), nitrogen, and water availability are critical to future atmospheric CO2 concentrations, hydrology, and hence climate. Our understanding of those responses is incomplete, however. Multiple-resource manipulation experiments and empirical observations have revealed a...

  3. Gradient-based methods for production optimization of oil reservoirs

    Energy Technology Data Exchange (ETDEWEB)

    Suwartadi, Eka

    2012-07-01

    Production optimization for water flooding in the secondary phase of oil recovery is the main topic in this thesis. The emphasis has been on numerical optimization algorithms, tested on case examples using simple hypothetical oil reservoirs. Gradientbased optimization, which utilizes adjoint-based gradient computation, is used to solve the optimization problems. The first contribution of this thesis is to address output constraint problems. These kinds of constraints are natural in production optimization. Limiting total water production and water cut at producer wells are examples of such constraints. To maintain the feasibility of an optimization solution, a Lagrangian barrier method is proposed to handle the output constraints. This method incorporates the output constraints into the objective function, thus avoiding additional computations for the constraints gradient (Jacobian) which may be detrimental to the efficiency of the adjoint method. The second contribution is the study of the use of second-order adjoint-gradient information for production optimization. In order to speedup convergence rate in the optimization, one usually uses quasi-Newton approaches such as BFGS and SR1 methods. These methods compute an approximation of the inverse of the Hessian matrix given the first-order gradient from the adjoint method. The methods may not give significant speedup if the Hessian is ill-conditioned. We have developed and implemented the Hessian matrix computation using the adjoint method. Due to high computational cost of the Newton method itself, we instead compute the Hessian-timesvector product which is used in a conjugate gradient algorithm. Finally, the last contribution of this thesis is on surrogate optimization for water flooding in the presence of the output constraints. Two kinds of model order reduction techniques are applied to build surrogate models. These are proper orthogonal decomposition (POD) and the discrete empirical interpolation method (DEIM

  4. Step-by-step optimization and global chaos of nonlinear parameters in exact calculations of few-particle systems

    International Nuclear Information System (INIS)

    Frolov, A.M.

    1986-01-01

    Exact variational calculations are treated for few-particle systems in the exponential basis of relative coordinates using nonlinear parameters. The methods of step-by-step optimization and global chaos of nonlinear parameters are applied to calculate the S and P states of ppμ, ddμ, ttμ homonuclear mesomolecules within the error ≤±0.001 eV. The global chaos method turned out to be well applicable to nuclear 3 H and 3 He systems

  5. The method of global learning in teaching foreign languages

    Directory of Open Access Journals (Sweden)

    Tatjana Dragovič

    2001-12-01

    Full Text Available The authors describe the method of global learning of foreign languages, which is based on the principles of neurolinguistic programming (NLP. According to this theory, the educator should use the method of the so-called periphery learning, where students learn relaxation techniques and at the same time they »incidentally « or subconsciously learn a foreign language. The method of global learning imitates successful strategies of learning in early childhood and therefore creates a relaxed attitude towards learning. Global learning is also compared with standard methods.

  6. Probabilistic methods for maintenance program optimization

    International Nuclear Information System (INIS)

    Liming, J.K.; Smith, M.J.; Gekler, W.C.

    1989-01-01

    In today's regulatory and economic environments, it is more important than ever that managers, engineers, and plant staff join together in developing and implementing effective management plans for safety and economic risk. This need applied to both power generating stations and other process facilities. One of the most critical parts of these management plans is the development and continuous enhancement of a maintenance program that optimizes plant or facility safety and profitability. The ultimate objective is to maximize the potential for station or facility success, usually measured in terms of projected financial profitability, while meeting or exceeding meaningful and reasonable safety goals, usually measured in terms of projected damage or consequence frequencies. This paper describes the use of the latest concepts in developing and evaluating maintenance programs to achieve maintenance program optimization (MPO). These concepts are based on significant field experience gained through the integration and application of fundamentals developed for industry and Electric Power Research Institute (EPRI)-sponsored projects on preventive maintenance (PM) program development and reliability-centered maintenance (RCM)

  7. Mixed methods for viscoelastodynamics and topology optimization

    Directory of Open Access Journals (Sweden)

    Giacomo Maurelli

    2014-07-01

    Full Text Available A truly-mixed approach for the analysis of viscoelastic structures and continua is presented. An additive decomposition of the stress state into a viscoelastic part and a purely elastic one is introduced along with an Hellinger-Reissner variational principle wherein the stress represents the main variable of the formulation whereas the kinematic descriptor (that in the case at hand is the velocity field acts as Lagrange multiplier. The resulting problem is a Differential Algebraic Equation (DAE because of the need to introduce static Lagrange multipliers to comply with the Cauchy boundary condition on the stress. The associated eigenvalue problem is known in the literature as constrained eigenvalue problem and poses several difficulties for its solution that are addressed in the paper. The second part of the paper proposes a topology optimization approach for the rationale design of viscoelastic structures and continua. Details concerning density interpolation, compliance problems and eigenvalue-based objectives are given. Worked numerical examples are presented concerning both the dynamic analysis of viscoelastic structures and their topology optimization.

  8. Branch-and-Bound interval global optimization on shared memory multiprocessors

    NARCIS (Netherlands)

    Casado, L.G.; Martinez, J.A.; García, I.; Hendrix, E.M.T.

    2008-01-01

    The focus of this paper is on the analysis and evaluation of a type of parallel strategies applied to the algorithm Advanced Multidimensional Interval analysis Global Optimization (AMIGO). We investigate two parallel versions of AMIGO, called Parallel AMIGO (PAMIGO) algorithm, Global-PAMIGO and

  9. Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front.

    Science.gov (United States)

    Saborido, Rubén; Ruiz, Ana B; Luque, Mariano

    2017-01-01

    In this article, we propose a new evolutionary algorithm for multiobjective optimization called Global WASF-GA ( global weighting achievement scalarizing function genetic algorithm), which falls within the aggregation-based evolutionary algorithms. The main purpose of Global WASF-GA is to approximate the whole Pareto optimal front. Its fitness function is defined by an achievement scalarizing function (ASF) based on the Tchebychev distance, in which two reference points are considered (both utopian and nadir objective vectors) and the weight vector used is taken from a set of weight vectors whose inverses are well-distributed. At each iteration, all individuals are classified into different fronts. Each front is formed by the solutions with the lowest values of the ASF for the different weight vectors in the set, using the utopian vector and the nadir vector as reference points simultaneously. Varying the weight vector in the ASF while considering the utopian and the nadir vectors at the same time enables the algorithm to obtain a final set of nondominated solutions that approximate the whole Pareto optimal front. We compared Global WASF-GA to MOEA/D (different versions) and NSGA-II in two-, three-, and five-objective problems. The computational results obtained permit us to conclude that Global WASF-GA gets better performance, regarding the hypervolume metric and the epsilon indicator, than the other two algorithms in many cases, especially in three- and five-objective problems.

  10. Computation of Optimal Monotonicity Preserving General Linear Methods

    KAUST Repository

    Ketcheson, David I.

    2009-07-01

    Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal methods even among classes involving very high order accuracy and that use many steps and/or stages. The optimality of some recently proposed methods is verified, and many more efficient methods are found. We use similar algorithms to find optimal strong stability preserving linear multistep methods of both explicit and implicit type, including methods for hyperbolic PDEs that use downwind-biased operators.

  11. Present-day Problems and Methods of Optimization in Mechatronics

    Directory of Open Access Journals (Sweden)

    Tarnowski Wojciech

    2017-06-01

    Full Text Available It is justified that design is an inverse problem, and the optimization is a paradigm. Classes of design problems are proposed and typical obstacles are recognized. Peculiarities of the mechatronic designing are specified as a proof of a particle importance of optimization in the mechatronic design. Two main obstacles of optimization are discussed: a complexity of mathematical models and an uncertainty of the value system, in concrete case. Then a set of non-standard approaches and methods are presented and discussed, illustrated by examples: a fuzzy description, a constraint-based iterative optimization, AHP ranking method and a few MADM functions in Matlab.

  12. Control Methods Utilizing Energy Optimizing Schemes in Refrigeration Systems

    DEFF Research Database (Denmark)

    Larsen, L.S; Thybo, C.; Stoustrup, Jakob

    2003-01-01

    The potential energy savings in refrigeration systems using energy optimal control has been proved to be substantial. This however requires an intelligent control that drives the refrigeration systems towards the energy optimal state. This paper proposes an approach for a control, which drives...... the condenser pressure towards an optimal state. The objective of this is to present a feasible method that can be used for energy optimizing control. A simulation model of a simple refrigeration system will be used as basis for testing the control method....

  13. The method of global learning in teaching foreign languages

    OpenAIRE

    Tatjana Dragovič; Jelica Pegan Šternberger

    2001-01-01

    The authors describe the method of global learning of foreign languages, which is based on the principles of neurolinguistic programming (NLP). According to this theory, the educator should use the method of the so-called periphery learning, where students learn relaxation techniques and at the same time they »incidentally « or subconsciously learn a foreign language. The method of global learning imitates successful strategies of learning in early childhood and therefore creates a relaxed at...

  14. Global optimization of cyclic Kannan nonexpansive mappings in ...

    African Journals Online (AJOL)

    Consider a self-mapping T defined on a union of two subsets A and B of a Banach space such that T(A) ⊆ B and T(B) ⊆ A. In this work we survey the existence of an optimal approximate solution, known as a best proximity point for a class of cyclic mappings, called cyclic Kannan nonexpansive mappings, in Banach spaces ...

  15. Fast sequential Monte Carlo methods for counting and optimization

    CERN Document Server

    Rubinstein, Reuven Y; Vaisman, Radislav

    2013-01-01

    A comprehensive account of the theory and application of Monte Carlo methods Based on years of research in efficient Monte Carlo methods for estimation of rare-event probabilities, counting problems, and combinatorial optimization, Fast Sequential Monte Carlo Methods for Counting and Optimization is a complete illustration of fast sequential Monte Carlo techniques. The book provides an accessible overview of current work in the field of Monte Carlo methods, specifically sequential Monte Carlo techniques, for solving abstract counting and optimization problems. Written by authorities in the

  16. A new secant method for unconstrained optimization

    OpenAIRE

    Vavasis, Stephen A.

    2008-01-01

    We present a gradient-based algorithm for unconstrained minimization derived from iterated linear change of basis. The new method is equivalent to linear conjugate gradient in the case of a quadratic objective function. In the case of exact line search it is a secant method. In practice, it performs comparably to BFGS and DFP and is sometimes more robust.

  17. A method optimization study for atomic absorption ...

    African Journals Online (AJOL)

    Sadia Ata

    2014-04-24

    Apr 24, 2014 ... Abstract A sensitive, reliable and relative fast method has been developed for the determination of total zinc in insulin by atomic absorption spectrophotometer. This designed study was used to opti- mize the procedures for the existing methods. Spectrograms of both standard and sample solutions.

  18. Optimizing Usability Studies by Complementary Evaluation Methods

    NARCIS (Netherlands)

    Schmettow, Martin; Bach, Cedric; Scapin, Dominique

    2014-01-01

    This paper examines combinations of complementary evaluation methods as a strategy for efficient usability problem discovery. A data set from an earlier study is re-analyzed, involving three evaluation methods applied to two virtual environment applications. Results of a mixed-effects logistic

  19. A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Santhan Kumar Cherukuri

    2016-11-01

    Full Text Available To harvest maximum amount of solar energy and to attain higher efficiency, photovoltaic generation (PVG systems are to be operated at their maximum power  point (MPP under both variable climatic and partial shaded condition (PSC. From literature most of conventional MPP tracking (MPPT methods are able to guarantee MPP successfully under uniform shading condition but fails to get global MPP as they may trap at local MPP under PSC, which adversely deteriorates the efficiency of Photovoltaic Generation (PVG system. In this paper a novel MPPT based on Whale Optimization Algorithm (WOA is proposed to analyze analytic modeling of PV system considering both series and shunt resistances for MPP tracking under PSC. The proposed algorithm is tested on 6S, 3S2P and 2S3P Photovoltaic array configurations for different shading patterns and results are presented. To compare the performance, GWO and PSO MPPT algorithms are also simulated and results are also presented.  From the results it is noticed that proposed MPPT method is superior to other MPPT methods with reference to accuracy and tracking speed. Article History: Received July 23rd 2016; Received in revised form September 15th 2016; Accepted October 1st 2016; Available online How to Cite This Article: Kumar, C.H.S and Rao, R.S. (2016 A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm. Int. Journal of Renewable Energy Development, 5(3, 225-232. http://dx.doi.org/10.14710/ijred.5.3.225-232

  20. Intelligent optimization models based on hard-ridge penalty and RBF for forecasting global solar radiation

    International Nuclear Information System (INIS)

    Jiang, He; Dong, Yao; Wang, Jianzhou; Li, Yuqin

    2015-01-01

    Highlights: • CS-hard-ridge-RBF and DE-hard-ridge-RBF are proposed to forecast solar radiation. • Pearson and Apriori algorithm are used to analyze correlations between the data. • Hard-ridge penalty is added to reduce the number of nodes in the hidden layer. • CS algorithm and DE algorithm are used to determine the optimal parameters. • Proposed two models have higher forecasting accuracy than RBF and hard-ridge-RBF. - Abstract: Due to the scarcity of equipment and the high costs of maintenance, far fewer observations of solar radiation are made than observations of temperature, precipitation and other weather factors. Therefore, it is increasingly important to study several relevant meteorological factors to accurately forecast solar radiation. For this research, monthly average global solar radiation and 12 meteorological parameters from 1998 to 2010 at four sites in the United States were collected. Pearson correlation coefficients and Apriori association rules were successfully used to analyze correlations between the data, which provided a basis for these relative parameters as input variables. Two effective and innovative methods were developed to forecast monthly average global solar radiation by converting a RBF neural network into a multiple linear regression problem, adding a hard-ridge penalty to reduce the number of nodes in the hidden layer, and applying intelligent optimization algorithms, such as the cuckoo search algorithm (CS) and differential evolution (DE), to determine the optimal center and scale parameters. The experimental results show that the proposed models produce much more accurate forecasts than other models

  1. Design and Optimization Method of a Two-Disk Rotor System

    Science.gov (United States)

    Huang, Jingjing; Zheng, Longxi; Mei, Qing

    2016-04-01

    An integrated analytical method based on multidisciplinary optimization software Isight and general finite element software ANSYS was proposed in this paper. Firstly, a two-disk rotor system was established and the mode, humorous response and transient response at acceleration condition were analyzed with ANSYS. The dynamic characteristics of the two-disk rotor system were achieved. On this basis, the two-disk rotor model was integrated to the multidisciplinary design optimization software Isight. According to the design of experiment (DOE) and the dynamic characteristics, the optimization variables, optimization objectives and constraints were confirmed. After that, the multi-objective design optimization of the transient process was carried out with three different global optimization algorithms including Evolutionary Optimization Algorithm, Multi-Island Genetic Algorithm and Pointer Automatic Optimizer. The optimum position of the two-disk rotor system was obtained at the specified constraints. Meanwhile, the accuracy and calculation numbers of different optimization algorithms were compared. The optimization results indicated that the rotor vibration reached the minimum value and the design efficiency and quality were improved by the multidisciplinary design optimization in the case of meeting the design requirements, which provided the reference to improve the design efficiency and reliability of the aero-engine rotor.

  2. Models and Methods for Free Material Optimization

    DEFF Research Database (Denmark)

    Weldeyesus, Alemseged Gebrehiwot

    conditions for physical attainability, in the context that, it has to be symmetric and positive semidefinite. FMO problems have been studied for the last two decades in many articles that led to the development of a wide range of models, methods, and theories. As the design variables in FMO are the local...... programs. The method has successfully obtained solutions to large-scale classical FMO problems of simultaneous analysis and design, nested and dual formulations. The second goal is to extend the method and the FMO problem formulations to general laminated shell structures. The thesis additionally addresses...

  3. Flexible and generalized uncertainty optimization theory and methods

    CERN Document Server

    Lodwick, Weldon A

    2017-01-01

    This book presents the theory and methods of flexible and generalized uncertainty optimization. Particularly, it describes the theory of generalized uncertainty in the context of optimization modeling. The book starts with an overview of flexible and generalized uncertainty optimization. It covers uncertainties that are both associated with lack of information and that more general than stochastic theory, where well-defined distributions are assumed. Starting from families of distributions that are enclosed by upper and lower functions, the book presents construction methods for obtaining flexible and generalized uncertainty input data that can be used in a flexible and generalized uncertainty optimization model. It then describes the development of such a model in detail. All in all, the book provides the readers with the necessary background to understand flexible and generalized uncertainty optimization and develop their own optimization model. .

  4. Extremal Optimization: Methods Derived from Co-Evolution

    Energy Technology Data Exchange (ETDEWEB)

    Boettcher, S.; Percus, A.G.

    1999-07-13

    We describe a general-purpose method for finding high-quality solutions to hard optimization problems, inspired by self-organized critical models of co-evolution such as the Bak-Sneppen model. The method, called Extremal Optimization, successively eliminates extremely undesirable components of sub-optimal solutions, rather than ''breeding'' better components. In contrast to Genetic Algorithms which operate on an entire ''gene-pool'' of possible solutions, Extremal Optimization improves on a single candidate solution by treating each of its components as species co-evolving according to Darwinian principles. Unlike Simulated Annealing, its non-equilibrium approach effects an algorithm requiring few parameters to tune. With only one adjustable parameter, its performance proves competitive with, and often superior to, more elaborate stochastic optimization procedures. We demonstrate it here on two classic hard optimization problems: graph partitioning and the traveling salesman problem.

  5. Support method for solving an optimal xenon shutdown problem

    International Nuclear Information System (INIS)

    Dung, L.C.

    1992-01-01

    Since the discovering of the maximum principle by Pontriagin in 1956, methods for solving optimal control problems have been developed fast. There are the efforts to solve an optimal problem of transient process in a nuclear reactor using its ideas. However, the classical maximum principle does not show how to construct an optimal control or suboptimal control with a given exactness. We exploit mainly in the present work the ideas of the support method proposed by Gabasov and Kirillova for linear systems, in order to solve an optimal control problem for non-linear systems. The constructive maximum principle for non-linear dynamic systems with controllable structure received by us in this paper is new result. The ε - maximum principle is used for receiving an 7-phase ε - optimal control of optimal xenon shutdown problem. (author)

  6. An efficient multilevel optimization method for engineering design

    Science.gov (United States)

    Vanderplaats, G. N.; Yang, Y. J.; Kim, D. S.

    1988-01-01

    An efficient multilevel deisgn optimization technique is presented. The proposed method is based on the concept of providing linearized information between the system level and subsystem level optimization tasks. The advantages of the method are that it does not require optimum sensitivities, nonlinear equality constraints are not needed, and the method is relatively easy to use. The disadvantage is that the coupling between subsystems is not dealt with in a precise mathematical manner.

  7. Instrument design optimization with computational methods

    Energy Technology Data Exchange (ETDEWEB)

    Moore, Michael H. [Old Dominion Univ., Norfolk, VA (United States)

    2017-08-01

    Using Finite Element Analysis to approximate the solution of differential equations, two different instruments in experimental Hall C at the Thomas Jefferson National Accelerator Facility are analyzed. The time dependence of density uctuations from the liquid hydrogen (LH2) target used in the Qweak experiment (2011-2012) are studied with Computational Fluid Dynamics (CFD) and the simulation results compared to data from the experiment. The 2.5 kW liquid hydrogen target was the highest power LH2 target in the world and the first to be designed with CFD at Jefferson Lab. The first complete magnetic field simulation of the Super High Momentum Spectrometer (SHMS) is presented with a focus on primary electron beam deflection downstream of the target. The SHMS consists of a superconducting horizontal bending magnet (HB) and three superconducting quadrupole magnets. The HB allows particles scattered at an angle of 5:5 deg to the beam line to be steered into the quadrupole magnets which make up the optics of the spectrometer. Without mitigation, remnant fields from the SHMS may steer the unscattered beam outside of the acceptable envelope on the beam dump and limit beam operations at small scattering angles. A solution is proposed using optimal placement of a minimal amount of shielding iron around the beam line.

  8. External force back-projective composition and globally deformable optimization for 3-D coronary artery reconstruction

    International Nuclear Information System (INIS)

    Yang, Jian; Cong, Weijian; Fan, Jingfan; Liu, Yue; Wang, Yongtian; Chen, Yang

    2014-01-01

    The clinical value of the 3D reconstruction of a coronary artery is important for the diagnosis and intervention of cardiovascular diseases. This work proposes a method based on a deformable model for reconstructing coronary arteries from two monoplane angiographic images acquired from different angles. First, an external force back-projective composition model is developed to determine the external force, for which the force distributions in different views are back-projected to the 3D space and composited in the same coordinate system based on the perspective projection principle of x-ray imaging. The elasticity and bending forces are composited as an internal force to maintain the smoothness of the deformable curve. Second, the deformable curve evolves rapidly toward the true vascular centerlines in 3D space and angiographic images under the combination of internal and external forces. Third, densely matched correspondence among vessel centerlines is constructed using a curve alignment method. The bundle adjustment method is then utilized for the global optimization of the projection parameters and the 3D structures. The proposed method is validated on phantom data and routine angiographic images with consideration for space and re-projection image errors. Experimental results demonstrate the effectiveness and robustness of the proposed method for the reconstruction of coronary arteries from two monoplane angiographic images. The proposed method can achieve a mean space error of 0.564 mm and a mean re-projection error of 0.349 mm. (paper)

  9. Honey Bees Inspired Optimization Method: The Bees Algorithm

    Directory of Open Access Journals (Sweden)

    Ernesto Mastrocinque

    2013-11-01

    Full Text Available Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem.

  10. Shape Optimization of Supersonic Turbines Using Response Surface and Neural Network Methods

    Science.gov (United States)

    Papila, Nilay; Shyy, Wei; Griffin, Lisa W.; Dorney, Daniel J.

    2001-01-01

    Turbine performance directly affects engine specific impulse, thrust-to-weight ratio, and cost in a rocket propulsion system. A global optimization framework combining the radial basis neural network (RBNN) and the polynomial-based response surface method (RSM) is constructed for shape optimization of a supersonic turbine. Based on the optimized preliminary design, shape optimization is performed for the first vane and blade of a 2-stage supersonic turbine, involving O(10) design variables. The design of experiment approach is adopted to reduce the data size needed by the optimization task. It is demonstrated that a major merit of the global optimization approach is that it enables one to adaptively revise the design space to perform multiple optimization cycles. This benefit is realized when an optimal design approaches the boundary of a pre-defined design space. Furthermore, by inspecting the influence of each design variable, one can also gain insight into the existence of multiple design choices and select the optimum design based on other factors such as stress and materials considerations.

  11. A hybrid optimization method for biplanar transverse gradient coil design

    International Nuclear Information System (INIS)

    Qi Feng; Tang Xin; Jin Zhe; Jiang Zhongde; Shen Yifei; Meng Bin; Zu Donglin; Wang Weimin

    2007-01-01

    The optimization of transverse gradient coils is one of the fundamental problems in designing magnetic resonance imaging gradient systems. A new approach is presented in this paper to optimize the transverse gradient coils' performance. First, in the traditional spherical harmonic target field method, high order coefficients, which are commonly ignored, are used in the first stage of the optimization process to give better homogeneity. Then, some cosine terms are introduced into the series expansion of stream function. These new terms provide simulated annealing optimization with new freedoms. Comparison between the traditional method and the optimized method shows that the inhomogeneity in the region of interest can be reduced from 5.03% to 1.39%, the coil efficiency increased from 3.83 to 6.31 mT m -1 A -1 and the minimum distance of these discrete coils raised from 1.54 to 3.16 mm

  12. Optimizing Robinson Operator with Ant Colony Optimization As a Digital Image Edge Detection Method

    Science.gov (United States)

    Yanti Nasution, Tarida; Zarlis, Muhammad; K. M Nasution, Mahyuddin

    2017-12-01

    Edge detection serves to identify the boundaries of an object against a background of mutual overlap. One of the classic method for edge detection is operator Robinson. Operator Robinson produces a thin, not assertive and grey line edge. To overcome these deficiencies, the proposed improvements to edge detection method with the approach graph with Ant Colony Optimization algorithm. The repairs may be performed are thicken the edge and connect the edges cut off. Edge detection research aims to do optimization of operator Robinson with Ant Colony Optimization then compare the output and generated the inferred extent of Ant Colony Optimization can improve result of edge detection that has not been optimized and improve the accuracy of the results of Robinson edge detection. The parameters used in performance measurement of edge detection are morphology of the resulting edge line, MSE and PSNR. The result showed that Robinson and Ant Colony Optimization method produces images with a more assertive and thick edge. Ant Colony Optimization method is able to be used as a method for optimizing operator Robinson by improving the image result of Robinson detection average 16.77 % than classic Robinson result.

  13. Design of articulated mechanisms with a degree of freedom constraint using global optimization

    DEFF Research Database (Denmark)

    Kawamoto, Atsushi; Stolpe, Mathias

    2004-01-01

    This paper deals with design of articulated mechanisms using a truss ground structure representation. The considered mechanism design problem is to maximize the output displacement for a given input force by choosing a prescribed number of truss elements out of all the available elements, so that...... displacements. The problem is formulated as a non-convex mixed integer problem and solved using a convergent deterministic global optimization method based on branch and bound with convex relaxations.......This paper deals with design of articulated mechanisms using a truss ground structure representation. The considered mechanism design problem is to maximize the output displacement for a given input force by choosing a prescribed number of truss elements out of all the available elements, so...

  14. Process control and optimization with simple interval calculation method

    DEFF Research Database (Denmark)

    Pomerantsev, A.; Rodionova, O.; Høskuldsson, Agnar

    2006-01-01

    for the quality improvement in the course of production. The latter is an active quality optimization, which takes into account the actual history of the process. The advocate approach is allied to the conventional method of multivariate statistical process control (MSPC) as it also employs the historical process......Methods of process control and optimization are presented and illustrated with a real world example. The optimization methods are based on the PLS block modeling as well as on the simple interval calculation methods of interval prediction and object status classification. It is proposed to employ...... the series of expanding PLS/SIC models in order to support the on-line process improvements. This method helps to predict the effect of planned actions on the product quality and thus enables passive quality control. We have also considered an optimization approach that proposes the correcting actions...

  15. Process control and optimization with simple interval calculation method

    DEFF Research Database (Denmark)

    Pomerantsev, A.; Rodionova, O.; Høskuldsson, Agnar

    2006-01-01

    Methods of process control and optimization are presented and illustrated with a real world example. The optimization methods are based on the PLS block modeling as well as on the simple interval calculation methods of interval prediction and object status classification. It is proposed to employ...... the series of expanding PLS/SIC models in order to support the on-line process improvements. This method helps to predict the effect of planned actions on the product quality and thus enables passive quality control. We have also considered an optimization approach that proposes the correcting actions...... for the quality improvement in the course of production. The latter is an active quality optimization, which takes into account the actual history of the process. The advocate approach is allied to the conventional method of multivariate statistical process control (MSPC) as it also employs the historical process...

  16. Optimizing Cognitive Rehabilitation: Effective Instructional Methods

    Science.gov (United States)

    Sohlberg, McKay Moore; Turkstra, Lyn S.

    2011-01-01

    Rehabilitation professionals face a key challenge when working with clients with acquired cognitive impairments: how to teach new skills to individuals who have difficulty learning. Unique in its focus, this book presents evidence-based instructional methods specifically designed to help this population learn more efficiently. The expert authors…

  17. Methods for Large-Scale Nonlinear Optimization.

    Science.gov (United States)

    1980-05-01

    haves more like an iterative method since it has the potential of converging in fewer than, or more than, ns - t iterations. Recently, Dembo (1979) has...R., Powell, M. J. D. and Reid, J. K. (1974). On the estimation of sparse Jacobian matrices, J. Inst. Maths Applics., 13, pp. 117-119. Dembo , R. S

  18. Exact and useful optimization methods for microeconomics

    NARCIS (Netherlands)

    Balder, E.J.

    2011-01-01

    This paper points out that the treatment of utility maximization in current textbooks on microeconomic theory is deficient in at least three respects: breadth of coverage, completeness-cum-coherence of solution methods and mathematical correctness. Improvements are suggested in the form of a

  19. Gas/Aerosol partitioning: a simplified method for global modeling

    NARCIS (Netherlands)

    Metzger, S.M.

    2000-01-01

    The main focus of this thesis is the development of a simplified method to routinely calculate gas/aerosol partitioning of multicomponent aerosols and aerosol associated water within global atmospheric chemistry and climate models. Atmospheric aerosols are usually multicomponent mixtures,

  20. Global Energy-Optimal Redundancy Resolution of Hydraulic Manipulators: Experimental Results for a Forestry Manipulator

    Directory of Open Access Journals (Sweden)

    Jarmo Nurmi

    2017-05-01

    Full Text Available This paper addresses the energy-inefficiency problem of four-degrees-of-freedom (4-DOF hydraulic manipulators through redundancy resolution in robotic closed-loop controlled applications. Because conventional methods typically are local and have poor performance for resolving redundancy with respect to minimum hydraulic energy consumption, global energy-optimal redundancy resolution is proposed at the valve-controlled actuator and hydraulic power system interaction level. The energy consumption of the widely popular valve-controlled load-sensing (LS and constant-pressure (CP systems is effectively minimised through cost functions formulated in a discrete-time dynamic programming (DP approach with minimum state representation. A prescribed end-effector path and important actuator constraints at the position, velocity and acceleration levels are also satisfied in the solution. Extensive field experiments performed on a forestry hydraulic manipulator demonstrate the performance of the proposed solution. Approximately 15–30% greater hydraulic energy consumption was observed with the conventional methods in the LS and CP systems. These results encourage energy-optimal redundancy resolution in future robotic applications of hydraulic manipulators.

  1. Nacelle Chine Installation Based on Wind-Tunnel Test Using Efficient Global Optimization

    Science.gov (United States)

    Kanazaki, Masahiro; Yokokawa, Yuzuru; Murayama, Mitsuhiro; Ito, Takeshi; Jeong, Shinkyu; Yamamoto, Kazuomi

    Design exploration of a nacelle chine installation was carried out. The nacelle chine improves stall performance when deploying multi-element high-lift devices. This study proposes an efficient design process using a Kriging surrogate model to determine the nacelle chine installation point in wind-tunnel tests. The design exploration was conducted in a wind-tunnel using the JAXA high-lift aircraft model at the JAXA Large-scale Low-speed Wind Tunnel. The objective was to maximize the maximum lift. The chine installation points were designed on the engine nacelle in the axial and chord-wise direction, while the geometry of the chine was fixed. In the design process, efficient global optimization (EGO) which includes Kriging model and genetic algorithm (GA) was employed. This method makes it possible both to improve the accuracy of the response surface and to explore the global optimum efficiently. Detailed observations of flowfields using the Particle Image Velocimetry method confirmed the chine effect and design results.

  2. Vertical bifacial solar farms: Physics, design, and global optimization

    KAUST Repository

    Khan, M. Ryyan

    2017-09-04

    There have been sustained interest in bifacial solar cell technology since 1980s, with prospects of 30–50% increase in the output power from a stand-alone panel. Moreover, a vertical bifacial panel reduces dust accumulation and provides two output peaks during the day, with the second peak aligned to the peak electricity demand. Recent commercialization and anticipated growth of bifacial panel market have encouraged a closer scrutiny of the integrated power-output and economic viability of bifacial solar farms, where mutual shading will erode some of the anticipated energy gain associated with an isolated, single panel. Towards that goal, in this paper we focus on geography-specific optimization of ground-mounted vertical bifacial solar farms for the entire world. For local irradiance, we combine the measured meteorological data with the clear-sky model. In addition, we consider the effects of direct, diffuse, and albedo light. We assume the panel is configured into sub-strings with bypass-diodes. Based on calculated light collection and panel output, we analyze the optimum farm design for maximum yearly output at any given location in the world. Our results predict that, regardless of the geographical location, a vertical bifacial farm will yield 10–20% more energy than a traditional monofacial farm for a practical row-spacing of 2 m (corresponding to 1.2 m high panels). With the prospect of additional 5–20% energy gain from reduced soiling and tilt optimization, bifacial solar farm do offer a viable technology option for large-scale solar energy generation.

  3. Optimal voxel size for measuring global gray and white matter proton metabolite concentrations using chemical shift imaging

    DEFF Research Database (Denmark)

    Hanson, Lars Peter Grüner; Adalsteinsson, E; Pfefferbaum, A

    2000-01-01

    compared to single voxel methods. In the present study, the optimal voxel size is calculated from segmented human brain data and accompanying field maps. The optimal voxel size is found to be approximately 8 cc, but a wide range of values, 4-64 cc, can be chosen with little increase in estimated......Quantification of gray and white matter levels of spectroscopically visible metabolites can provide important insights into brain development and pathological conditions. Chemical shift imaging offers a gain in efficiency for estimation of global gray and white matter metabolite concentrations...

  4. Optimal control for mathematical models of cancer therapies an application of geometric methods

    CERN Document Server

    Schättler, Heinz

    2015-01-01

    This book presents applications of geometric optimal control to real life biomedical problems with an emphasis on cancer treatments. A number of mathematical models for both classical and novel cancer treatments are presented as optimal control problems with the goal of constructing optimal protocols. The power of geometric methods is illustrated with fully worked out complete global solutions to these mathematically challenging problems. Elaborate constructions of optimal controls and corresponding system responses provide great examples of applications of the tools of geometric optimal control and the outcomes aid the design of simpler, practically realizable suboptimal protocols. The book blends mathematical rigor with practically important topics in an easily readable tutorial style. Graduate students and researchers in science and engineering, particularly biomathematics and more mathematical aspects of biomedical engineering, would find this book particularly useful.

  5. OPTIMAL SIGNAL PROCESSING METHODS IN GPR

    Directory of Open Access Journals (Sweden)

    Saeid Karamzadeh

    2014-01-01

    Full Text Available In the past three decades, a lot of various applications of Ground Penetrating Radar (GPR took place in real life. There are important challenges of this radar in civil applications and also in military applications. In this paper, the fundamentals of GPR systems will be covered and three important signal processing methods (Wavelet Transform, Matched Filter and Hilbert Huang will be compared to each other in order to get most accurate information about objects which are in subsurface or behind the wall.

  6. Optimal PMU Placement with Uncertainty Using Pareto Method

    Directory of Open Access Journals (Sweden)

    A. Ketabi

    2012-01-01

    Full Text Available This paper proposes a method for optimal placement of Phasor Measurement Units (PMUs in state estimation considering uncertainty. State estimation has first been turned into an optimization exercise in which the objective function is selected to be the number of unobservable buses which is determined based on Singular Value Decomposition (SVD. For the normal condition, Differential Evolution (DE algorithm is used to find the optimal placement of PMUs. By considering uncertainty, a multiobjective optimization exercise is hence formulated. To achieve this, DE algorithm based on Pareto optimum method has been proposed here. The suggested strategy is applied on the IEEE 30-bus test system in several case studies to evaluate the optimal PMUs placement.

  7. Advanced Topology Optimization Methods for Conceptual Architectural Design

    DEFF Research Database (Denmark)

    Aage, Niels; Amir, Oded; Clausen, Anders

    2014-01-01

    This paper presents a series of new, advanced topology optimization methods, developed specifically for conceptual architectural design of structures. The proposed computational procedures are implemented as components in the framework of a Grasshopper plugin, providing novel capacities in topolo......This paper presents a series of new, advanced topology optimization methods, developed specifically for conceptual architectural design of structures. The proposed computational procedures are implemented as components in the framework of a Grasshopper plugin, providing novel capacities...

  8. Advanced Topology Optimization Methods for Conceptual Architectural Design

    DEFF Research Database (Denmark)

    Aage, Niels; Amir, Oded; Clausen, Anders

    2015-01-01

    This paper presents a series of new, advanced topology optimization methods, developed specifically for conceptual architectural design of structures. The proposed computational procedures are implemented as components in the framework of a Grasshopper plugin, providing novel capacities in topolo......This paper presents a series of new, advanced topology optimization methods, developed specifically for conceptual architectural design of structures. The proposed computational procedures are implemented as components in the framework of a Grasshopper plugin, providing novel capacities...

  9. Modifying nodal pricing method considering market participants optimality and reliability

    Directory of Open Access Journals (Sweden)

    A. R. Soofiabadi

    2015-06-01

    Full Text Available This paper develops a method for nodal pricing and market clearing mechanism considering reliability of the system. The effects of components reliability on electricity price, market participants’ profit and system social welfare is considered. This paper considers reliability both for evaluation of market participant’s optimality as well as for fair pricing and market clearing mechanism. To achieve fair pricing, nodal price has been obtained through a two stage optimization problem and to achieve fair market clearing mechanism, comprehensive criteria has been introduced for optimality evaluation of market participant. Social welfare of the system and system efficiency are increased under proposed modified nodal pricing method.

  10. Malliavin method for optimal investment in financial markets with memory

    Directory of Open Access Journals (Sweden)

    An Qiguang

    2016-01-01

    Full Text Available We consider a financial market with memory effects in which wealth processes are driven by mean-field stochastic Volterra equations. In this financial market, the classical dynamic programming method can not be used to study the optimal investment problem, because the solution of mean-field stochastic Volterra equation is not a Markov process. In this paper, a new method through Malliavin calculus introduced in [1], can be used to obtain the optimal investment in a Volterra type financial market. We show a sufficient and necessary condition for the optimal investment in this financial market with memory by mean-field stochastic maximum principle.

  11. Method and system for SCR optimization

    Science.gov (United States)

    Lefebvre, Wesley Curt [Boston, MA; Kohn, Daniel W [Cambridge, MA

    2009-03-10

    Methods and systems are provided for controlling SCR performance in a boiler. The boiler includes one or more generally cross sectional areas. Each cross sectional area can be characterized by one or more profiles of one or more conditions affecting SCR performance and be associated with one or more adjustable desired profiles of the one or more conditions during the operation of the boiler. The performance of the boiler can be characterized by boiler performance parameters. A system in accordance with one or more embodiments of the invention can include a controller input for receiving a performance goal for the boiler corresponding to at least one of the boiler performance parameters and for receiving data values corresponding to boiler control variables and to the boiler performance parameters. The boiler control variables include one or more current profiles of the one or more conditions. The system also includes a system model that relates one or more profiles of the one or more conditions in the boiler to the boiler performance parameters. The system also includes an indirect controller that determines one or more desired profiles of the one or more conditions to satisfy the performance goal for the boiler. The indirect controller uses the system model, the received data values and the received performance goal to determine the one or more desired profiles of the one or more conditions. The system model also includes a controller output that outputs the one or more desired profiles of the one or more conditions.

  12. Detailed design of a lattice composite fuselage structure by a mixed optimization method

    Science.gov (United States)

    Liu, D.; Lohse-Busch, H.; Toropov, V.; Hühne, C.; Armani, U.

    2016-10-01

    In this article, a procedure for designing a lattice fuselage barrel is developed. It comprises three stages: first, topology optimization of an aircraft fuselage barrel is performed with respect to weight and structural performance to obtain the conceptual design. The interpretation of the optimal result is given to demonstrate the development of this new lattice airframe concept for the fuselage barrel. Subsequently, parametric optimization of the lattice aircraft fuselage barrel is carried out using genetic algorithms on metamodels generated with genetic programming from a 101-point optimal Latin hypercube design of experiments. The optimal design is achieved in terms of weight savings subject to stability, global stiffness and strain requirements, and then verified by the fine mesh finite element simulation of the lattice fuselage barrel. Finally, a practical design of the composite skin complying with the aircraft industry lay-up rules is presented. It is concluded that the mixed optimization method, combining topology optimization with the global metamodel-based approach, allows the problem to be solved with sufficient accuracy and provides the designers with a wealth of information on the structural behaviour of the novel anisogrid composite fuselage design.

  13. Optimization of an artificial neural network dedicated to the multivariate forecasting of daily global radiation

    International Nuclear Information System (INIS)

    Voyant, Cyril; Muselli, Marc; Paoli, Christophe; Nivet, Marie-Laure

    2011-01-01

    This paper presents an application of Artificial Neural Networks (ANNs) to predict daily solar radiation. We look at the Multi-Layer Perceptron (MLP) network which is the most used of ANNs architectures. In previous studies, we have developed an ad-hoc time series preprocessing and optimized a MLP with endogenous inputs in order to forecast the solar radiation on a horizontal surface. We propose in this paper to study the contribution of exogenous meteorological data (multivariate method) as time series to our optimized MLP and compare with different forecasting methods: a naive forecaster (persistence), ARIMA reference predictor, an ANN with preprocessing using only endogenous inputs (univariate method) and an ANN with preprocessing using endogenous and exogenous inputs. The use of exogenous data generates an nRMSE decrease between 0.5% and 1% for two stations during 2006 and 2007 (Corsica Island, France). The prediction results are also relevant for the concrete case of a tilted PV wall (1.175 kWp). The addition of endogenous and exogenous data allows a 1% decrease of the nRMSE over a 6 months-cloudy period for the power production. While the use of exogenous data shows an interest in winter, endogenous data as inputs on a preprocessed ANN seem sufficient in summer. -- Research highlights: → Use of exogenous data as ANN inputs to forecast horizontal daily global irradiation data. → New methodology allowing to choice the adequate exogenous data - a systematic method comparing endogenous and exogenous data. → Different referenced mathematical predictors allows to conclude about the pertinence of the proposed methodology.

  14. Searching for globally optimal functional forms for interatomic potentials using genetic programming with parallel tempering.

    Science.gov (United States)

    Slepoy, A; Peters, M D; Thompson, A P

    2007-11-30

    Molecular dynamics and other molecular simulation methods rely on a potential energy function, based only on the relative coordinates of the atomic nuclei. Such a function, called a force field, approximately represents the electronic structure interactions of a condensed matter system. Developing such approximate functions and fitting their parameters remains an arduous, time-consuming process, relying on expert physical intuition. To address this problem, a functional programming methodology was developed that may enable automated discovery of entirely new force-field functional forms, while simultaneously fitting parameter values. The method uses a combination of genetic programming, Metropolis Monte Carlo importance sampling and parallel tempering, to efficiently search a large space of candidate functional forms and parameters. The methodology was tested using a nontrivial problem with a well-defined globally optimal solution: a small set of atomic configurations was generated and the energy of each configuration was calculated using the Lennard-Jones pair potential. Starting with a population of random functions, our fully automated, massively parallel implementation of the method reproducibly discovered the original Lennard-Jones pair potential by searching for several hours on 100 processors, sampling only a minuscule portion of the total search space. This result indicates that, with further improvement, the method may be suitable for unsupervised development of more accurate force fields with completely new functional forms. Copyright (c) 2007 Wiley Periodicals, Inc.

  15. Numerical optimization methods for controlled systems with parameters

    Science.gov (United States)

    Tyatyushkin, A. I.

    2017-10-01

    First- and second-order numerical methods for optimizing controlled dynamical systems with parameters are discussed. In unconstrained-parameter problems, the control parameters are optimized by applying the conjugate gradient method. A more accurate numerical solution in these problems is produced by Newton's method based on a second-order functional increment formula. Next, a general optimal control problem with state constraints and parameters involved on the righthand sides of the controlled system and in the initial conditions is considered. This complicated problem is reduced to a mathematical programming one, followed by the search for optimal parameter values and control functions by applying a multimethod algorithm. The performance of the proposed technique is demonstrated by solving application problems.

  16. Method for Determining Optimal Residential Energy Efficiency Retrofit Packages

    Energy Technology Data Exchange (ETDEWEB)

    Polly, B.; Gestwick, M.; Bianchi, M.; Anderson, R.; Horowitz, S.; Christensen, C.; Judkoff, R.

    2011-04-01

    Businesses, government agencies, consumers, policy makers, and utilities currently have limited access to occupant-, building-, and location-specific recommendations for optimal energy retrofit packages, as defined by estimated costs and energy savings. This report describes an analysis method for determining optimal residential energy efficiency retrofit packages and, as an illustrative example, applies the analysis method to a 1960s-era home in eight U.S. cities covering a range of International Energy Conservation Code (IECC) climate regions. The method uses an optimization scheme that considers average energy use (determined from building energy simulations) and equivalent annual cost to recommend optimal retrofit packages specific to the building, occupants, and location. Energy savings and incremental costs are calculated relative to a minimum upgrade reference scenario, which accounts for efficiency upgrades that would occur in the absence of a retrofit because of equipment wear-out and replacement with current minimum standards.

  17. Closed Loop Optimal Control of a Stewart Platform Using an Optimal Feedback Linearization Method

    Directory of Open Access Journals (Sweden)

    Hami Tourajizadeh

    2016-06-01

    Full Text Available Optimal control of a Stewart robot is performed in this paper using a sequential optimal feedback linearization method considering the jack dynamics. One of the most important applications of a Stewart platform is tracking a machine along a specific path or from a defined point to another point. However, the control procedure of these robots is more challenging than that of serial robots since their dynamics are extremely complicated and non-linear. In addition, saving energy, together with achieving the desired accuracy, is one of the most desirable objectives. In this paper, a proper non-linear optimal control is employed to gain the maximum accuracy by applying the minimum force distribution to the jacks. Dynamics of the jacks are included in this paper to achieve more accurate results. Optimal control is performed for a six-DOF hexapod robot and its accuracy is increased using a sequential feedback linearization method, while its energy optimization is realized using the LQR method for the linearized system. The efficiency of the proposed optimal control is verified by simulating a six-DOF hexapod robot in MATLAB, and its related results are gained and analysed. The actual position of the end-effector, its velocity, the initial and final forces of the jacks and the length and velocity of the jacks are obtained and then compared with open loop and non-optimized systems; analytical comparisons show the efficiency of the proposed methods.

  18. Derived Optimal Linear Combination Evapotranspiration (DOLCE): a global gridded synthesis ET estimate

    Science.gov (United States)

    Hobeichi, Sanaa; Abramowitz, Gab; Evans, Jason; Ukkola, Anna

    2018-02-01

    Accurate global gridded estimates of evapotranspiration (ET) are key to understanding water and energy budgets, in addition to being required for model evaluation. Several gridded ET products have already been developed which differ in their data requirements, the approaches used to derive them and their estimates, yet it is not clear which provides the most reliable estimates. This paper presents a new global ET dataset and associated uncertainty with monthly temporal resolution for 2000-2009. Six existing gridded ET products are combined using a weighting approach trained by observational datasets from 159 FLUXNET sites. The weighting method is based on a technique that provides an analytically optimal linear combination of ET products compared to site data and accounts for both the performance differences and error covariance between the participating ET products. We examine the performance of the weighting approach in several in-sample and out-of-sample tests that confirm that point-based estimates of flux towers provide information on the grid scale of these products. We also provide evidence that the weighted product performs better than its six constituent ET product members in four common metrics. Uncertainty in the ET estimate is derived by rescaling the spread of participating ET products so that their spread reflects the ability of the weighted mean estimate to match flux tower data. While issues in observational data and any common biases in participating ET datasets are limitations to the success of this approach, future datasets can easily be incorporated and enhance the derived product.

  19. Multimode fiber modal decomposition based on hybrid genetic global optimization algorithm

    Science.gov (United States)

    Li, Lei; Leng, Jinyong; Zhou, Pu; Chen, Jinbao

    2017-10-01

    Numerical modal decomposition (MD) is an effective approach to reveal modal characteristics in high power fiber lasers. The main challenge is to find a suitable multi-dimensional optimization algorithm to reveal exact superposition of eigenmodes, especially for multimode fiber. A novel hybrid genetic global optimization algorithm, named GA-SPGD, which combines the advantages of genetic algorithm (GA) and stochastic parallel gradient descent (SPGD) algorithm, is firstly proposed to reduce local minima possibilities from sensitivity initial values. Firstly, GA is applied to search the rough global optimization position based on near-far-field intensity distribution with high accuracy. Upon those initial values, SPGD algorithm is afterwards used to find the exact optimization values based on near-field intensity distribution with fast convergence speed. Numerical simulations validate the feasibility and reliability.

  20. Fast optimization of binary clusters using a novel dynamic lattice searching method

    International Nuclear Information System (INIS)

    Wu, Xia; Cheng, Wen

    2014-01-01

    Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd) 79 clusters with DFT-fit parameters of Gupta potential

  1. On some other preferred method for optimizing the welded joint

    Directory of Open Access Journals (Sweden)

    Pejović Branko B.

    2016-01-01

    Full Text Available The paper shows an example of performed optimization of sizes in terms of welding costs in a characteristic loaded welded joint. Hence, in the first stage, the variables and constant parameters are defined, and mathematical shape of the optimization function is determined. The following stage of the procedure defines and places the most important constraint functions that limit the design of structures, that the technologist and the designer should take into account. Subsequently, a mathematical optimization model of the problem is derived, that is efficiently solved by a proposed method of geometric programming. Further, a mathematically based thorough optimization algorithm is developed of the proposed method, with a main set of equations defining the problem that are valid under certain conditions. Thus, the primary task of optimization is reduced to the dual task through a corresponding function, which is easier to solve than the primary task of the optimized objective function. The main reason for this is a derived set of linear equations. Apparently, a correlation is used between the optimal primary vector that minimizes the objective function and the dual vector that maximizes the dual function. The method is illustrated on a computational practical example with a different number of constraint functions. It is shown that for the case of a lower level of complexity, a solution is reached through an appropriate maximization of the dual function by mathematical analysis and differential calculus.

  2. A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

    KAUST Repository

    Fowkes, Jaroslav M.

    2012-06-21

    We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations. © 2012 Springer Science+Business Media, LLC.

  3. Application of a Continuous Particle Swarm Optimization (CPSO for the Optimal Coordination of Overcurrent Relays Considering a Penalty Method

    Directory of Open Access Journals (Sweden)

    Abdul Wadood

    2018-04-01

    Full Text Available In an electrical power system, the coordination of the overcurrent relays plays an important role in protecting the electrical system by providing primary as well as backup protection. To reduce power outages, the coordination between these relays should be kept at the optimum value to minimize the total operating time and ensure that the least damage occurs under fault conditions. It is also imperative to ensure that the relay setting does not create an unintentional operation and consecutive sympathy trips. In a power system protection coordination problem, the objective function to be optimized is the sum of the total operating time of all main relays. In this paper, the coordination of overcurrent relays in a ring fed distribution system is formulated as an optimization problem. Coordination is performed using proposed continuous particle swarm optimization. In order to enhance and improve the quality of this solution a local search algorithm (LSA is implanted into the original particle swarm algorithm (PSO and, in addition to the constraints, these are amalgamated into the fitness function via the penalty method. The results achieved from the continuous particle swarm optimization algorithm (CPSO are compared with other evolutionary optimization algorithms (EA and this comparison showed that the proposed scheme is competent in dealing with the relevant problems. From further analyzing the obtained results, it was found that the continuous particle swarm approach provides the most globally optimum solution.

  4. Methods for researching intercultural communication in globalized complex societies

    DEFF Research Database (Denmark)

    Jensen, Iben; Andreasen, Lars Birch

    2014-01-01

    no longer be taken for granted as related to a single ethnic group. Thus, in globalized complex societies, knowledge of ‘the other’ no longer primarily comes from business guides or international literature, but is an integrated part of everyday experiences. If the methods we use in intercultural research......The field of intercultural communication research is challenged theoretically as well as methodologically by global changes such as migration, global mobility, mass media, tourism, etc. According to these changes cultures can no longer be seen as national entities, and cultural identity can...... are not capable of addressing these new realities, research in intercultural communication will have a tendency to reproduce ‘old’ assumptions. The aim of this chapter is to discuss four criteria for developing methods that are relevant to intercultural communication research in complex globalized societies...

  5. A method for optimizing the performance of buildings

    DEFF Research Database (Denmark)

    Pedersen, Frank

    2007-01-01

    This thesis describes a method for optimizing the performance of buildings. Design decisions made in early stages of the building design process have a significant impact on the performance of buildings, for instance, the performance with respect to the energy consumption, economical aspects......, and the indoor environment. The method is intended for supporting design decisions for buildings, by combining methods for calculating the performance of buildings with numerical optimization methods. The method is able to find optimum values of decision variables representing different features of the building...... is calculating using unit prices for construction jobs, which can be found in price catalogues. Simple algebraic expressions are used as models for these prices. The model parameters are found by using data-fitting. In order to solve the optimization problem formulated earlier, a gradient-free sequential...

  6. ROTAX: a nonlinear optimization program by axes rotation method

    International Nuclear Information System (INIS)

    Suzuki, Tadakazu

    1977-09-01

    A nonlinear optimization program employing the axes rotation method has been developed for solving nonlinear problems subject to nonlinear inequality constraints and its stability and convergence efficiency were examined. The axes rotation method is a direct search of the optimum point by rotating the orthogonal coordinate system in a direction giving the minimum objective. The searching direction is rotated freely in multi-dimensional space, so the method is effective for the problems represented with the contours having deep curved valleys. In application of the axes rotation method to the optimization problems subject to nonlinear inequality constraints, an improved version of R.R. Allran and S.E.J. Johnsen's method is used, which deals with a new objective function composed of the original objective and a penalty term to consider the inequality constraints. The program is incorporated in optimization code system SCOOP. (auth.)

  7. Optimization Case Study: ISR Allocation in the Global Force Management Process

    Science.gov (United States)

    2016-09-01

    CASE STUDY: ISR ALLOCATION IN THE GLOBAL FORCE MANAGEMENT PROCESS by Guillermo I. Carrillo September 2016 Thesis Advisor: Walter E. Owen...REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE OPTIMIZATION CASE STUDY: ISR ALLOCATION IN THE GLOBAL FORCE MANAGEMENT PROCESS 5...maximizes the distribution of a finite number of full motion video intelligence, surveillance, and reconnaissance ( ISR ) assets to a prioritized list of

  8. Globally Convergent Variable Metric Method for Nonconvex Nondifferentiable Unconstrained Minimization

    Czech Academy of Sciences Publication Activity Database

    Vlček, Jan; Lukšan, Ladislav

    2001-01-01

    Roč. 111, č. 2 (2001), s. 407-430 ISSN 0022-3239 R&D Projects: GA ČR GA201/00/0080 Institutional research plan: AV0Z1030915 Keywords : nonsmooth minimization * nonconvex minimization * numerical methods * variable metric methods * global convergence Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.568, year: 2001

  9. SOLVING ENGINEERING OPTIMIZATION PROBLEMS WITH THE SWARM INTELLIGENCE METHODS

    Directory of Open Access Journals (Sweden)

    V. Panteleev Andrei

    2017-01-01

    Full Text Available An important stage in problem solving process for aerospace and aerostructures designing is calculating their main charac- teristics optimization. The results of the four constrained optimization problems related to the design of various technical systems: such as determining the best parameters of welded beams, pressure vessel, gear, spring are presented. The purpose of each task is to minimize the cost and weight of the construction. The object functions in optimization practical problem are nonlinear functions with a lot of variables and a complex layer surface indentations. That is why using classical approach for extremum seeking is not efficient. Here comes the necessity of using such methods of optimization that allow to find a near optimal solution in acceptable amount of time with the minimum waste of computer power. Such methods include the methods of Swarm Intelligence: spiral dy- namics algorithm, stochastic diffusion search, hybrid seeker optimization algorithm. The Swarm Intelligence methods are designed in such a way that a swarm consisting of agents carries out the search for extremum. In search for the point of extremum, the parti- cles exchange information and consider their experience as well as the experience of population leader and the neighbors in some area. To solve the listed problems there has been designed a program complex, which efficiency is illustrated by the solutions of four applied problems. Each of the considered applied optimization problems is solved with all the three chosen methods. The ob- tained numerical results can be compared with the ones found in a swarm with a particle method. The author gives recommenda- tions on how to choose methods parameters and penalty function value, which consider inequality constraints.

  10. Protein structure modeling and refinement by global optimization in CASP12.

    Science.gov (United States)

    Hong, Seung Hwan; Joung, InSuk; Flores-Canales, Jose C; Manavalan, Balachandran; Cheng, Qianyi; Heo, Seungryong; Kim, Jong Yun; Lee, Sun Young; Nam, Mikyung; Joo, Keehyoung; Lee, In-Ho; Lee, Sung Jong; Lee, Jooyoung

    2018-03-01

    For protein structure modeling in the CASP12 experiment, we have developed a new protocol based on our previous CASP11 approach. The global optimization method of conformational space annealing (CSA) was applied to 3 stages of modeling: multiple sequence-structure alignment, three-dimensional (3D) chain building, and side-chain re-modeling. For better template selection and model selection, we updated our model quality assessment (QA) method with the newly developed SVMQA (support vector machine for quality assessment). For 3D chain building, we updated our energy function by including restraints generated from predicted residue-residue contacts. New energy terms for the predicted secondary structure and predicted solvent accessible surface area were also introduced. For difficult targets, we proposed a new method, LEEab, where the template term played a less significant role than it did in LEE, complemented by increased contributions from other terms such as the predicted contact term. For TBM (template-based modeling) targets, LEE performed better than LEEab, but for FM targets, LEEab was better. For model refinement, we modified our CASP11 molecular dynamics (MD) based protocol by using explicit solvents and tuning down restraint weights. Refinement results from MD simulations that used a new augmented statistical energy term in the force field were quite promising. Finally, when using inaccurate information (such as the predicted contacts), it was important to use the Lorentzian function for which the maximal penalty arising from wrong information is always bounded. © 2017 Wiley Periodicals, Inc.

  11. Characterization of PV panel and global optimization of its model parameters using genetic algorithm

    International Nuclear Information System (INIS)

    Ismail, M.S.; Moghavvemi, M.; Mahlia, T.M.I.

    2013-01-01

    Highlights: • Genetic Algorithm optimization ability had been utilized to extract parameters of PV panel model. • Effect of solar radiation and temperature variations was taken into account in fitness function evaluation. • We used Matlab-Simulink to simulate operation of the PV-panel to validate results. • Different cases were analyzed to ascertain which of them gives more accurate results. • Accuracy and applicability of this approach to be used as a valuable tool for PV modeling were clearly validated. - Abstract: This paper details an improved modeling technique for a photovoltaic (PV) module; utilizing the optimization ability of a genetic algorithm, with different parameters of the PV module being computed via this approach. The accurate modeling of any PV module is incumbent upon the values of these parameters, as it is imperative in the context of any further studies concerning different PV applications. Simulation, optimization and the design of the hybrid systems that include PV are examples of these applications. The global optimization of the parameters and the applicability for the entire range of the solar radiation and a wide range of temperatures are achievable via this approach. The Manufacturer’s Data Sheet information is used as a basis for the purpose of parameter optimization, with an average absolute error fitness function formulated; and a numerical iterative method used to solve the voltage-current relation of the PV module. The results of single-diode and two-diode models are evaluated in order to ascertain which of them are more accurate. Other cases are also analyzed in this paper for the purpose of comparison. The Matlab–Simulink environment is used to simulate the operation of the PV module, depending on the extracted parameters. The results of the simulation are compared with the Data Sheet information, which is obtained via experimentation in order to validate the reliability of the approach. Three types of PV modules

  12. A class of trust-region methods for parallel optimization

    Energy Technology Data Exchange (ETDEWEB)

    P. D. Hough; J. C. Meza

    1999-03-01

    The authors present a new class of optimization methods that incorporates a Parallel Direct Search (PDS) method within a trust-region Newton framework. This approach combines the inherent parallelism of PDS with the rapid and robust convergence properties of Newton methods. Numerical tests have yielded favorable results for both standard test problems and engineering applications. In addition, the new method appears to be more robust in the presence of noisy functions that are inherent in many engineering simulations.

  13. RELATIVE CAMERA POSE ESTIMATION METHOD USING OPTIMIZATION ON THE MANIFOLD

    Directory of Open Access Journals (Sweden)

    C. Cheng

    2017-05-01

    Full Text Available To solve the problem of relative camera pose estimation, a method using optimization with respect to the manifold is proposed. Firstly from maximum-a-posteriori (MAP model to nonlinear least squares (NLS model, the general state estimation model using optimization is derived. Then the camera pose estimation model is applied to the general state estimation model, while the parameterization of rigid body transformation is represented by Lie group/algebra. The jacobian of point-pose model with respect to Lie group/algebra is derived in detail and thus the optimization model of rigid body transformation is established. Experimental results show that compared with the original algorithms, the approaches with optimization can obtain higher accuracy both in rotation and translation, while avoiding the singularity of Euler angle parameterization of rotation. Thus the proposed method can estimate relative camera pose with high accuracy and robustness.

  14. Oil Reservoir Production Optimization using Single Shooting and ESDIRK Methods

    DEFF Research Database (Denmark)

    Capolei, Andrea; Völcker, Carsten; Frydendall, Jan

    2012-01-01

    the injections and oil production such that flow is uniform in a given geological structure. Even in the case of conventional water flooding, feedback based optimal control technologies may enable higher oil recovery than with conventional operational strategies. The optimal control problems that must be solved......Conventional recovery techniques enable recovery of 10-50% of the oil in an oil field. Advances in smart well technology and enhanced oil recovery techniques enable significant larger recovery. To realize this potential, feedback model-based optimal control technologies are needed to manipulate...... are large-scale problems and require specialized numerical algorithms. In this paper, we combine a single shooting optimization algorithm based on sequential quadratic programming (SQP) with explicit singly diagonally implicit Runge-Kutta (ESDIRK) integration methods and the a continuous adjoint method...

  15. Continuation methods in multiobjective optimization for combined structure control design

    Science.gov (United States)

    Milman, M.; Salama, M.; Scheid, R.; Bruno, R.; Gibson, J. S.

    1990-01-01

    A homotopy approach involving multiobjective functions is developed to outline the methods that have evolved for the combined control-structure optimization of physical systems encountered in the technology of large space structures. A method to effect a timely consideration of the control performance prior to the finalization of the structural design involves integrating the control and structural design processes into a unified design methodology that combines the two optimization problems into a single formulation. This study uses the combined optimization problem as a family of weighted structural and control costs. Connections with vector optimizations are described; an analysis of the zero-set of required conditions is made, and a numerical example is given.

  16. A Finite Element Removal Method for 3D Topology Optimization

    Directory of Open Access Journals (Sweden)

    M. Akif Kütük

    2013-01-01

    Full Text Available Topology optimization provides great convenience to designers during the designing stage in many industrial applications. With this method, designers can obtain a rough model of any part at the beginning of a designing stage by defining loading and boundary conditions. At the same time the optimization can be used for the modification of a product which is being used. Lengthy solution time is a disadvantage of this method. Therefore, the method cannot be widespread. In order to eliminate this disadvantage, an element removal algorithm has been developed for topology optimization. In this study, the element removal algorithm is applied on 3-dimensional parts, and the results are compared with the ones available in the related literature. In addition, the effects of the method on solution times are investigated.

  17. Total-energy global optimizations using nonorthogonal localized orbitals

    International Nuclear Information System (INIS)

    Kim, J.; Mauri, F.; Galli, G.

    1995-01-01

    An energy functional for orbital-based O(N) calculations is proposed, which depends on a number of nonorthogonal, localized orbitals larger than the number of occupied states in the system, and on a parameter, the electronic chemical potential, determining the number of electrons. We show that the minimization of the functional with respect to overlapping localized orbitals can be performed so as to attain directly the ground-state energy, without being trapped at local minima. The present approach overcomes the multiple-minima problem present within the original formulation of orbital-based O(N) methods; it therefore makes it possible to perform O(N) calculations for an arbitrary system, without including any information about the system bonding properties in the construction of the input wave functions. Furthermore, while retaining the same computational cost as the original approach, our formulation allows one to improve the variational estimate of the ground-state energy, and the energy conservation during a molecular dynamics run. Several numerical examples for surfaces, bulk systems, and clusters are presented and discussed

  18. Theoretical properties of the global optimizer of two layer neural network

    OpenAIRE

    Boob, Digvijay; Lan, Guanghui

    2017-01-01

    In this paper, we study the problem of optimizing a two-layer artificial neural network that best fits a training dataset. We look at this problem in the setting where the number of parameters is greater than the number of sampled points. We show that for a wide class of differentiable activation functions (this class involves "almost" all functions which are not piecewise linear), we have that first-order optimal solutions satisfy global optimality provided the hidden layer is non-singular. ...

  19. Optimal Combination of Aircraft Maintenance Tasks by a Novel Simplex Optimization Method

    Directory of Open Access Journals (Sweden)

    Huaiyuan Li

    2015-01-01

    Full Text Available Combining maintenance tasks into work packages is not only necessary for arranging maintenance activities, but also critical for the reduction of maintenance cost. In order to optimize the combination of maintenance tasks by fuzzy C-means clustering algorithm, an improved fuzzy C-means clustering model is introduced in this paper. In order to reduce the dimension, variables representing clustering centers are eliminated in the improved cluster model. So the improved clustering model can be directly solved by the optimization method. To optimize the clustering model, a novel nonlinear simplex optimization method is also proposed in this paper. The novel method searches along all rays emitting from the center to each vertex, and those search directions are rightly n+1 positive basis. The algorithm has both theoretical convergence and good experimental effect. Taking the optimal combination of some maintenance tasks of a certain aircraft as an instance, the novel simplex optimization method and the clustering model both exhibit excellent performance.

  20. Deterministic operations research models and methods in linear optimization

    CERN Document Server

    Rader, David J

    2013-01-01

    Uniquely blends mathematical theory and algorithm design for understanding and modeling real-world problems Optimization modeling and algorithms are key components to problem-solving across various fields of research, from operations research and mathematics to computer science and engineering. Addressing the importance of the algorithm design process. Deterministic Operations Research focuses on the design of solution methods for both continuous and discrete linear optimization problems. The result is a clear-cut resource for understanding three cornerstones of deterministic operations resear

  1. Optimization method for quantitative calculation of clay minerals in soil

    Indian Academy of Sciences (India)

    Therefore, we rec- ommend employing Matlab to solve equations of the kind discussed here. In conclusion, using optimization methods to calculate the clay mineral contents in soil is viable based on the chemical analysis data. Further stud- ies combining this method with X-ray diffraction, differential thermal, and infrared ...

  2. Primal-Dual Interior Point Multigrid Method for Topology Optimization

    Czech Academy of Sciences Publication Activity Database

    Kočvara, Michal; Mohammed, S.

    2016-01-01

    Roč. 38, č. 5 (2016), B685-B709 ISSN 1064-8275 Grant - others:European Commission - EC(XE) 313781 Institutional support: RVO:67985556 Keywords : topology optimization * multigrid method s * interior point method Subject RIV: BA - General Mathematics Impact factor: 2.195, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/kocvara-0462418.pdf

  3. Optimal layout of radiological environment monitoring based on TOPSIS method

    International Nuclear Information System (INIS)

    Li Sufen; Zhou Chunlin

    2006-01-01

    TOPSIS is a method for multi-objective-decision-making, which can be applied to comprehensive assessment of environmental quality. This paper adopts it to get the optimal layout of radiological environment monitoring, it is proved that this method is a correct, simple and convenient, practical one, and beneficial to supervision departments to scientifically and reasonably layout Radiological Environment monitoring sites. (authors)

  4. Optimization method for quantitative calculation of clay minerals in soil

    Indian Academy of Sciences (India)

    In this study, an attempt was made to propose an optimization method for the quantitative determination of clay minerals in soil based on bulk chemical composition data. The fundamental principles and processes of the calculation are elucidated. Some samples were used for reliability verification of the method and the ...

  5. Cost optimal river dike design using probabilistic methods

    NARCIS (Netherlands)

    Bischiniotis, K.; Kanning, W.; Jonkman, S.N.

    2014-01-01

    This research focuses on the optimization of river dikes using probabilistic methods. Its aim is to develop a generic method that automatically estimates the failure probabilities of many river dike cross-sections and gives the one with the least cost, taking into account the boundary conditions and

  6. Global optimal path planning of an autonomous vehicle for overtaking a moving obstacle

    Directory of Open Access Journals (Sweden)

    B. Mashadi

    Full Text Available In this paper, the global optimal path planning of an autonomous vehicle for overtaking a moving obstacle is proposed. In this study, the autonomous vehicle overtakes a moving vehicle by performing a double lane-change maneuver after detecting it in a proper distance ahead. The optimal path of vehicle for performing the lane-change maneuver is generated by a path planning program in which the sum of lateral deviation of the vehicle from a reference path and the rate of steering angle become minimum while the lateral acceleration of vehicle does not exceed a safe limit value. A nonlinear optimal control theory with the lateral vehicle dynamics equations and inequality constraint of lateral acceleration are used to generate the path. The indirect approach for solving the optimal control problem is used by applying the calculus of variation and the Pontryagin's Minimum Principle to obtain first-order necessary conditions for optimality. The optimal path is generated as a global optimal solution and can be used as the benchmark of the path generated by the local motion planning of autonomous vehicles. A full nonlinear vehicle model in CarSim software is used for path following simulation by importing path data from the MATLAB code. The simulation results show that the generated path for the autonomous vehicle satisfies all vehicle dynamics constraints and hence is a suitable overtaking path for the following vehicle.

  7. A solution quality assessment method for swarm intelligence optimization algorithms.

    Science.gov (United States)

    Zhang, Zhaojun; Wang, Gai-Ge; Zou, Kuansheng; Zhang, Jianhua

    2014-01-01

    Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of "value performance," the "ordinal performance" is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and "good enough" set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO), particle swarm optimization (PSO), and artificial fish swarm algorithm (AFS) were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method.

  8. A Combined Method in Parameters Optimization of Hydrocyclone

    Directory of Open Access Journals (Sweden)

    Jing-an Feng

    2016-01-01

    Full Text Available To achieve efficient separation of calcium hydroxide and impurities in carbide slag by using hydrocyclone, the physical granularity property of carbide slag, hydrocyclone operation parameters for slurry concentration, and the slurry velocity inlet are designed to be optimized. The optimization methods are combined with the Design of Experiment (DOE method and the Computational Fluid Dynamics (CFD method. Based on Design Expert software, the central composite design (CCD with three factors and five levels amounting to five groups of 20 test responses was constructed, and the experiments were performed by numerical simulation software FLUENT. Through the analysis of variance deduced from numerical simulation experiment results, the regression equations of pressure drop, overflow concentration, purity, and separation efficiencies of two solid phases were, respectively, obtained. The influences of factors were analyzed by the responses, respectively. Finally, optimized results were obtained by the multiobjective optimization method through the Design Expert software. Based on the optimized conditions, the validation test by numerical simulation and separation experiment were separately proceeded. The results proved that the combined method could be efficiently used in studying the hydrocyclone and it has a good performance in application engineering.

  9. A Solution Quality Assessment Method for Swarm Intelligence Optimization Algorithms

    Directory of Open Access Journals (Sweden)

    Zhaojun Zhang

    2014-01-01

    Full Text Available Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of “value performance,” the “ordinal performance” is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and “good enough” set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO, particle swarm optimization (PSO, and artificial fish swarm algorithm (AFS were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method.

  10. Canonical Duality Theory and Algorithms for Solving Some Challenging Problems in Global Optimization and Decision Science

    Science.gov (United States)

    2015-09-24

    Math, Spain, August-November, 2012 8. Professor R. Chen, City Univ of Hong Kong , November –December 2012 9. Dr. Kun Cai, Northwest A&F University...issues and challenges in global optimization. 16. Colloquium lecture at Shanghai University of Finance , July 17, 2013. 17. Colloquium lecture at China

  11. On estimating workload in branch-and-bound global optimization algorithms

    NARCIS (Netherlands)

    Berenguel, J.L.; Casado, L.G.; Garcia, I.; Hendrix, E.M.T.

    2013-01-01

    In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes

  12. Parameter estimation with a novel gradient-based optimization method for biological lattice-gas cellular automaton models.

    Science.gov (United States)

    Mente, Carsten; Prade, Ina; Brusch, Lutz; Breier, Georg; Deutsch, Andreas

    2011-07-01

    Lattice-gas cellular automata (LGCAs) can serve as stochastic mathematical models for collective behavior (e.g. pattern formation) emerging in populations of interacting cells. In this paper, a two-phase optimization algorithm for global parameter estimation in LGCA models is presented. In the first phase, local minima are identified through gradient-based optimization. Algorithmic differentiation is adopted to calculate the necessary gradient information. In the second phase, for global optimization of the parameter set, a multi-level single-linkage method is used. As an example, the parameter estimation algorithm is applied to a LGCA model for early in vitro angiogenic pattern formation.

  13. A Hybrid Optimization Method for Reactive Power and Voltage Control Considering Power Loss Minimization

    DEFF Research Database (Denmark)

    Liu, Chengxi; Qin, Nan; Bak, Claus Leth

    2015-01-01

    This paper proposes a hybrid optimization method to optimally control the voltage and reactive power with minimum power loss in transmission grid. This approach is used for the Danish automatic voltage control (AVC) system which is typically a non-linear non-convex problem mixed with both...... in the global range. This approach is tested on the detailed model of the western Danish power system in DIgSILENT Powerfactory, where massive discrete components i.e. tap-able transformers and switchable shunts are employed by AVC for loss minimizations....

  14. A novel optimization method, Gravitational Search Algorithm (GSA), for PWR core optimization

    International Nuclear Information System (INIS)

    Mahmoudi, S.M.; Aghaie, M.; Bahonar, M.; Poursalehi, N.

    2016-01-01

    Highlights: • The Gravitational Search Algorithm (GSA) is introduced. • The advantage of GSA is verified in Shekel’s Foxholes. • Reload optimizing in WWER-1000 and WWER-440 cases are performed. • Maximizing K eff , minimizing PPFs and flattening power density is considered. - Abstract: In-core fuel management optimization (ICFMO) is one of the most challenging concepts of nuclear engineering. In recent decades several meta-heuristic algorithms or computational intelligence methods have been expanded to optimize reactor core loading pattern. This paper presents a new method of using Gravitational Search Algorithm (GSA) for in-core fuel management optimization. The GSA is constructed based on the law of gravity and the notion of mass interactions. It uses the theory of Newtonian physics and searcher agents are the collection of masses. In this work, at the first step, GSA method is compared with other meta-heuristic algorithms on Shekel’s Foxholes problem. In the second step for finding the best core, the GSA algorithm has been performed for three PWR test cases including WWER-1000 and WWER-440 reactors. In these cases, Multi objective optimizations with the following goals are considered, increment of multiplication factor (K eff ), decrement of power peaking factor (PPF) and power density flattening. It is notable that for neutronic calculation, PARCS (Purdue Advanced Reactor Core Simulator) code is used. The results demonstrate that GSA algorithm have promising performance and could be proposed for other optimization problems of nuclear engineering field.

  15. Reverse optimization reconstruction method in non-null aspheric interferometry

    Science.gov (United States)

    Zhang, Lei; Liu, Dong; Shi, Tu; Yang, Yongying; Chong, Shiyao; Shen, Yibing; Bai, Jian

    2015-10-01

    Aspheric non-null test achieves more flexible measurements than the null test. However, the precision calibration for retrace error has always been difficult. A reverse optimization reconstruction (ROR) method is proposed for the retrace error calibration as well as the aspheric figure error extraction based on system modeling. An optimization function is set up with system model, in which the wavefront data from experiment is inserted as the optimization objective while the figure error under test in the model as the optimization variable. The optimization is executed by the reverse ray tracing in the system model until the test wavefront in the model is consistent with the one in experiment. At this point, the surface figure error in the model is considered to be consistent with the one in experiment. With the Zernike fitting, the aspheric surface figure error is then reconstructed in the form of Zernike polynomials. Numerical simulations verifying the high accuracy of the ROR method are presented with error considerations. A set of experiments are carried out to demonstrate the validity and repeatability of ROR method. Compared with the results of Zygo interferometer (null test), the measurement error by the ROR method achieves better than 1/10λ.

  16. Structural Topology Optimization Based on the Smoothed Finite Element Method

    Directory of Open Access Journals (Sweden)

    Vahid Shobeiri

    Full Text Available Abstract In this paper, the smoothed finite element method, incorporated with the level set method, is employed to carry out the topology optimization of continuum structures. The structural compliance is minimized subject to a constraint on the weight of material used. The cell-based smoothed finite element method is employed to improve the accuracy and stability of the standard finite element method. Several numerical examples are presented to prove the validity and utility of the proposed method. The obtained results are compared with those obtained by several standard finite element-based examples in order to access the applicability and effectiveness of the proposed method. The common numerical instabilities of the structural topology optimization problems such as checkerboard pattern and mesh dependency are studied in the examples.

  17. Global optimization based on noisy evaluations: An empirical study of two statistical approaches

    International Nuclear Information System (INIS)

    Vazquez, Emmanuel; Villemonteix, Julien; Sidorkiewicz, Maryan; Walter, Eric

    2008-01-01

    The optimization of the output of complex computer codes has often to be achieved with a small budget of evaluations. Algorithms dedicated to such problems have been developed and compared, such as the Expected Improvement algorithm (El) or the Informational Approach to Global Optimization (IAGO). However, the influence of noisy evaluation results on the outcome of these comparisons has often been neglected, despite its frequent appearance in industrial problems. In this paper, empirical convergence rates for El and IAGO are compared when an additive noise corrupts the result of an evaluation. IAGO appears more efficient than El and various modifications of El designed to deal with noisy evaluations. Keywords. Global optimization; computer simulations; kriging; Gaussian process; noisy evaluations.

  18. Global optimization based on noisy evaluations: An empirical study of two statistical approaches

    Science.gov (United States)

    Vazquez, Emmanuel; Villemonteix, Julien; Sidorkiewicz, Maryan; Walter, Éric

    2008-11-01

    The optimization of the output of complex computer codes has often to be achieved with a small budget of evaluations. Algorithms dedicated to such problems have been developed and compared, such as the Expected Improvement algorithm (El) or the Informational Approach to Global Optimization (IAGO). However, the influence of noisy evaluation results on the outcome of these comparisons has often been neglected, despite its frequent appearance in industrial problems. In this paper, empirical convergence rates for El and IAGO are compared when an additive noise corrupts the result of an evaluation. IAGO appears more efficient than El and various modifications of El designed to deal with noisy evaluations. Keywords. Global optimization; computer simulations; kriging; Gaussian process; noisy evaluations.

  19. A fuzzy global efficiency optimization of a photovoltaic water pumping system

    Energy Technology Data Exchange (ETDEWEB)

    Benlarbi, K.; Nait-Said, M.S. [Batna Univ. (Algeria). Dept. of Electrical Engineering; Mokrani, L. [Laghouat Univ. (Algeria). Materials Lab.

    2004-07-01

    This paper presents an on-line fuzzy optimization of the global efficiency of a photovoltaic water pumping system driven by a separately excited DC motor (DCM), a permanent magnet synchronous motor (PMSM), or an induction motor (IM), coupled to a centrifugal pump. The fuzzy optimization procedure stated above, which aims to the maximization of the global efficiency, will lead consequently to maximize the drive speed and the water discharge rate of the coupled centrifugal pump. The proposed solution is based on a judicious fuzzy adjustment of a chopper ratio which adapts on-line the load impedance to the photovoltaic generator (PVG). Simulation results show the effectiveness of the drive system for both transient and steady state operations. Hence it is suitable to use this fuzzy logic procedure as a standard optimization algorithm for such photovoltaic water pumping drives. (author)

  20. Optimization method for electron beam melting and refining of metals

    Science.gov (United States)

    Donchev, Veliko; Vutova, Katia

    2014-03-01

    Pure metals and special alloys obtained by electron beam melting and refining (EBMR) in vacuum, using electron beams as a heating source, have a lot of applications in nuclear and airspace industries, electronics, medicine, etc. An analytical optimization problem for the EBMR process based on mathematical heat model is proposed. The used criterion is integral functional minimization of a partial derivative of the temperature in the metal sample. The investigated technological parameters are the electron beam power, beam radius, the metal casting velocity, etc. The optimization problem is discretized using a non-stationary heat model and corresponding adapted Pismen-Rekford numerical scheme, developed by us and multidimensional trapezional rule. Thus a discrete optimization problem is built where the criterion is a function of technological process parameters. The discrete optimization problem is heuristically solved by cluster optimization method. Corresponding software for the optimization task is developed. The proposed optimization scheme can be applied for quality improvement of the pure metals (Ta, Ti, Cu, etc.) produced by the modern and ecological-friendly EBMR process.

  1. Subpixel displacement measurement method based on the combination of particle swarm optimization and gradient algorithm

    Science.gov (United States)

    Guang, Chen; Qibo, Feng; Keqin, Ding; Zhan, Gao

    2017-10-01

    A subpixel displacement measurement method based on the combination of particle swarm optimization (PSO) and gradient algorithm (GA) was proposed for accuracy and speed optimization in GA, which is a subpixel displacement measurement method better applied in engineering practice. An initial integer-pixel value was obtained according to the global searching ability of PSO, and then gradient operators were adopted for a subpixel displacement search. A comparison was made between this method and GA by simulated speckle images and rigid-body displacement in metal specimens. The results showed that the computational accuracy of the combination of PSO and GA method reached 0.1 pixel in the simulated speckle images, or even 0.01 pixels in the metal specimen. Also, computational efficiency and the antinoise performance of the improved method were markedly enhanced.

  2. METHOD OF CALCULATING THE OPTIMAL HEAT EMISSION GEOTHERMAL WELLS

    Directory of Open Access Journals (Sweden)

    A. I. Akaev

    2015-01-01

    Full Text Available This paper presents a simplified method of calculating the optimal regimes of the fountain and the pumping exploitation of geothermal wells, reducing scaling and corrosion during operation. Comparative characteristics to quantify the heat of formation for these methods of operation under the same pressure at the wellhead. The problem is solved graphic-analytical method based on a balance of pressure in the well with the heat pump. 

  3. Variable Metric Methods for Unconstrained Optimization and Nonlinear Least Squares

    Czech Academy of Sciences Publication Activity Database

    Lukšan, Ladislav; Spedicato, E.

    2000-01-01

    Roč. 124, č. 1-2 (2000), s. 61-95 ISSN 0377-0427 R&D Projects: GA ČR GA201/00/0080 Institutional research plan: AV0Z1030915 Keywords : quasi-Newton methods * variable metric methods * unconstrained optimization * nonlinear least squares * sparse problems * partially separable problems * limited-memory methods Subject RIV: BA - General Mathematics Impact factor: 0.455, year: 2000

  4. Optimization of Inventories for Multiple Companies by Fuzzy Control Method

    OpenAIRE

    Kawase, Koichi; Konishi, Masami; Imai, Jun

    2008-01-01

    In this research, Fuzzy control theory is applied to the inventory control of the supply chain between multiple companies. The proposed control method deals with the amountof inventories expressing supply chain between multiple companies. Referring past demand and tardiness, inventory amounts of raw materials are determined by Fuzzy inference. The method that an appropriate inventory control becomes possible optimizing fuzzy control gain by using SA method for Fuzzy control. The variation of ...

  5. Optimization methods and silicon solar cell numerical models

    Science.gov (United States)

    Girardini, K.; Jacobsen, S. E.

    1986-01-01

    An optimization algorithm for use with numerical silicon solar cell models was developed. By coupling an optimization algorithm with a solar cell model, it is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junction depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm was developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAP1D). SCAP1D uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the performance of a solar cell. A major obstacle is that the numerical methods used in SCAP1D require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the values associated with the maximum efficiency. This problem was alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution.

  6. Cuckoo search with Lévy flights for weighted Bayesian energy functional optimization in global-support curve data fitting.

    Science.gov (United States)

    Gálvez, Akemi; Iglesias, Andrés; Cabellos, Luis

    2014-01-01

    The problem of data fitting is very important in many theoretical and applied fields. In this paper, we consider the problem of optimizing a weighted Bayesian energy functional for data fitting by using global-support approximating curves. By global-support curves we mean curves expressed as a linear combination of basis functions whose support is the whole domain of the problem, as opposed to other common approaches in CAD/CAM and computer graphics driven by piecewise functions (such as B-splines and NURBS) that provide local control of the shape of the curve. Our method applies a powerful nature-inspired metaheuristic algorithm called cuckoo search, introduced recently to solve optimization problems. A major advantage of this method is its simplicity: cuckoo search requires only two parameters, many fewer than other metaheuristic approaches, so the parameter tuning becomes a very simple task. The paper shows that this new approach can be successfully used to solve our optimization problem. To check the performance of our approach, it has been applied to five illustrative examples of different types, including open and closed 2D and 3D curves that exhibit challenging features, such as cusps and self-intersections. Our results show that the method performs pretty well, being able to solve our minimization problem in an astonishingly straightforward way.

  7. A SPICE synthetic dataset to benchmark global tomographic methods

    Science.gov (United States)

    Qin, Y.; Capdeville, Y.; Maupin, V.; Montagner, J.

    2005-12-01

    The different existing global tomographic methods result in different models of the Earth. Within SPICE (Seismic wave Propagation and Imaging in Complex media: a European network), we have decided to perform a benchmark experiment of global tomographic techniques. A global model has been constructed. It includes 3D heterogeneities in velocity, anisotropy and attenuation, as well as topography of discontinuities. Simplified versions of the model will also be used. Synthetic seismograms will be generated at low frequency by the Spectral Element Method, for a realistic distribution of sources and stations. The synthetic seismograms will be made available to the scientific community at the SPICE website www.spice-rtn.org. Any group wishing to test his tomographic algorithm is encouraged to download the synthetic data.

  8. Investigation of Optimal Integrated Circuit Raster Image Vectorization Method

    Directory of Open Access Journals (Sweden)

    Leonas Jasevičius

    2011-03-01

    Full Text Available Visual analysis of integrated circuit layer requires raster image vectorization stage to extract layer topology data to CAD tools. In this paper vectorization problems of raster IC layer images are presented. Various line extraction from raster images algorithms and their properties are discussed. Optimal raster image vectorization method was developed which allows utilization of common vectorization algorithms to achieve the best possible extracted vector data match with perfect manual vectorization results. To develop the optimal method, vectorized data quality dependence on initial raster image skeleton filter selection was assessed.Article in Lithuanian

  9. Optimal mesh hierarchies in Multilevel Monte Carlo methods

    KAUST Repository

    Von Schwerin, Erik

    2016-01-08

    I will discuss how to choose optimal mesh hierarchies in Multilevel Monte Carlo (MLMC) simulations when computing the expected value of a quantity of interest depending on the solution of, for example, an Ito stochastic differential equation or a partial differential equation with stochastic data. I will consider numerical schemes based on uniform discretization methods with general approximation orders and computational costs. I will compare optimized geometric and non-geometric hierarchies and discuss how enforcing some domain constraints on parameters of MLMC hierarchies affects the optimality of these hierarchies. I will also discuss the optimal tolerance splitting between the bias and the statistical error contributions and its asymptotic behavior. This talk presents joint work with N.Collier, A.-L.Haji-Ali, F. Nobile, and R. Tempone.

  10. Coordinated Optimal Operation Method of the Regional Energy Internet

    Directory of Open Access Journals (Sweden)

    Rishang Long

    2017-05-01

    Full Text Available The development of the energy internet has become one of the key ways to solve the energy crisis. This paper studies the system architecture, energy flow characteristics and coordinated optimization method of the regional energy internet. Considering the heat-to-electric ratio of a combined cooling, heating and power unit, energy storage life and real-time electricity price, a double-layer optimal scheduling model is proposed, which includes economic and environmental benefit in the upper layer and energy efficiency in the lower layer. A particle swarm optimizer–individual variation ant colony optimization algorithm is used to solve the computational efficiency and accuracy. Through the calculation and simulation of the simulated system, the energy savings, level of environmental protection and economic optimal dispatching scheme are realized.

  11. Trafficability Analysis at Traffic Crossing and Parameters Optimization Based on Particle Swarm Optimization Method

    Directory of Open Access Journals (Sweden)

    Bin He

    2014-01-01

    Full Text Available In city traffic, it is important to improve transportation efficiency and the spacing of platoon should be shortened when crossing the street. The best method to deal with this problem is automatic control of vehicles. In this paper, a mathematical model is established for the platoon’s longitudinal movement. A systematic analysis of longitudinal control law is presented for the platoon of vehicles. However, the parameter calibration for the platoon model is relatively difficult because the platoon model is complex and the parameters are coupled with each other. In this paper, the particle swarm optimization method is introduced to effectively optimize the parameters of platoon. The proposed method effectively finds the optimal parameters based on simulations and makes the spacing of platoon shorter.

  12. Physical-property-, lithology- and surface-geometry-based joint inversion using Pareto Multi-Objective Global Optimization

    Science.gov (United States)

    Bijani, Rodrigo; Lelièvre, Peter G.; Ponte-Neto, Cosme F.; Farquharson, Colin G.

    2017-05-01

    This paper is concerned with the applicability of Pareto Multi-Objective Global Optimization (PMOGO) algorithms for solving different types of geophysical inverse problems. The standard deterministic approach is to combine the multiple objective functions (i.e. data misfit, regularization and joint coupling terms) in a weighted-sum aggregate objective function and minimize using local (decent-based) smooth optimization methods. This approach has some disadvantages: (1) appropriate weights must be determined for the aggregate, (2) the objective functions must be differentiable and (3) local minima entrapment may occur. PMOGO algorithms can overcome these drawbacks but introduce increased computational effort. Previous work has demonstrated how PMOGO algorithms can overcome the first issue for single data set geophysical inversion, that is, the trade-off between data misfit and model regularization. However, joint inversion, which can involve many weights in the aggregate, has seen little study. The advantage of PMOGO algorithms for the other two issues has yet to be addressed in the context of geophysical inversion. In this paper, we implement a PMOGO genetic algorithm and apply it to physical-property-, lithology- and surface-geometry-based inverse problems to demonstrate the advantages of using a global optimization strategy. Lithological inversions work on a mesh but use integer model parameters representing rock unit identifiers instead of continuous physical properties. Surface geometry inversions change the geometry of wireframe surfaces that represent the contacts between discrete rock units. Despite the potentially high computational requirements of global optimization algorithms (compared to local), their application to realistically sized 2-D geophysical inverse problems is within reach of current capacity of standard computers. Furthermore, they open the door to geophysical inverse problems that could not otherwise be considered through traditional

  13. Analysis of noise bother by survey method | MENKITI | Global ...

    African Journals Online (AJOL)

    Global Journal of Pure and Applied Sciences. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 7, No 3 (2001) >. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register. Analysis of noise bother by survey method.

  14. An Improved Real-Coded Population-Based Extremal Optimization Method for Continuous Unconstrained Optimization Problems

    Directory of Open Access Journals (Sweden)

    Guo-Qiang Zeng

    2014-01-01

    Full Text Available As a novel evolutionary optimization method, extremal optimization (EO has been successfully applied to a variety of combinatorial optimization problems. However, the applications of EO in continuous optimization problems are relatively rare. This paper proposes an improved real-coded population-based EO method (IRPEO for continuous unconstrained optimization problems. The key operations of IRPEO include generation of real-coded random initial population, evaluation of individual and population fitness, selection of bad elements according to power-law probability distribution, generation of new population based on uniform random mutation, and updating the population by accepting the new population unconditionally. The experimental results on 10 benchmark test functions with the dimension N=30 have shown that IRPEO is competitive or even better than the recently reported various genetic algorithm (GA versions with different mutation operations in terms of simplicity, effectiveness, and efficiency. Furthermore, the superiority of IRPEO to other evolutionary algorithms such as original population-based EO, particle swarm optimization (PSO, and the hybrid PSO-EO is also demonstrated by the experimental results on some benchmark functions.

  15. Topology optimization of hyperelastic structures using a level set method

    Science.gov (United States)

    Chen, Feifei; Wang, Yiqiang; Wang, Michael Yu; Zhang, Y. F.

    2017-12-01

    Soft rubberlike materials, due to their inherent compliance, are finding widespread implementation in a variety of applications ranging from assistive wearable technologies to soft material robots. Structural design of such soft and rubbery materials necessitates the consideration of large nonlinear deformations and hyperelastic material models to accurately predict their mechanical behaviour. In this paper, we present an effective level set-based topology optimization method for the design of hyperelastic structures that undergo large deformations. The method incorporates both geometric and material nonlinearities where the strain and stress measures are defined within the total Lagrange framework and the hyperelasticity is characterized by the widely-adopted Mooney-Rivlin material model. A shape sensitivity analysis is carried out, in the strict sense of the material derivative, where the high-order terms involving the displacement gradient are retained to ensure the descent direction. As the design velocity enters into the shape derivative in terms of its gradient and divergence terms, we develop a discrete velocity selection strategy. The whole optimization implementation undergoes a two-step process, where the linear optimization is first performed and its optimized solution serves as the initial design for the subsequent nonlinear optimization. It turns out that this operation could efficiently alleviate the numerical instability and facilitate the optimization process. To demonstrate the validity and effectiveness of the proposed method, three compliance minimization problems are studied and their optimized solutions present significant mechanical benefits of incorporating the nonlinearities, in terms of remarkable enhancement in not only the structural stiffness but also the critical buckling load.

  16. Panorama parking assistant system with improved particle swarm optimization method

    Science.gov (United States)

    Cheng, Ruzhong; Zhao, Yong; Li, Zhichao; Jiang, Weigang; Wang, Xin'an; Xu, Yong

    2013-10-01

    A panorama parking assistant system (PPAS) for the automotive aftermarket together with a practical improved particle swarm optimization method (IPSO) are proposed in this paper. In the PPAS system, four fisheye cameras are installed in the vehicle with different views, and four channels of video frames captured by the cameras are processed as a 360-deg top-view image around the vehicle. Besides the embedded design of PPAS, the key problem for image distortion correction and mosaicking is the efficiency of parameter optimization in the process of camera calibration. In order to address this problem, an IPSO method is proposed. Compared with other parameter optimization methods, the proposed method allows a certain range of dynamic change for the intrinsic and extrinsic parameters, and can exploit only one reference image to complete all of the optimization; therefore, the efficiency of the whole camera calibration is increased. The PPAS is commercially available, and the IPSO method is a highly practical way to increase the efficiency of the installation and the calibration of PPAS in automobile 4S shops.

  17. Control and Optimization Methods for Electric Smart Grids

    CERN Document Server

    Ilić, Marija

    2012-01-01

    Control and Optimization Methods for Electric Smart Grids brings together leading experts in power, control and communication systems,and consolidates some of the most promising recent research in smart grid modeling,control and optimization in hopes of laying the foundation for future advances in this critical field of study. The contents comprise eighteen essays addressing wide varieties of control-theoretic problems for tomorrow’s power grid. Topics covered include: Control architectures for power system networks with large-scale penetration of renewable energy and plug-in vehicles Optimal demand response New modeling methods for electricity markets Control strategies for data centers Cyber-security Wide-area monitoring and control using synchronized phasor measurements. The authors present theoretical results supported by illustrative examples and practical case studies, making the material comprehensible to a wide audience. The results reflect the exponential transformation that today’s grid is going...

  18. Optimization of MIMO Systems Capacity Using Large Random Matrix Methods

    Directory of Open Access Journals (Sweden)

    Philippe Loubaton

    2012-11-01

    Full Text Available This paper provides a comprehensive introduction of large random matrix methods for input covariance matrix optimization of mutual information of MIMO systems. It is first recalled informally how large system approximations of mutual information can be derived. Then, the optimization of the approximations is discussed, and important methodological points that are not necessarily covered by the existing literature are addressed, including the strict concavity of the approximation, the structure of the argument of its maximum, the accuracy of the large system approach with regard to the number of antennas, or the justification of iterative water-filling optimization algorithms. While the existing papers have developed methods adapted to a specific model, this contribution tries to provide a unified view of the large system approximation approach.

  19. Solving unconstrained optimization with a new type of conjugate gradient method

    Science.gov (United States)

    Shoid, Syazni; Rivaie, Mohd; Mamat, Mustafa; Mohd, Ismail

    2014-06-01

    Conjugate gradient (CG) methods have been widely used as schemes to solve large-scale unconstrained optimization problems. Numerous studies and modifications have been done recently to improve this method. In this paper, we proposed a new type of CG coefficients (βk) by modification of Polak and Ribiere (PR) method. This new βk is shown to possess global convergence properties by using exact line searches. Performance comparisons are made with the four most common βk proposed by the early researches. Numerical results also show that this new βk performed better.

  20. Optimization of automation: III. Development of optimization method for determining automation rate in nuclear power plants

    International Nuclear Information System (INIS)

    Lee, Seung Min; Kim, Jong Hyun; Kim, Man Cheol; Seong, Poong Hyun

    2016-01-01

    Highlights: • We propose an appropriate automation rate that enables the best human performance. • We analyze the shortest working time considering Situation Awareness Recovery (SAR). • The optimized automation rate is estimated by integrating the automation and ostracism rate estimation methods. • The process to derive the optimized automation rate is demonstrated through case studies. - Abstract: Automation has been introduced in various industries, including the nuclear field, because it is commonly believed that automation promises greater efficiency, lower workloads, and fewer operator errors through reducing operator errors and enhancing operator and system performance. However, the excessive introduction of automation has deteriorated operator performance due to the side effects of automation, which are referred to as Out-of-the-Loop (OOTL), and this is critical issue that must be resolved. Thus, in order to determine the optimal level of automation introduction that assures the best human operator performance, a quantitative method of optimizing the automation is proposed in this paper. In order to propose the optimization method for determining appropriate automation levels that enable the best human performance, the automation rate and ostracism rate, which are estimation methods that quantitatively analyze the positive and negative effects of automation, respectively, are integrated. The integration was conducted in order to derive the shortest working time through considering the concept of situation awareness recovery (SAR), which states that the automation rate with the shortest working time assures the best human performance. The process to derive the optimized automation rate is demonstrated through an emergency operation scenario-based case study. In this case study, four types of procedures are assumed through redesigning the original emergency operating procedure according to the introduced automation and ostracism levels. Using the

  1. Global attractivity and optimal dynamic countermeasure of a virus propagation model in complex networks

    Science.gov (United States)

    Zhang, Xulong; Gan, Chenquan

    2018-01-01

    This paper aims to study the combined impact of countermeasure and network topology on virus diffusion and optimal dynamic countermeasure. A novel heterogenous propagation model and its optimal control problem are proposed and analyzed. Qualitative analysis shows that the unique equilibrium of the proposed model is globally attractive and the optimal control problem has an optimal control. Some simulation experiments are also performed. Specifically, it is found that our obtained results are contrary to some previous results and countermeasure dissemination to higher-degree nodes is more effective than that to lower-degree nodes. The related explanations are also made. This indicates that countermeasures and network topology play an important role in suppressing viral spread.

  2. A Local and Global Search Combined Particle Swarm Optimization Algorithm and Its Convergence Analysis

    Directory of Open Access Journals (Sweden)

    Weitian Lin

    2014-01-01

    Full Text Available Particle swarm optimization algorithm (PSOA is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA, and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA. Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.

  3. Global localization of 3D anatomical structures by pre-filtered Hough forests and discrete optimization.

    Science.gov (United States)

    Donner, René; Menze, Bjoern H; Bischof, Horst; Langs, Georg

    2013-12-01

    The accurate localization of anatomical landmarks is a challenging task, often solved by domain specific approaches. We propose a method for the automatic localization of landmarks in complex, repetitive anatomical structures. The key idea is to combine three steps: (1) a classifier for pre-filtering anatomical landmark positions that (2) are refined through a Hough regression model, together with (3) a parts-based model of the global landmark topology to select the final landmark positions. During training landmarks are annotated in a set of example volumes. A classifier learns local landmark appearance, and Hough regressors are trained to aggregate neighborhood information to a precise landmark coordinate position. A non-parametric geometric model encodes the spatial relationships between the landmarks and derives a topology which connects mutually predictive landmarks. During the global search we classify all voxels in the query volume, and perform regression-based agglomeration of landmark probabilities to highly accurate and specific candidate points at potential landmark locations. We encode the candidates' weights together with the conformity of the connecting edges to the learnt geometric model in a Markov Random Field (MRF). By solving the corresponding discrete optimization problem, the most probable location for each model landmark is found in the query volume. We show that this approach is able to consistently localize the model landmarks despite the complex and repetitive character of the anatomical structures on three challenging data sets (hand radiographs, hand CTs, and whole body CTs), with a median localization error of 0.80 mm, 1.19 mm and 2.71 mm, respectively. Copyright © 2013 Elsevier B.V. All rights reserved.

  4. A general first-order global sensitivity analysis method

    International Nuclear Information System (INIS)

    Xu Chonggang; Gertner, George Zdzislaw

    2008-01-01

    Fourier amplitude sensitivity test (FAST) is one of the most popular global sensitivity analysis techniques. The main mechanism of FAST is to assign each parameter with a characteristic frequency through a search function. Then, for a specific parameter, the variance contribution can be singled out of the model output by the characteristic frequency. Although FAST has been widely applied, there are two limitations: (1) the aliasing effect among parameters by using integer characteristic frequencies and (2) the suitability for only models with independent parameters. In this paper, we synthesize the improvement to overcome the aliasing effect limitation [Tarantola S, Gatelli D, Mara TA. Random balance designs for the estimation of first order global sensitivity indices. Reliab Eng Syst Safety 2006; 91(6):717-27] and the improvement to overcome the independence limitation [Xu C, Gertner G. Extending a global sensitivity analysis technique to models with correlated parameters. Comput Stat Data Anal 2007, accepted for publication]. In this way, FAST can be a general first-order global sensitivity analysis method for linear/nonlinear models with as many correlated/uncorrelated parameters as the user specifies. We apply the general FAST to four test cases with correlated parameters. The results show that the sensitivity indices derived by the general FAST are in good agreement with the sensitivity indices derived by the correlation ratio method, which is a non-parametric method for models with correlated parameters

  5. Applying the Taguchi method for optimized fabrication of bovine ...

    African Journals Online (AJOL)

    The objective of the present study was to optimize the fabrication of bovine serum albumin (BSA) nanoparticle by applying the Taguchi method with characterization of the nanoparticle bioproducts. BSA nanoparticles have been extensively studied in our previous works as suitable carrier for drug delivery, since they are ...

  6. Response surface method to optimize the low cost medium for ...

    African Journals Online (AJOL)

    A protease producing Bacillus sp. GA CAS10 was isolated from ascidian Phallusia arabica, Tuticorin, Southeast coast of India. Response surface methodology was employed for the optimization of different nutritional and physical factors for the production of protease. Plackett-Burman method was applied to identify ...

  7. Optimization Methods in Operations Research and Systems Analysis

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 6. Optimization Methods in Operations Research and Systems Analysis. V G Tikekar. Book Review Volume 2 Issue 6 June 1997 pp 91-92. Fulltext. Click here to view fulltext PDF. Permanent link:

  8. MEIGO: an open-source software suite based on metaheuristics for global optimization in systems biology and bioinformatics.

    Science.gov (United States)

    Egea, Jose A; Henriques, David; Cokelaer, Thomas; Villaverde, Alejandro F; MacNamara, Aidan; Danciu, Diana-Patricia; Banga, Julio R; Saez-Rodriguez, Julio

    2014-05-10

    Optimization is the key to solving many problems in computational biology. Global optimization methods, which provide a robust methodology, and metaheuristics in particular have proven to be the most efficient methods for many applications. Despite their utility, there is a limited availability of metaheuristic tools. We present MEIGO, an R and Matlab optimization toolbox (also available in Python via a wrapper of the R version), that implements metaheuristics capable of solving diverse problems arising in systems biology and bioinformatics. The toolbox includes the enhanced scatter search method (eSS) for continuous nonlinear programming (cNLP) and mixed-integer programming (MINLP) problems, and variable neighborhood search (VNS) for Integer Programming (IP) problems. Additionally, the R version includes BayesFit for parameter estimation by Bayesian inference. The eSS and VNS methods can be run on a single-thread or in parallel using a cooperative strategy. The code is supplied under GPLv3 and is available at http://www.iim.csic.es/~gingproc/meigo.html. Documentation and examples are included. The R package has been submitted to BioConductor. We evaluate MEIGO against optimization benchmarks, and illustrate its applicability to a series of case studies in bioinformatics and systems biology where it outperforms other state-of-the-art methods. MEIGO provides a free, open-source platform for optimization that can be applied to multiple domains of systems biology and bioinformatics. It includes efficient state of the art metaheuristics, and its open and modular structure allows the addition of further methods.

  9. Cooperative Coevolution with Formula-Based Variable Grouping for Large-Scale Global Optimization.

    Science.gov (United States)

    Wang, Yuping; Liu, Haiyan; Wei, Fei; Zong, Tingting; Li, Xiaodong

    2017-08-09

    For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations "[Formula: see text]", "[Formula: see text]", "[Formula: see text]", "[Formula: see text]" and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem

  10. Error Estimates for Approximate Optimization by the Extended Ritz Method

    Czech Academy of Sciences Publication Activity Database

    Kůrková, Věra; Sanguineti, M.

    2005-01-01

    Roč. 15, č. 2 (2005), s. 461-487 ISSN 1052-6234 R&D Projects: GA ČR GA201/02/0428 Institutional research plan: CEZ:AV0Z10300504 Keywords : functional optimization * rates of convergence of suboptimal solutions * (extended) Ritz method * curse of dimensionality * convex best approximation problems * learning from data by kernel methods Subject RIV: BA - General Mathematics Impact factor: 1.238, year: 2005

  11. Optimization strategies of in-tube extraction (ITEX) methods

    OpenAIRE

    Laaks, Jens; Jochmann, Maik A.; Schilling, Beat; Schmidt, Torsten C.

    2015-01-01

    Microextraction techniques, especially dynamic techniques like in-tube extraction (ITEX), can require an extensive method optimization procedure. This work summarizes the experiences from several methods and gives recommendations for the setting of proper extraction conditions to minimize experimental effort. Therefore, the governing parameters of the extraction and injection stages are discussed. This includes the relative extraction efficiencies of 11 kinds of sorbent tubes, either commerci...

  12. Exergetic optimization of a thermoacoustic engine using the particle swarm optimization method

    International Nuclear Information System (INIS)

    Chaitou, Hussein; Nika, Philippe

    2012-01-01

    Highlights: ► Optimization of a thermoacoustic engine using the particle swarm optimization method. ► Exergetic efficiency, acoustic power and their product are the optimized functions. ► PSO method is used successfully for the first time in the TA research. ► The powerful PSO tool is advised to be more involved in the TA research and design. ► EE times AP optimized function is highly recommended to design any new TA devices. - Abstract: Thermoacoustic engines convert heat energy into acoustic energy. Then, the acoustic energy can be used to pump heat or to generate electricity. It is well-known that the acoustic energy and therefore the exergetic efficiency depend on parameters such as the stack’s hydraulic radius, the stack’s position in the resonator and the traveling–standing-wave ratio. In this paper, these three parameters are investigated in order to study and analyze the best value of the produced acoustic energy, the exergetic efficiency and the product of the acoustic energy by the exergetic efficiency of a thermoacoustic engine with a parallel-plate stack. The dimensionless expressions of the thermoacoustic equations are derived and calculated. Then, the Particle Swarm Optimization method (PSO) is introduced and used for the first time in the thermoacoustic research. The use of the PSO method and the optimization of the acoustic energy multiplied by the exergetic efficiency are novel contributions to this domain of research. This paper discusses some significant conclusions which are useful for the design of new thermoacoustic engines.

  13. Modified Global Flower Pollination Algorithm and its Application for Optimization Problems.

    Science.gov (United States)

    Shambour, Moh'd Khaled Yousef; Abusnaina, Ahmed A; Alsalibi, Ahmed I

    2018-03-28

    Flower Pollination Algorithm (FPA) has increasingly attracted researchers' attention in the computational intelligence field. This is due to its simplicity and efficiency in searching for global optimality of many optimization problems. However, there is a possibility to enhance its search performance further. This paper aspires to develop a new FPA variant that aims to improve the convergence rate and solution quality, which will be called modified global FPA (mgFPA). The mgFPA is designed to better utilize features of existing solutions through extracting its characteristics, and direct the exploration process towards specific search areas. Several continuous optimization problems were used to investigate the positive impact of the proposed algorithm. The eligibility of mgFPA was also validated on real optimization problems, where it trains artificial neural networks to perform pattern classification. Computational results show that the proposed algorithm provides satisfactory performance in terms of finding better solutions compared to six state-of-the-art optimization algorithms that had been used for benchmarking.

  14. Robust fluence map optimization via alternating direction method of multipliers with empirical parameter optimization

    International Nuclear Information System (INIS)

    Gao, Hao

    2016-01-01

    For the treatment planning during intensity modulated radiation therapy (IMRT) or volumetric modulated arc therapy (VMAT), beam fluence maps can be first optimized via fluence map optimization (FMO) under the given dose prescriptions and constraints to conformally deliver the radiation dose to the targets while sparing the organs-at-risk, and then segmented into deliverable MLC apertures via leaf or arc sequencing algorithms. This work is to develop an efficient algorithm for FMO based on alternating direction method of multipliers (ADMM). Here we consider FMO with the least-square cost function and non-negative fluence constraints, and its solution algorithm is based on ADMM, which is efficient and simple-to-implement. In addition, an empirical method for optimizing the ADMM parameter is developed to improve the robustness of the ADMM algorithm. The ADMM based FMO solver was benchmarked with the quadratic programming method based on the interior-point (IP) method using the CORT dataset. The comparison results suggested the ADMM solver had a similar plan quality with slightly smaller total objective function value than IP. A simple-to-implement ADMM based FMO solver with empirical parameter optimization is proposed for IMRT or VMAT. (paper)

  15. Optimization of PID Parameters Utilizing Variable Weight Grey-Taguchi Method and Particle Swarm Optimization

    Science.gov (United States)

    Azmi, Nur Iffah Mohamed; Arifin Mat Piah, Kamal; Yusoff, Wan Azhar Wan; Romlay, Fadhlur Rahman Mohd

    2018-03-01

    Controller that uses PID parameters requires a good tuning method in order to improve the control system performance. Tuning PID control method is divided into two namely the classical methods and the methods of artificial intelligence. Particle swarm optimization algorithm (PSO) is one of the artificial intelligence methods. Previously, researchers had integrated PSO algorithms in the PID parameter tuning process. This research aims to improve the PSO-PID tuning algorithms by integrating the tuning process with the Variable Weight Grey- Taguchi Design of Experiment (DOE) method. This is done by conducting the DOE on the two PSO optimizing parameters: the particle velocity limit and the weight distribution factor. Computer simulations and physical experiments were conducted by using the proposed PSO- PID with the Variable Weight Grey-Taguchi DOE and the classical Ziegler-Nichols methods. They are implemented on the hydraulic positioning system. Simulation results show that the proposed PSO-PID with the Variable Weight Grey-Taguchi DOE has reduced the rise time by 48.13% and settling time by 48.57% compared to the Ziegler-Nichols method. Furthermore, the physical experiment results also show that the proposed PSO-PID with the Variable Weight Grey-Taguchi DOE tuning method responds better than Ziegler-Nichols tuning. In conclusion, this research has improved the PSO-PID parameter by applying the PSO-PID algorithm together with the Variable Weight Grey-Taguchi DOE method as a tuning method in the hydraulic positioning system.

  16. Global optimization of truss topology with discrete bar areas—Part I: Theory of relaxed problems

    DEFF Research Database (Denmark)

    Achtziger, Wolfgang; Stolpe, Mathias

    2008-01-01

    . The main issue of the paper and of the approach lies in the fact that the relaxed nonlinear optimization problem can be formulated as a quadratic program (QP). Here the paper generalizes and extends the available theory from the literature. Although the Hessian of this QP is indefinite, it is possible...... to circumvent the non-convexity and to calculate global optimizers. Moreover, the QPs to be treated in the branch-and-bound search tree differ from each other just in the objective function. In Part I we give an introduction to the problem and collect all theory and related proofs for the treatment...

  17. Estimation of the global average temperature with optimally weighted point gauges

    Science.gov (United States)

    Hardin, James W.; Upson, Robert B.

    1993-12-01

    This paper considers the minimum mean squared error (MSE) incurred in estimating an idealized Earth's global average temperature with a finite network of point gauges located over the globe. We follow the spectral MSE formalism given by North et al. [1992] and derive the optimal weights for N gauges in the problem of estimating the Earth's global average temperature. Our results suggest that for commonly used configurations the variance of the estimate due to sampling error can be reduced by as much as 50%.

  18. Stepwise optimization and global chaos of nonlinear parameters in exact calculations of few-particle systems

    International Nuclear Information System (INIS)

    Frolov, A.M.

    1986-01-01

    The problem of exact variational calculations of few-particle systems in the exponential basis of the relative coordinates using nonlinear parameters is studied. The techniques of stepwise optimization and global chaos of nonlinear parameters are used to calculate the S and P states of homonuclear muonic molecules with an error of no more than +0.001 eV. The global-chaos technique also has proved to be successful in the case of the nuclear systems 3 H and 3 He

  19. THE METHOD OF GLOBAL READING FROM AN INTERDISCIPLINARY PERSPECTIVE

    Directory of Open Access Journals (Sweden)

    Jasmina Delcheva Dizdarevikj

    2018-04-01

    Full Text Available Primary literacy in Macedonian education is in decline. This assertion has been proved both by the abstract theory, and by the concrete empirical data. Educational reforms in the national curriculum are on their way, and the implementation of the method of global reading is one of the main innovations. Misunderstanding of this method has led it its being criticized as a foreign import and as unnatural and incongruous for the specificities of the Macedonian language. We think that this argument is wrong. That is why this paper is going to extrapolate and explain the method of global learning and its basis in pedagogy, philosophy, psychology, anthropology and linguistics. The main premise of this paper is the relation of the part to the whole, understood from the different perspectives of philosophy, psychology, linguistics and anthropology. The theories of Kant, Cassirer, Bruner, Benveniste and Geertz are going to be considered in the context of the part – whole problem, by themselves, and also in their relation to the method of global reading.

  20. Computational Method for Global Sensitivity Analysis of Reactor Neutronic Parameters

    Directory of Open Access Journals (Sweden)

    Bolade A. Adetula

    2012-01-01

    Full Text Available The variance-based global sensitivity analysis technique is robust, has a wide range of applicability, and provides accurate sensitivity information for most models. However, it requires input variables to be statistically independent. A modification to this technique that allows one to deal with input variables that are blockwise correlated and normally distributed is presented. The focus of this study is the application of the modified global sensitivity analysis technique to calculations of reactor parameters that are dependent on groupwise neutron cross-sections. The main effort in this work is in establishing a method for a practical numerical calculation of the global sensitivity indices. The implementation of the method involves the calculation of multidimensional integrals, which can be prohibitively expensive to compute. Numerical techniques specifically suited to the evaluation of multidimensional integrals, namely, Monte Carlo and sparse grids methods, are used, and their efficiency is compared. The method is illustrated and tested on a two-group cross-section dependent problem. In all the cases considered, the results obtained with sparse grids achieved much better accuracy while using a significantly smaller number of samples. This aspect is addressed in a ministudy, and a preliminary explanation of the results obtained is given.

  1. Mathematical programming methods for large-scale topology optimization problems

    DEFF Research Database (Denmark)

    Rojas Labanda, Susana

    for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical...... structure of the problem. In both solvers, information of the exact Hessian is considered. A robust iterative method is implemented to efficiently solve large-scale linear systems. Both TopSQP and TopIP have successful results in terms of convergence, number of iterations, and objective function values....... Thanks to the use of the iterative method implemented, TopIP is able to solve large-scale problems with more than three millions degrees of freedom....

  2. A Survey of Methods for Gas-Lift Optimization

    Directory of Open Access Journals (Sweden)

    Kashif Rashid

    2012-01-01

    Full Text Available This paper presents a survey of methods and techniques developed for the solution of the continuous gas-lift optimization problem over the last two decades. These range from isolated single-well analysis all the way to real-time multivariate optimization schemes encompassing all wells in a field. While some methods are clearly limited due to their neglect of treating the effects of inter-dependent wells with common flow lines, other methods are limited due to the efficacy and quality of the solution obtained when dealing with large-scale networks comprising hundreds of difficult to produce wells. The aim of this paper is to provide an insight into the approaches developed and to highlight the challenges that remain.

  3. The construction of optimal stated choice experiments theory and methods

    CERN Document Server

    Street, Deborah J

    2007-01-01

    The most comprehensive and applied discussion of stated choice experiment constructions available The Construction of Optimal Stated Choice Experiments provides an accessible introduction to the construction methods needed to create the best possible designs for use in modeling decision-making. Many aspects of the design of a generic stated choice experiment are independent of its area of application, and until now there has been no single book describing these constructions. This book begins with a brief description of the various areas where stated choice experiments are applicable, including marketing and health economics, transportation, environmental resource economics, and public welfare analysis. The authors focus on recent research results on the construction of optimal and near-optimal choice experiments and conclude with guidelines and insight on how to properly implement these results. Features of the book include: Construction of generic stated choice experiments for the estimation of main effects...

  4. Systematic method for optimizing plutonium transmutation in LWRs

    Science.gov (United States)

    Sorensen, Reuben T.

    We have developed the Systematic Reactor Optimization in 2-Dimensions (SRO2D) code to maximize the transmutation of plutonium in light water reactors (LWRs). The necessary conditions for optimal fuel and burnable absorber loadings are obtained with Pontryagin's maximum principle and a direct adjoining approach to explicitly account for a power peaking inequality constraint. The resulting set of coupled system, Euler-Lagrange (E-L), and optimality equations are solved iteratively with the method of conjugate gradients until no further improvement is achieved in the objective function. To satisfy the power peaking inequality constraint throughout the operating cycle we have employed a backwards diffusion theory (BDT) technique as part of the conjugate gradient optimization package. The BDT approach establishes a relationship between the burnable absorber loading and the power distribution during the cycle, such that constraint violations are reduced with each conjugate gradient iteration and eventually eliminated. Our in-core optimization methodology has been implemented in the SRO2D code, assuming two-group, two-dimensional neutron diffusion theory. The system equations are solved in a quasi-static fashion forward in time from beginning-of-cycle (BOC) to end-of-cycle (EOC), while the E-L equations are solved backwards in time from EOC to BOC to reflect the adjoint nature of the Lagrange multipliers. Cycle length extension calculations of a first cycle AP600 plant verify our implementation effort, yielding a nearly identical loading pattern to that issued by Westinghouse in the AP600 Safety Analysis Report. Utilizing a self-generated Pu recycling mode, our in-core optimization methodology is coupled with an equilibrium cycle methodology to arrive at an optimized asymptotic Pu inventory and composition. Beginning with a poor loading pattern, our LWR optimization package improves the core performance by reducing the maximum power peaking factor from 2.0 to 1

  5. Optimal treatment cost allocation methods in pollution control

    International Nuclear Information System (INIS)

    Chen Wenying; Fang Dong; Xue Dazhi

    1999-01-01

    Total emission control is an effective pollution control strategy. However, Chinese application of total emission control lacks reasonable and fair methods for optimal treatment cost allocation, a critical issue in total emission control. The author considers four approaches to allocate treatment costs. The first approach is to set up a multiple-objective planning model and to solve the model using the shortest distance ideal point method. The second approach is to define degree of satisfaction for cost allocation results for each polluter and to establish a method based on this concept. The third is to apply bargaining and arbitration theory to develop a model. The fourth is to establish a cooperative N-person game model which can be solved using the Shapley value method, the core method, the Cost Gap Allocation method or the Minimum Costs-Remaining Savings method. These approaches are compared using a practicable case study

  6. Global tests of P-values for multifactor dimensionality reduction models in selection of optimal number of target genes

    Directory of Open Access Journals (Sweden)

    Dai Hongying

    2012-05-01

    Full Text Available Abstract Background Multifactor Dimensionality Reduction (MDR is a popular and successful data mining method developed to characterize and detect nonlinear complex gene-gene interactions (epistasis that are associated with disease susceptibility. Because MDR uses a combinatorial search strategy to detect interaction, several filtration techniques have been developed to remove genes (SNPs that have no interactive effects prior to analysis. However, the cutoff values implemented for these filtration methods are arbitrary, therefore different choices of cutoff values will lead to different selections of genes (SNPs. Methods We suggest incorporating a global test of p-values to filtration procedures to identify the optimal number of genes/SNPs for further MDR analysis and demonstrate this approach using a ReliefF filter technique. We compare the performance of different global testing procedures in this context, including the Kolmogorov-Smirnov test, the inverse chi-square test, the inverse normal test, the logit test, the Wilcoxon test and Tippett’s test. Additionally we demonstrate the approach on a real data application with a candidate gene study of drug response in Juvenile Idiopathic Arthritis. Results Extensive simulation of correlated p-values show that the inverse chi-square test is the most appropriate approach to be incorporated with the screening approach to determine the optimal number of SNPs for the final MDR analysis. The Kolmogorov-Smirnov test has high inflation of Type I errors when p-values are highly correlated or when p-values peak near the center of histogram. Tippett’s test has very low power when the effect size of GxG interactions is small. Conclusions The proposed global tests can serve as a screening approach prior to individual tests to prevent false discovery. Strong power in small sample sizes and well controlled Type I error in absence of GxG interactions make global tests highly recommended in epistasis studies.

  7. A conceptual model of optimal international service-learning and its application to global health initiatives in rehabilitation.

    Science.gov (United States)

    Pechak, Celia M; Thompson, Mary

    2009-11-01

    There is growing involvement by US clinicians, faculty members, and students in global health initiatives, including international service-learning (ISL). Limited research has been done to examine the profession's increasing global engagement, or the ISL phenomenon in particular, and no research has been done to determine best practices. This study was intended as an early step in the examination of the physical therapy profession's role and activities in the global health arena within and beyond academics. The purposes of this study were: (1) to identify and analyze the common structures and processes among established ISL programs within physical therapist education programs and (2) to develop a conceptual model of optimal ISL within physical therapist education programs. A descriptive, exploratory study was completed using grounded theory. Telephone interviews were completed with 14 faculty members who had been involved in international service, international learning, or ISL in physical therapist education programs. Interviews were transcribed, and transcriptions were analyzed using the grounded theory method. Four major themes emerged from the data: structure, reciprocity, relationship, and sustainability. A conceptual model of and a proposed definition for optimal ISL in physical therapist education were developed. Seven essential components of the conceptual model are: a partner that understands the role of physical therapy, community-identified needs, explicit service and learning objectives, reflection, preparation, risk management, and service and learning outcome measures. Essential consequences are positive effects on students and community. The conceptual model and definition of optimal ISL can be used to direct development of new ISL programs and to improve existing programs. In addition, they can offer substantive guidance to any physical therapist involved in global health initiatives.

  8. A Parameter Estimation Method for Nonlinear Systems Based on Improved Boundary Chicken Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Shaolong Chen

    2016-01-01

    Full Text Available Parameter estimation is an important problem in nonlinear system modeling and control. Through constructing an appropriate fitness function, parameter estimation of system could be converted to a multidimensional parameter optimization problem. As a novel swarm intelligence algorithm, chicken swarm optimization (CSO has attracted much attention owing to its good global convergence and robustness. In this paper, a method based on improved boundary chicken swarm optimization (IBCSO is proposed for parameter estimation of nonlinear systems, demonstrated and tested by Lorenz system and a coupling motor system. Furthermore, we have analyzed the influence of time series on the estimation accuracy. Computer simulation results show it is feasible and with desirable performance for parameter estimation of nonlinear systems.

  9. A method for optimizing the performance of buildings

    Energy Technology Data Exchange (ETDEWEB)

    Pedersen, Frank

    2006-07-01

    This thesis describes a method for optimizing the performance of buildings. Design decisions made in early stages of the building design process have a significant impact on the performance of buildings, for instance, the performance with respect to the energy consumption, economical aspects, and the indoor environment. The method is intended for supporting design decisions for buildings, by combining methods for calculating the performance of buildings with numerical optimization methods. The method is able to find optimum values of decision variables representing different features of the building, such as its shape, the amount and type of windows used, and the amount of insulation used in the building envelope. The parties who influence design decisions for buildings, such as building owners, building users, architects, consulting engineers, contractors, etc., often have different and to some extent conflicting requirements to buildings. For instance, the building owner may be more concerned about the cost of constructing the building, rather than the quality of the indoor climate, which is more likely to be a concern of the building user. In order to support the different types of requirements made by decision-makers for buildings, an optimization problem is formulated, intended for representing a wide range of design decision problems for buildings. The problem formulation involves so-called performance measures, which can be calculated with simulation software for buildings. For instance, the annual amount of energy required by the building, the cost of constructing the building, and the annual number of hours where overheating occurs, can be used as performance measures. The optimization problem enables the decision-makers to specify many different requirements to the decision variables, as well as to the performance of the building. Performance measures can for instance be required to assume their minimum or maximum value, they can be subjected to upper or

  10. First-principle optimal local pseudopotentials construction via optimized effective potential method

    International Nuclear Information System (INIS)

    Mi, Wenhui; Zhang, Shoutao; Wang, Yanchao; Ma, Yanming; Miao, Maosheng

    2016-01-01

    The local pseudopotential (LPP) is an important component of orbital-free density functional theory, a promising large-scale simulation method that can maintain information on a material’s electron state. The LPP is usually extracted from solid-state density functional theory calculations, thereby it is difficult to assess its transferability to cases involving very different chemical environments. Here, we reveal a fundamental relation between the first-principles norm-conserving pseudopotential (NCPP) and the LPP. On the basis of this relationship, we demonstrate that the LPP can be constructed optimally from the NCPP for a large number of elements using the optimized effective potential method. Specially, our method provides a unified scheme for constructing and assessing the LPP within the framework of first-principles pseudopotentials. Our practice reveals that the existence of a valid LPP with high transferability may strongly depend on the element.

  11. Optimal interpolation method for intercomparison of atmospheric measurements.

    Science.gov (United States)

    Ridolfi, Marco; Ceccherini, Simone; Carli, Bruno

    2006-04-01

    Intercomparison of atmospheric measurements is often a difficult task because of the different spatial response functions of the experiments considered. We propose a new method for comparison of two atmospheric profiles characterized by averaging kernels with different vertical resolutions. The method minimizes the smoothing error induced by the differences in the averaging kernels by exploiting an optimal interpolation rule to map one profile into the retrieval grid of the other. Compared with the techniques published so far, this method permits one to retain the vertical resolution of the less-resolved profile involved in the intercomparison.

  12. Maximum gradient method for optimization of some reactor operating parameters

    International Nuclear Information System (INIS)

    Miasnikov, A.

    1976-03-01

    The method and the algorithm ensuing therefrom are described for the determination of the optimum operating state of a reactor. The optimum operating state is considered to be the extreme of the selected functional of the radial power distribution. The functional extreme is determined numerically, using a method which is one of the possible variants of the maximum gradient method. The radial distribution of the neutron absorption in regulating rods and the fuel element burnup are considered to be the variable parameters used in the optimization. (author)

  13. Grey Wolf Optimizer Based on Powell Local Optimization Method for Clustering Analysis

    Directory of Open Access Journals (Sweden)

    Sen Zhang

    2015-01-01

    Full Text Available One heuristic evolutionary algorithm recently proposed is the grey wolf optimizer (GWO, inspired by the leadership hierarchy and hunting mechanism of grey wolves in nature. This paper presents an extended GWO algorithm based on Powell local optimization method, and we call it PGWO. PGWO algorithm significantly improves the original GWO in solving complex optimization problems. Clustering is a popular data analysis and data mining technique. Hence, the PGWO could be applied in solving clustering problems. In this study, first the PGWO algorithm is tested on seven benchmark functions. Second, the PGWO algorithm is used for data clustering on nine data sets. Compared to other state-of-the-art evolutionary algorithms, the results of benchmark and data clustering demonstrate the superior performance of PGWO algorithm.

  14. Ringed Seal Search for Global Optimization via a Sensitive Search Model.

    Science.gov (United States)

    Saadi, Younes; Yanto, Iwan Tri Riyadi; Herawan, Tutut; Balakrishnan, Vimala; Chiroma, Haruna; Risnumawan, Anhar

    2016-01-01

    The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS) is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive) and exploitation (intensive) of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be used in global

  15. Developing Automatic Multi-Objective Optimization Methods for Complex Actuators

    Directory of Open Access Journals (Sweden)

    CHIS, R.

    2017-11-01

    Full Text Available This paper presents the analysis and multiobjective optimization of a magnetic actuator. By varying just 8 parameters of the magnetic actuator’s model the design space grows to more than 6 million configurations. Much more, the 8 objectives that must be optimized are conflicting and generate a huge objectives space, too. To cope with this complexity, we use advanced heuristic methods for Automatic Design Space Exploration. FADSE tool is one Automatic Design Space Exploration framework including different state of the art multi-objective meta-heuristics for solving NP-hard problems, which we used for the analysis and optimization of the COMSOL and MATLAB model of the magnetic actuator. We show that using a state of the art genetic multi-objective algorithm, response surface modelling methods and some machine learning techniques, the timing complexity of the design space exploration can be reduced, while still taking into consideration objective constraints so that various Pareto optimal configurations can be found. Using our developed approach, we were able to decrease the simulation time by at least a factor of 10, compared to a run that does all the simulations, while keeping prediction errors to around 1%.

  16. Sequential Optimization of Global Sequence Alignments Relative to Different Cost Functions

    KAUST Repository

    Odat, Enas M.

    2011-05-01

    The purpose of this dissertation is to present a methodology to model global sequence alignment problem as directed acyclic graph which helps to extract all possible optimal alignments. Moreover, a mechanism to sequentially optimize sequence alignment problem relative to different cost functions is suggested. Sequence alignment is mostly important in computational biology. It is used to find evolutionary relationships between biological sequences. There are many algo- rithms that have been developed to solve this problem. The most famous algorithms are Needleman-Wunsch and Smith-Waterman that are based on dynamic program- ming. In dynamic programming, problem is divided into a set of overlapping sub- problems and then the solution of each subproblem is found. Finally, the solutions to these subproblems are combined into a final solution. In this thesis it has been proved that for two sequences of length m and n over a fixed alphabet, the suggested optimization procedure requires O(mn) arithmetic operations per cost function on a single processor machine. The algorithm has been simulated using C#.Net programming language and a number of experiments have been done to verify the proved statements. The results of these experiments show that the number of optimal alignments is reduced after each step of optimization. Furthermore, it has been verified that as the sequence length increased linearly then the number of optimal alignments increased exponentially which also depends on the cost function that is used. Finally, the number of executed operations increases polynomially as the sequence length increase linearly.

  17. Cuckoo Search with Lévy Flights for Weighted Bayesian Energy Functional Optimization in Global-Support Curve Data Fitting

    Directory of Open Access Journals (Sweden)

    Akemi Gálvez

    2014-01-01

    for data fitting by using global-support approximating curves. By global-support curves we mean curves expressed as a linear combination of basis functions whose support is the whole domain of the problem, as opposed to other common approaches in CAD/CAM and computer graphics driven by piecewise functions (such as B-splines and NURBS that provide local control of the shape of the curve. Our method applies a powerful nature-inspired metaheuristic algorithm called cuckoo search, introduced recently to solve optimization problems. A major advantage of this method is its simplicity: cuckoo search requires only two parameters, many fewer than other metaheuristic approaches, so the parameter tuning becomes a very simple task. The paper shows that this new approach can be successfully used to solve our optimization problem. To check the performance of our approach, it has been applied to five illustrative examples of different types, including open and closed 2D and 3D curves that exhibit challenging features, such as cusps and self-intersections. Our results show that the method performs pretty well, being able to solve our minimization problem in an astonishingly straightforward way.

  18. Inversion of self-potential anomalies caused by simple-geometry bodies using global optimization algorithms

    International Nuclear Information System (INIS)

    Göktürkler, G; Balkaya, Ç

    2012-01-01

    Three naturally inspired meta-heuristic algorithms—the genetic algorithm (GA), simulated annealing (SA) and particle swarm optimization (PSO)—were used to invert some of the self-potential (SP) anomalies originated by some polarized bodies with simple geometries. Both synthetic and field data sets were considered. The tests with the synthetic data comprised of the solutions with both noise-free and noisy data; in the tests with the field data some SP anomalies observed over a copper belt (India), graphite deposits (Germany) and metallic sulfide (Turkey) were inverted. The model parameters included the electric dipole moment, polarization angle, depth, shape factor and origin of the anomaly. The estimated parameters were compared with those from previous studies using various optimization algorithms, mainly least-squares approaches, on the same data sets. During the test studies the solutions by GA, PSO and SA were characterized as being consistent with each other; a good starting model was not a requirement to reach the global minimum. It can be concluded that the global optimization algorithms considered in this study were able to yield compatible solutions with those from widely used local optimization algorithms. (paper)

  19. Economic optimization of a global strategy to address the pandemic threat.

    Science.gov (United States)

    Pike, Jamison; Bogich, Tiffany; Elwood, Sarah; Finnoff, David C; Daszak, Peter

    2014-12-30

    Emerging pandemics threaten global health and economies and are increasing in frequency. Globally coordinated strategies to combat pandemics, similar to current strategies that address climate change, are largely adaptive, in that they attempt to reduce the impact of a pathogen after it has emerged. However, like climate change, mitigation strategies have been developed that include programs to reduce the underlying drivers of pandemics, particularly animal-to-human disease transmission. Here, we use real options economic modeling of current globally coordinated adaptation strategies for pandemic prevention. We show that they would be optimally implemented within 27 y to reduce the annual rise of emerging infectious disease events by 50% at an estimated one-time cost of approximately $343.7 billion. We then analyze World Bank data on multilateral "One Health" pandemic mitigation programs. We find that, because most pandemics have animal origins, mitigation is a more cost-effective policy than business-as-usual adaptation programs, saving between $344.0.7 billion and $360.3 billion over the next 100 y if implemented today. We conclude that globally coordinated pandemic prevention policies need to be enacted urgently to be optimally effective and that strategies to mitigate pandemics by reducing the impact of their underlying drivers are likely to be more effective than business as usual.

  20. GLOBAL DESIGN OPTIMIZATION OF A REFRIGERATION SYSTEM USING A GENETIC ALGORITHM

    Directory of Open Access Journals (Sweden)

    L. Govindarajan

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: The optimal design of industrial three-stage refrigeration systems to minimize total production cost has been effectively implemented using an genetic algorithm (GA, which is an efficient alternative for conventional search algorithms. In this article the global optimum design parameters of a refrigeration system obtained by using GA is compared with the Nelder-Mead simplex search algorithm. The results prove that global design optimization using GA is more robust and simple, as it requires no initial guess values of design variables. Hence the proposed technique is well suited for designing a variety of industrially important systems.

    AFRIKAANSE OPSOMMING: Die optimum ontwerp van 'n driestadium-vriessisteem om totale produksiekoste te beperk, word doeltreffend met behulp van 'n genetiese algoritme (GA as alternatief vir konvensionele soekalgoritmes in werking gestel. Die navorsing is daarop toegespits om die globale optimum ontwerpparameters van die GA met die Nelder-Mead Simpleks-soekalgoritme te vergelyk. Die resultate toon dat die GA se globale optimum ontwerp robuust en eenvoudig is aangesien geskatte aanvangswaardes vir ontwerpveranderlikes nie benodig word nie. Derhalwe is die GA-tegniek besonder geskik vir die ontwerp van nywerheidsisteme van uiteenlopende aard.

  1. Economic optimization of a global strategy to address the pandemic threat

    Science.gov (United States)

    Pike, Jamison; Bogich, Tiffany; Elwood, Sarah; Finnoff, David C.; Daszak, Peter

    2014-01-01

    Emerging pandemics threaten global health and economies and are increasing in frequency. Globally coordinated strategies to combat pandemics, similar to current strategies that address climate change, are largely adaptive, in that they attempt to reduce the impact of a pathogen after it has emerged. However, like climate change, mitigation strategies have been developed that include programs to reduce the underlying drivers of pandemics, particularly animal-to-human disease transmission. Here, we use real options economic modeling of current globally coordinated adaptation strategies for pandemic prevention. We show that they would be optimally implemented within 27 y to reduce the annual rise of emerging infectious disease events by 50% at an estimated one-time cost of approximately $343.7 billion. We then analyze World Bank data on multilateral “One Health” pandemic mitigation programs. We find that, because most pandemics have animal origins, mitigation is a more cost-effective policy than business-as-usual adaptation programs, saving between $344.0.7 billion and $360.3 billion over the next 100 y if implemented today. We conclude that globally coordinated pandemic prevention policies need to be enacted urgently to be optimally effective and that strategies to mitigate pandemics by reducing the impact of their underlying drivers are likely to be more effective than business as usual. PMID:25512538

  2. Optimal Power Flow Based Global Voltage Stability Analysis Using Network Equivalencing Technique: A Case Study of Widespread Sub-Grid

    Directory of Open Access Journals (Sweden)

    Palukuru NAGENDRA

    2010-12-01

    Full Text Available The objective this paper is to develop a methodology to assess the voltage stability considering optimal operating criteria using the concept of equivalencing the multi-bus power system to a two-bus network model and by studying the necessary parameters of the equivalent system. There by, a generalized global voltage stability indicator being developed, it has been applied to a typical longitudinal power supply (LPS system and a robust practical 203-bus Indian Eastern Grid system. Simulation results have proved that this new network equivalent method is promising to assess voltage stability of any power system at any operating point in global scenario. In the equivalent network the generators are modelled more accurately considering economic criteria.

  3. An Optimal Method to Design Wireless Sensor Network Structures

    Directory of Open Access Journals (Sweden)

    Yang Ling

    2018-01-01

    Full Text Available In order to optimize the structure of wireless sensor network, an improved wireless sensor network sleep mechanism is proposed. First, some nodes in the area with too high redundancy are dormant by density control, so that the active nodes are even more distributed. Then, the active node is subjected to circular coverage redundancy decision. Different circumferential coverage decision methods are used for network boundary nodes and non-boundary nodes. As a result, the boundary nodes and non-boundary nodes are well dormant, and the network redundancy is reduced. The simulation results show that the improved dormancy mechanism makes the number of active nodes in the network smaller and more evenly, and the network lifetime is extended on the basis of maintaining the original coverage of the network. Therefore, the proposed method can achieve optimal coverage in wireless sensor networks. The network prolongs network lifetime while ensuring reliable monitoring performance.

  4. Optimal and adaptive methods of processing hydroacoustic signals (review)

    Science.gov (United States)

    Malyshkin, G. S.; Sidel'nikov, G. B.

    2014-09-01

    Different methods of optimal and adaptive processing of hydroacoustic signals for multipath propagation and scattering are considered. Advantages and drawbacks of the classical adaptive (Capon, MUSIC, and Johnson) algorithms and "fast" projection algorithms are analyzed for the case of multipath propagation and scattering of strong signals. The classical optimal approaches to detecting multipath signals are presented. A mechanism of controlled normalization of strong signals is proposed to automatically detect weak signals. The results of simulating the operation of different detection algorithms for a linear equidistant array under multipath propagation and scattering are presented. An automatic detector is analyzed, which is based on classical or fast projection algorithms, which estimates the background proceeding from median filtering or the method of bilateral spatial contrast.

  5. Experimental methods for the analysis of optimization algorithms

    CERN Document Server

    Bartz-Beielstein, Thomas; Paquete, Luis; Preuss, Mike

    2010-01-01

    In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. This book consists of methodological contributions on diffe

  6. Global tests of P-values for multifactor dimensionality reduction models in selection of optimal number of target genes.

    Science.gov (United States)

    Dai, Hongying; Bhandary, Madhusudan; Becker, Mara; Leeder, J Steven; Gaedigk, Roger; Motsinger-Reif, Alison A

    2012-05-22

    Multifactor Dimensionality Reduction (MDR) is a popular and successful data mining method developed to characterize and detect nonlinear complex gene-gene interactions (epistasis) that are associated with disease susceptibility. Because MDR uses a combinatorial search strategy to detect interaction, several filtration techniques have been developed to remove genes (SNPs) that have no interactive effects prior to analysis. However, the cutoff values implemented for these filtration methods are arbitrary, therefore different choices of cutoff values will lead to different selections of genes (SNPs). We suggest incorporating a global test of p-values to filtration procedures to identify the optimal number of genes/SNPs for further MDR analysis and demonstrate this approach using a ReliefF filter technique. We compare the performance of different global testing procedures in this context, including the Kolmogorov-Smirnov test, the inverse chi-square test, the inverse normal test, the logit test, the Wilcoxon test and Tippett's test. Additionally we demonstrate the approach on a real data application with a candidate gene study of drug response in Juvenile Idiopathic Arthritis. Extensive simulation of correlated p-values show that the inverse chi-square test is the most appropriate approach to be incorporated with the screening approach to determine the optimal number of SNPs for the final MDR analysis. The Kolmogorov-Smirnov test has high inflation of Type I errors when p-values are highly correlated or when p-values peak near the center of histogram. Tippett's test has very low power when the effect size of GxG interactions is small. The proposed global tests can serve as a screening approach prior to individual tests to prevent false discovery. Strong power in small sample sizes and well controlled Type I error in absence of GxG interactions make global tests highly recommended in epistasis studies.

  7. A seismic fault recognition method based on ant colony optimization

    Science.gov (United States)

    Chen, Lei; Xiao, Chuangbai; Li, Xueliang; Wang, Zhenli; Huo, Shoudong

    2018-05-01

    Fault recognition is an important section in seismic interpretation and there are many methods for this technology, but no one can recognize fault exactly enough. For this problem, we proposed a new fault recognition method based on ant colony optimization which can locate fault precisely and extract fault from the seismic section. Firstly, seismic horizons are extracted by the connected component labeling algorithm; secondly, the fault location are decided according to the horizontal endpoints of each horizon; thirdly, the whole seismic section is divided into several rectangular blocks and the top and bottom endpoints of each rectangular block are considered as the nest and food respectively for the ant colony optimization algorithm. Besides that, the positive section is taken as an actual three dimensional terrain by using the seismic amplitude as a height. After that, the optimal route from nest to food calculated by the ant colony in each block is judged as a fault. Finally, extensive comparative tests were performed on the real seismic data. Availability and advancement of the proposed method were validated by the experimental results.

  8. Using genetic algorithms to optimize the analogue method for precipitation prediction in the Swiss Alps

    Science.gov (United States)

    Horton, Pascal; Jaboyedoff, Michel; Obled, Charles

    2018-01-01

    Analogue methods provide a statistical precipitation prediction based on synoptic predictors supplied by general circulation models or numerical weather prediction models. The method samples a selection of days in the archives that are similar to the target day to be predicted, and consider their set of corresponding observed precipitation (the predictand) as the conditional distribution for the target day. The relationship between the predictors and predictands relies on some parameters that characterize how and where the similarity between two atmospheric situations is defined. This relationship is usually established by a semi-automatic sequential procedure that has strong limitations: (i) it cannot automatically choose the pressure levels and temporal windows (hour of the day) for a given meteorological variable, (ii) it cannot handle dependencies between parameters, and (iii) it cannot easily handle new degrees of freedom. In this work, a global optimization approach relying on genetic algorithms could optimize all parameters jointly and automatically. The global optimization was applied to some variants of the analogue method for the Rhône catchment in the Swiss Alps. The performance scores increased compared to reference methods, especially for days with high precipitation totals. The resulting parameters were found to be relevant and coherent between the different subregions of the catchment. Moreover, they were obtained automatically and objectively, which reduces the effort that needs to be invested in exploration attempts when adapting the method to a new region or for a new predictand. For example, it obviates the need to assess a large number of combinations of pressure levels and temporal windows of predictor variables that were manually selected beforehand. The optimization could also take into account parameter inter-dependencies. In addition, the approach allowed for new degrees of freedom, such as a possible weighting between pressure levels, and

  9. New design method for valves internals, to optimize process

    Energy Technology Data Exchange (ETDEWEB)

    Jorge, Leonardo [PDVSA (Venezuela)

    2011-07-01

    In the heavy oil industry, various methods can be used to reduce the viscosity of oil, one of them being the injection of diluent. This method is commonly used in the Orinoco oil belt but it requires good control of the volume of diluent injected as well as the gas flow to optimize production; thus flow control valves need to be accurate. A new valve with a new method was designed with the characteristic of being very reliable and was then bench tested and compared with the other commercially available valves. Results showed better repeatability, accuracy and reliability with lower maintenance for the new method. The use of this valve provides significant savings while distributing the exact amount of fluids; up to date a less than 2% failure rate has been recorded in the field. The new method developed demonstrated impressive performance and PDVSA has decided to use it in mass.

  10. A SPICE Blind Test to Benchmark Global Tomographic Methods

    Science.gov (United States)

    Qin, Y.; Capdeville, Y.; Maupin, V.; Montagner, J.

    2006-12-01

    The different existing global tomographic methods result in different models of the Earth. In order to test how current imaging techniques are limited by approximations in theory and the inadequacy of data quality and coverage, we are undertaking a blind test of global inversion algorithms using complete 3D synthetic seismograms within SPICE (Seismic wave Propagation and Imaging in Complex media: a European network). First, a complex global anisotropic anelastic model has been constructed by summing the 1D reference model, deterministic and random anomalies and anisotropic crystal. This model includes 3D heterogeneities in velocity, anisotropy and attenuation at different scales in the whole mantle, as well as topography and crustal structure. In addition, the rotation and ellipticity are also included. Synthetic seismograms were generated using the Coupling Spectral Element Method with a minimum period of 32s, for a realistic distribution of 29 events and 256 stations. The synthetic seismograms have been made available to the scientific community worldwide at the IPGP website http://www.ipgp.jussieu.fr/~qyl/. Any group willing to test his tomographic technique is encouraged to download the synthetic dataset.g

  11. Solving Bi-Objective Optimal Power Flow using Hybrid method of Biogeography-Based Optimization and Differential Evolution Algorithm: A case study of the Algerian Electrical Network

    Directory of Open Access Journals (Sweden)

    Ouafa Herbadji

    2016-03-01

    Full Text Available This paper proposes a new hybrid metaheuristique algorithm based on the hybridization of Biogeography-based optimization with the Differential Evolution for solving the optimal power flow problem with emission control. The biogeography-based optimization (BBO algorithm is strongly influenced by equilibrium theory of island biogeography, mainly through two steps: Migration and Mutation. Differential Evolution (DE is one of the best Evolutionary Algorithms for global optimization. The hybridization of these two methods is used to overcome traps of local optimal solutions and problems of time consumption. The objective of this paper is to minimize the total fuel cost of generation, total emission, total real power loss and also maintain an acceptable system performance in terms of limits on generator real power, bus voltages and power flow of transmission lines. In the present work, BBO/DE has been applied to solve the optimal power flow problems on IEEE 30-bus test system and the Algerian electrical network 114 bus. The results obtained from this method show better performances compared with DE, BBO and other well known metaheuristique and evolutionary optimization methods.

  12. Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

    Science.gov (United States)

    Xu, Gang; Li, Ming; Mourrain, Bernard; Rabczuk, Timon; Xu, Jinlan; Bordas, Stéphane P. A.

    2018-01-01

    In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\\'ezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior B\\'ezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring B\\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\\'ezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach.

  13. Comparison of optimization methods for electronic-structure calculations

    International Nuclear Information System (INIS)

    Garner, J.; Das, S.G.; Min, B.I.; Woodward, C.; Benedek, R.

    1989-01-01

    The performance of several local-optimization methods for calculating electronic structure is compared. The fictitious first-order equation of motion proposed by Williams and Soler is integrated numerically by three procedures: simple finite-difference integration, approximate analytical integration (the Williams-Soler algorithm), and the Born perturbation series. These techniques are applied to a model problem for which exact solutions are known, the Mathieu equation. The Williams-Soler algorithm and the second Born approximation converge equally rapidly, but the former involves considerably less computational effort and gives a more accurate converged solution. Application of the method of conjugate gradients to the Mathieu equation is discussed

  14. Optimization in engineering sciences approximate and metaheuristic methods

    CERN Document Server

    Stefanoiu, Dan; Popescu, Dumitru; Filip, Florin Gheorghe; El Kamel, Abdelkader

    2014-01-01

    The purpose of this book is to present the main metaheuristics and approximate and stochastic methods for optimization of complex systems in Engineering Sciences. It has been written within the framework of the European Union project ERRIC (Empowering Romanian Research on Intelligent Information Technologies), which is funded by the EU's FP7 Research Potential program and has been developed in co-operation between French and Romanian teaching researchers. Through the principles of various proposed algorithms (with additional references) this book allows the reader to explore various methods o

  15. A discrete optimization method for nuclear fuel management

    International Nuclear Information System (INIS)

    Argaud, J.P.

    1993-04-01

    Nuclear loading pattern elaboration can be seen as a combinational optimization problem of tremendous size and with non-linear cost-functions, and search are always numerically expensive. After a brief introduction of the main aspects of nuclear fuel management, this paper presents a new idea to treat the combinational problem by using informations included in the gradient of a cost function. The method is to choose, by direct observation of the gradient, the more interesting changes in fuel loading patterns. An example is then developed to illustrate an operating mode of the method, and finally, connections with simulated annealing and genetic algorithms are described as an attempt to improve search processes

  16. Kernel method for clustering based on optimal target vector

    International Nuclear Information System (INIS)

    Angelini, Leonardo; Marinazzo, Daniele; Pellicoro, Mario; Stramaglia, Sebastiano

    2006-01-01

    We introduce Ising models, suitable for dichotomic clustering, with couplings that are (i) both ferro- and anti-ferromagnetic (ii) depending on the whole data-set and not only on pairs of samples. Couplings are determined exploiting the notion of optimal target vector, here introduced, a link between kernel supervised and unsupervised learning. The effectiveness of the method is shown in the case of the well-known iris data-set and in benchmarks of gene expression levels, where it works better than existing methods for dichotomic clustering

  17. GMI Instrument Spin Balance Method, Optimization, Calibration, and Test

    Science.gov (United States)

    Ayari, Laoucet; Kubitschek, Michael; Ashton, Gunnar; Johnston, Steve; Debevec, Dave; Newell, David; Pellicciotti, Joseph

    2014-01-01

    The Global Microwave Imager (GMI) instrument must spin at a constant rate of 32 rpm continuously for the 3 year mission life. Therefore, GMI must be very precisely balanced about the spin axis and CG to maintain stable scan pointing and to minimize disturbances imparted to the spacecraft and attitude control on-orbit. The GMI instrument is part of the core Global Precipitation Measurement (GPM) spacecraft and is used to make calibrated radiometric measurements at multiple microwave frequencies and polarizations. The GPM mission is an international effort managed by the National Aeronautics and Space Administration (NASA) to improve climate, weather, and hydro-meteorological predictions through more accurate and frequent precipitation measurements. Ball Aerospace and Technologies Corporation (BATC) was selected by NASA Goddard Space Flight Center to design, build, and test the GMI instrument. The GMI design has to meet a challenging set of spin balance requirements and had to be brought into simultaneous static and dynamic spin balance after the entire instrument was already assembled and before environmental tests began. The focus of this contribution is on the analytical and test activities undertaken to meet the challenging spin balance requirements of the GMI instrument. The novel process of measuring the residual static and dynamic imbalances with a very high level of accuracy and precision is presented together with the prediction of the optimal balance masses and their locations.

  18. A new placement optimization method for viscoelastic dampers: Energy dissipation method

    Science.gov (United States)

    Qu, Ji-Ting

    2012-09-01

    A new mathematic model of location optimization for viscoelastic dampers is established through energy analysis based on force analogy method. Three working conditions (three lower limits of the new location index) as well as four ground motions are considered in this study, using MATLAB and SAP2000 in programming and verifying. This paper deals with the optimal placement of viscoelastic dampers and step-by-step time history analyses are carried out. Numerical analysis is illustrated to verify the effectiveness and feasibility of the new mathematic model for structural control. In addition, not only the optimal placement method using force analogy method can confirm dampers' locations all at once and be accurate to each span, but also it is without circular calculating. At last, a few helpful conclusions on viscoelastic dampers' optimal placement are made.

  19. Optimization strategies of in-tube extraction (ITEX) methods.

    Science.gov (United States)

    Laaks, Jens; Jochmann, Maik A; Schilling, Beat; Schmidt, Torsten C

    2015-09-01

    Microextraction techniques, especially dynamic techniques like in-tube extraction (ITEX), can require an extensive method optimization procedure. This work summarizes the experiences from several methods and gives recommendations for the setting of proper extraction conditions to minimize experimental effort. Therefore, the governing parameters of the extraction and injection stages are discussed. This includes the relative extraction efficiencies of 11 kinds of sorbent tubes, either commercially available or custom made, regarding 53 analytes from different classes of compounds. They cover aromatics, heterocyclic aromatics, halogenated hydrocarbons, fuel oxygenates, alcohols, esters, and aldehydes. The number of extraction strokes and the corresponding extraction flow, also in dependence of the expected analyte concentrations, are discussed as well as the interactions between sample and extraction phase temperature. The injection parameters cover two different injection methods. The first is intended for the analysis of highly volatile analytes and the second either for the analysis of lower volatile analytes or when the analytes can be re-focused by a cold trap. The desorption volume, the desorption temperature, and the desorption flow are compared, together with the suitability of both methods for analytes of varying volatilities. The results are summarized in a flow chart, which can be used to select favorable starting conditions for further method optimization.

  20. Visualization of Global Disease Burden for the Optimization of Patient Management and Treatment

    Directory of Open Access Journals (Sweden)

    Winfried Schlee

    2017-06-01

    Full Text Available BackgroundThe assessment and treatment of complex disorders is challenged by the multiple domains and instruments used to evaluate clinical outcome. With the large number of assessment tools typically used in complex disorders comes the challenge of obtaining an integrative view of disease status to further evaluate treatment outcome both at the individual level and at the group level. Radar plots appear as an attractive visual tool to display multivariate data on a two-dimensional graphical illustration. Here, we describe the use of radar plots for the visualization of disease characteristics applied in the context of tinnitus, a complex and heterogeneous condition, the treatment of which has shown mixed success.MethodsData from two different cohorts, the Swedish Tinnitus Outreach Project (STOP and the Tinnitus Research Initiative (TRI database, were used. STOP is a population-based cohort where cross-sectional data from 1,223 non-tinnitus and 933 tinnitus subjects were analyzed. By contrast, the TRI contained data from 571 patients who underwent various treatments and whose Clinical Global Impression (CGI score was accessible to infer treatment outcome. In the latter, 34,560 permutations were tested to evaluate whether a particular ordering of the instruments could reflect better the treatment outcome measured with the CGI.ResultsRadar plots confirmed that tinnitus subtypes such as occasional and chronic tinnitus from the STOP cohort could be strikingly different, and helped appreciate a gender bias in tinnitus severity. Radar plots with greater surface areas were consistent with greater burden, and enabled a rapid appreciation of the global distress associated with tinnitus in patients categorized according to tinnitus severity. Permutations in the arrangement of instruments allowed to identify a configuration with minimal variance and maximized surface difference between CGI groups from the TRI database, thus affording a means of optimally

  1. Optimizing rice yields while minimizing yield-scaled global warming potential.

    Science.gov (United States)

    Pittelkow, Cameron M; Adviento-Borbe, Maria A; van Kessel, Chris; Hill, James E; Linquist, Bruce A

    2014-05-01

    To meet growing global food demand with limited land and reduced environmental impact, agricultural greenhouse gas (GHG) emissions are increasingly evaluated with respect to crop productivity, i.e., on a yield-scaled as opposed to area basis. Here, we compiled available field data on CH4 and N2 O emissions from rice production systems to test the hypothesis that in response to fertilizer nitrogen (N) addition, yield-scaled global warming potential (GWP) will be minimized at N rates that maximize yields. Within each study, yield N surplus was calculated to estimate deficit or excess N application rates with respect to the optimal N rate (defined as the N rate at which maximum yield was achieved). Relationships between yield N surplus and GHG emissions were assessed using linear and nonlinear mixed-effects models. Results indicate that yields increased in response to increasing N surplus when moving from deficit to optimal N rates. At N rates contributing to a yield N surplus, N2 O and yield-scaled N2 O emissions increased exponentially. In contrast, CH4 emissions were not impacted by N inputs. Accordingly, yield-scaled CH4 emissions decreased with N addition. Overall, yield-scaled GWP was minimized at optimal N rates, decreasing by 21% compared to treatments without N addition. These results are unique compared to aerobic cropping systems in which N2 O emissions are the primary contributor to GWP, meaning yield-scaled GWP may not necessarily decrease for aerobic crops when yields are optimized by N fertilizer addition. Balancing gains in agricultural productivity with climate change concerns, this work supports the concept that high rice yields can be achieved with minimal yield-scaled GWP through optimal N application rates. Moreover, additional improvements in N use efficiency may further reduce yield-scaled GWP, thereby strengthening the economic and environmental sustainability of rice systems. © 2013 John Wiley & Sons Ltd.

  2. Global Sea Surface Temperature and Sea Level Rise Estimation with Optimal Historical Time Lag Data

    Directory of Open Access Journals (Sweden)

    Mustafa M. Aral

    2016-11-01

    Full Text Available Prediction of global temperatures and sea level rise (SLR is important for sustainable development planning of coastal regions of the world and the health and safety of communities living in these regions. In this study, climate change effects on sea level rise is investigated using a dynamic system model (DSM with time lag on historical input data. A time-invariant (TI-DSM and time-variant dynamic system model (TV-DSM with time lag is developed to predict global temperatures and SLR in the 21st century. The proposed model is an extension of the DSM developed by the authors. The proposed model includes the effect of temperature and sea level states of several previous years on the current temperature and sea level over stationary and also moving scale time periods. The optimal time lag period used in the model is determined by minimizing a synthetic performance index comprised of the root mean square error and coefficient of determination which is a measure for the reliability of the predictions. Historical records of global temperature and sea level from 1880 to 2001 are used to calibrate the model. The optimal time lag is determined to be eight years, based on the performance measures. The calibrated model was then used to predict the global temperature and sea levels in the 21st century using a fixed time lag period and moving scale time lag periods. To evaluate the adverse effect of greenhouse gas emissions on SLR, the proposed model was also uncoupled to project the SLR based on global temperatures that are obtained from the Intergovernmental Panel on Climate Change (IPCC emission scenarios. The projected SLR estimates for the 21st century are presented comparatively with the predictions made in previous studies.

  3. Optimization and modification of the method for detection of rhamnolipids

    Directory of Open Access Journals (Sweden)

    Takeshi Tabuchi

    2015-10-01

    Full Text Available Use of biosurfactants in bioremediation, facilitates and accelerates microbial degradation of hydrocarbons. CTAB/MB agar method created by Siegmund & Wagner for screening of rhamnolipids (RL producing strains, has been widely used but has not improved significantly for more than 20 years. To optimize the technique as a quantitative method, CTAB/MB agar plates were made and different variables were tested, like incubation time, cooling, CTAB concentration, methylene blue presence, wells diameter and inocula volume. Furthermore, a new method for RL detection within halos was developed: precipitation of RL with HCl, allows the formation a new halos pattern, easier to observe and to measure. This research reaffirm that this method is not totally suitable for a fine quantitative analysis, because of the difficulty to accurately correlate RL concentration and the area of the halos. RL diffusion does not seem to have a simple behavior and there are a lot of factors that affect RL migration rate.

  4. Design optimization methods for genomic DNA tiling arrays.

    Science.gov (United States)

    Bertone, Paul; Trifonov, Valery; Rozowsky, Joel S; Schubert, Falk; Emanuelsson, Olof; Karro, John; Kao, Ming-Yang; Snyder, Michael; Gerstein, Mark

    2006-02-01

    A recent development in microarray research entails the unbiased coverage, or tiling, of genomic DNA for the large-scale identification of transcribed sequences and regulatory elements. A central issue in designing tiling arrays is that of arriving at a single-copy tile path, as significant sequence cross-hybridization can result from the presence of non-unique probes on the array. Due to the fragmentation of genomic DNA caused by the widespread distribution of repetitive elements, the problem of obtaining adequate sequence coverage increases with the sizes of subsequence tiles that are to be included in the design. This becomes increasingly problematic when considering complex eukaryotic genomes that contain many thousands of interspersed repeats. The general problem of sequence tiling can be framed as finding an optimal partitioning of non-repetitive subsequences over a prescribed range of tile sizes, on a DNA sequence comprising repetitive and non-repetitive regions. Exact solutions to the tiling problem become computationally infeasible when applied to large genomes, but successive optimizations are developed that allow their practical implementation. These include an efficient method for determining the degree of similarity of many oligonucleotide sequences over large genomes, and two algorithms for finding an optimal tile path composed of longer sequence tiles. The first algorithm, a dynamic programming approach, finds an optimal tiling in linear time and space; the second applies a heuristic search to reduce the space complexity to a constant requirement. A Web resource has also been developed, accessible at http://tiling.gersteinlab.org, to generate optimal tile paths from user-provided DNA sequences.

  5. Optimization of the measuring method selection for natural radionuclides

    International Nuclear Information System (INIS)

    Heinrich, T.; Funke, L.; Koehler, M.; Schkade, U.K.; Ullrich, F.; Loebner, W.; Hoepner, J.; Weiss, D.

    2007-01-01

    The publication is aimed to an optimized selection of measuring methods for the evaluation of natural radionuclides in environmental media, taking into account the required financial and temporal investment besides the informative value of the results. The evaluation is considered as a recommendation for contractors concerning required measurements or for installation or upgrading of laboratory equipment. The evaluation identifies measuring requirements and boundary conditions according to legal regulations and discusses a strategy to reach optimized results. The radiological environment monitoring is focused on the estimation of radiation exposure of personal and public. Requirements for measuring techniques (detection limits, limit values and guideline values) are summarized in tables. The evaluation is covering radionuclide measurements in the following media: air (airborne particulates); water; soils, sediments and residues; residues from natural gas, crude oil and thermal water extraction; uranium containing paints in the porcelain industry; thorium compounds for weld electrodes; filter dusts from the steel industry; biomedia

  6. Newton-type methods for optimization and variational problems

    CERN Document Server

    Izmailov, Alexey F

    2014-01-01

    This book presents comprehensive state-of-the-art theoretical analysis of the fundamental Newtonian and Newtonian-related approaches to solving optimization and variational problems. A central focus is the relationship between the basic Newton scheme for a given problem and algorithms that also enjoy fast local convergence. The authors develop general perturbed Newtonian frameworks that preserve fast convergence and consider specific algorithms as particular cases within those frameworks, i.e., as perturbations of the associated basic Newton iterations. This approach yields a set of tools for the unified treatment of various algorithms, including some not of the Newton type per se. Among the new subjects addressed is the class of degenerate problems. In particular, the phenomenon of attraction of Newton iterates to critical Lagrange multipliers and its consequences as well as stabilized Newton methods for variational problems and stabilized sequential quadratic programming for optimization. This volume will b...

  7. Maximum Power Point Tracking Method Based on Modified Particle Swarm Optimization for Photovoltaic Systems

    Directory of Open Access Journals (Sweden)

    Kuei-Hsiang Chao

    2013-01-01

    Full Text Available This study investigated the output characteristics of photovoltaic module arrays with partial module shading. Accordingly, we presented a maximum power point tracking (MPPT method that can effectively track the global optimum of multipeak curves. This method was based on particle swarm optimization (PSO. The concept of linear decreases in weighting was added to improve the tracking performance of the maximum power point tracker. Simulation results were used to verify that this method could successfully track maximum power points in the output characteristic curves of photovoltaic modules with multipeak values. The results also established that the performance of the modified PSO-based MPPT method was superior to that of conventional PSO methods.

  8. The L_infinity constrained global optimal histogram equalization technique for real time imaging

    Science.gov (United States)

    Ren, Qiongwei; Niu, Yi; Liu, Lin; Jiao, Yang; Shi, Guangming

    2015-08-01

    Although the current imaging sensors can achieve 12 or higher precision, the current display devices and the commonly used digital image formats are still only 8 bits. This mismatch causes significant waste of the sensor precision and loss of information when storing and displaying the images. For better usage of the precision-budget, tone mapping operators have to be used to map the high-precision data into low-precision digital images adaptively. In this paper, the classic histogram equalization tone mapping operator is reexamined in the sense of optimization. We point out that the traditional histogram equalization technique and its variants are fundamentally improper by suffering from local optimum problems. To overcome this drawback, we remodel the histogram equalization tone mapping task based on graphic theory which achieves the global optimal solutions. Another advantage of the graphic-based modeling is that the tone-continuity is also modeled as a vital constraint in our approach which suppress the annoying boundary artifacts of the traditional approaches. In addition, we propose a novel dynamic programming technique to solve the histogram equalization problem in real time. Experimental results shows that the proposed tone-preserved global optimal histogram equalization technique outperforms the traditional approaches by exhibiting more subtle details in the foreground while preserving the smoothness of the background.

  9. Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule

    KAUST Repository

    Liang, Faming

    2014-04-03

    Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to use this much CPU time. This article proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, for example, a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors. Supplementary materials for this article are available online.

  10. Stochastic Global Optimization and Its Applications with Fuzzy Adaptive Simulated Annealing

    CERN Document Server

    Aguiar e Oliveira Junior, Hime; Petraglia, Antonio; Rembold Petraglia, Mariane; Augusta Soares Machado, Maria

    2012-01-01

    Stochastic global optimization is a very important subject, that has applications in virtually all areas of science and technology. Therefore there is nothing more opportune than writing a book about a successful and mature algorithm that turned out to be a good tool in solving difficult problems. Here we present some techniques for solving  several problems by means of Fuzzy Adaptive Simulated Annealing (Fuzzy ASA), a fuzzy-controlled version of ASA, and by ASA itself. ASA is a sophisticated global optimization algorithm that is based upon ideas of the simulated annealing paradigm, coded in the C programming language and developed to statistically find the best global fit of a nonlinear constrained, non-convex cost function over a multi-dimensional space. By presenting detailed examples of its application we want to stimulate the reader’s intuition and make the use of Fuzzy ASA (or regular ASA) easier for everyone wishing to use these tools to solve problems. We kept formal mathematical requirements to a...

  11. Global regularization method for planar restricted three-body problem

    Directory of Open Access Journals (Sweden)

    Sharaf M.A.

    2015-01-01

    Full Text Available In this paper, global regularization method for planar restricted three-body problem is purposed by using the transformation z = x+iy = ν cos n(u+iv, where i = √−1, 0 < ν ≤ 1 and n is a positive integer. The method is developed analytically and computationally. For the analytical developments, analytical solutions in power series of the pseudotime τ are obtained for positions and velocities (u, v, u', v' and (x, y, x˙, y˙ in both regularized and physical planes respectively, the physical time t is also obtained as power series in τ. Moreover, relations between the coefficients of the power series are obtained for two consequent values of n. Also, we developed analytical solutions in power series form for the inverse problem of finding τ in terms of t. As typical examples, three symbolic expressions for the coefficients of the power series were developed in terms of initial values. As to the computational developments, the global regularized equations of motion are developed together with their initial values in forms suitable for digital computations using any differential equations solver. On the other hand, for numerical evolutions of power series, an efficient method depending on the continued fraction theory is provided.

  12. Global Regularization Method for Planar Restricted Three-body Problem

    Science.gov (United States)

    Sharaf, M. A.; Dwidar, H. R.

    2015-12-01

    In this paper, global regularization method for planar restricted three-body problem is purposed by using the transformation z=x+iy=ν cos n(u+iv), where i=√{-1}, 0 < ν ≤ 1 and n is a positive integer. The method is developed analytically and computationally. For the analytical developments, analytical solutions in power series of the pseudo-time τ are obtained for positions and velocities (u,v,u',v') and (x,y,dot{x},dot{y}) in both regularized and physical planes respectively, the physical time {t} is also obtained as power series in τ. Moreover, relations between the coefficients of the power series are obtained for two consequent values of {n}. Also, we developed analytical solutions in power series form for the inverse problem of finding τ in terms of {t}. As typical examples, three symbolic expressions for the coefficients of the power series were developed in terms of the initial values. As to the computational developments, the global regularized equations of motion are developed together with their initial values in forms suitable for digital computations using any differential equations solver. On the other hand, for the numerical evolutions of power series, an efficient method depending on the continued fraction theory is provided.

  13. Recommended GIS Analysis Methods for Global Gridded Population Data

    Science.gov (United States)

    Frye, C. E.; Sorichetta, A.; Rose, A.

    2017-12-01

    When using geographic information systems (GIS) to analyze gridded, i.e., raster, population data, analysts need a detailed understanding of several factors that affect raster data processing, and thus, the accuracy of the results. Global raster data is most often provided in an unprojected state, usually in the WGS 1984 geographic coordinate system. Most GIS functions and tools evaluate data based on overlay relationships (area) or proximity (distance). Area and distance for global raster data can be either calculated directly using the various earth ellipsoids or after transforming the data to equal-area/equidistant projected coordinate systems to analyze all locations equally. However, unlike when projecting vector data, not all projected coordinate systems can support such analyses equally, and the process of transforming raster data from one coordinate space to another often results unmanaged loss of data through a process called resampling. Resampling determines which values to use in the result dataset given an imperfect locational match in the input dataset(s). Cell size or resolution, registration, resampling method, statistical type, and whether the raster represents continuous or discreet information potentially influence the quality of the result. Gridded population data represent estimates of population in each raster cell, and this presentation will provide guidelines for accurately transforming population rasters for analysis in GIS. Resampling impacts the display of high resolution global gridded population data, and we will discuss how to properly handle pyramid creation using the Aggregate tool with the sum option to create overviews for mosaic datasets.

  14. Solving the economic dispatch problem with a modified quantum-behaved particle swarm optimization method

    International Nuclear Information System (INIS)

    Sun Jun; Fang Wei; Wang Daojun; Xu Wenbo

    2009-01-01

    In this paper, a modified quantum-behaved particle swarm optimization (QPSO) method is proposed to solve the economic dispatch (ED) problem in power systems, whose objective is to simultaneously minimize the generation cost rate while satisfying various equality and inequality constraints. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability of the algorithm. Many nonlinear characteristics of the generator, such as ramp rate limits, prohibited operating zones, and nonsmooth cost functions are considered when the proposed method is used in practical generator operation. The feasibility of the QPSO-DM method is demonstrated by three different power systems. It is compared with the QPSO, the differential evolution (DE), the particle swarm optimization (PSO), and the genetic algorithm (GA) in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed QPSO-DM method is able to obtain higher quality solutions stably and efficiently in the ED problem than any other tested optimization algorithm.

  15. Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles

    Directory of Open Access Journals (Sweden)

    Lee Yun-Shien

    2008-03-01

    Full Text Available Abstract Background The hierarchical clustering tree (HCT with a dendrogram 1 and the singular value decomposition (SVD with a dimension-reduced representative map 2 are popular methods for two-way sorting the gene-by-array matrix map employed in gene expression profiling. While HCT dendrograms tend to optimize local coherent clustering patterns, SVD leading eigenvectors usually identify better global grouping and transitional structures. Results This study proposes a flipping mechanism for a conventional agglomerative HCT using a rank-two ellipse (R2E, an improved SVD algorithm for sorting purpose seriation by Chen 3 as an external reference. While HCTs always produce permutations with good local behaviour, the rank-two ellipse seriation gives the best global grouping patterns and smooth transitional trends. The resulting algorithm automatically integrates the desirable properties of each method so that users have access to a clustering and visualization environment for gene expression profiles that preserves coherent local clusters and identifies global grouping trends. Conclusion We demonstrate, through four examples, that the proposed method not only possesses better numerical and statistical properties, it also provides more meaningful biomedical insights than other sorting algorithms. We suggest that sorted proximity matrices for genes and arrays, in addition to the gene-by-array expression matrix, can greatly aid in the search for comprehensive understanding of gene expression structures. Software for the proposed methods can be obtained at http://gap.stat.sinica.edu.tw/Software/GAP.

  16. Solving a large scale nonlinear unconstrained optimization with exact line search direction by using new coefficient of conjugate gradient methods

    Science.gov (United States)

    Mohamed, Nur Syarafina; Mamat, Mustafa; Rivaie, Mohd

    2016-11-01

    Conjugate gradient (CG) methods are one of the tools in optimization. Due to its low computational memory requirement, this method is used in solving several of nonlinear unconstrained optimization problems from designs, economics, physics and engineering. In this paper, a new modification of CG family coefficient (βk) is proposed and posses global convergence under exact line search direction. Numerical experimental results based on the number of iterations and central processing unit (CPU) time show that the new βk performs better than some other well known CG methods under some standard test functions.

  17. Nonlinear analysis of a new car-following model accounting for the global average optimal velocity difference

    Science.gov (United States)

    Peng, Guanghan; Lu, Weizhen; He, Hongdi

    2016-09-01

    In this paper, a new car-following model is proposed by considering the global average optimal velocity difference effect on the basis of the full velocity difference (FVD) model. We investigate the influence of the global average optimal velocity difference on the stability of traffic flow by making use of linear stability analysis. It indicates that the stable region will be enlarged by taking the global average optimal velocity difference effect into account. Subsequently, the mKdV equation near the critical point and its kink-antikink soliton solution, which can describe the traffic jam transition, is derived from nonlinear analysis. Furthermore, numerical simulations confirm that the effect of the global average optimal velocity difference can efficiently improve the stability of traffic flow, which show that our new consideration should be taken into account to suppress the traffic congestion for car-following theory.

  18. An Effective Hybrid Firefly Algorithm with Harmony Search for Global Numerical Optimization

    Directory of Open Access Journals (Sweden)

    Lihong Guo

    2013-01-01

    Full Text Available A hybrid metaheuristic approach by hybridizing harmony search (HS and firefly algorithm (FA, namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods.

  19. Optimizing ETL by a Two-level Data Staging Method

    DEFF Research Database (Denmark)

    Liu, Xiufeng; Iftikhar, Nadeem; Nielsen, Per Sieverts

    2016-01-01

    In data warehousing, the data from source systems are populated into a central data warehouse (DW) through extraction, transformation and loading (ETL). The standard ETL approach usually uses sequential jobs to process the data with dependencies, such as dimension and fact data. It is a non......-trivial task to process the so-called early-/late-arriving data, which arrive out of order. This paper proposes a two-level data staging area method to optimize ETL. The proposed method is an all-in-one solution that supports processing different types of data from operational systems, including early......-/late-arriving data, and fast-/slowly-changing data. The introduced additional staging area decouples loading process from data extraction and transformation, which improves ETL flexibility and minimizes intervention to the data warehouse. This paper evaluates the proposed method empirically, which shows...

  20. Evolutionary Search for Globally Optimal Stable Multicycles in Complex Systems with Inventory Couplings

    Directory of Open Access Journals (Sweden)

    M. Skowron

    2009-01-01

    Full Text Available This note is devoted to multiperiodically operated complex system with inventory couplings transferring waste products from some subsystems as useful components to other subsystems. The flexibility of the inventory couplings is used to force each of the subsystems with its own period and to exploit its particular dynamic properties. This enhances the performance of the complex system endowed with many recycling loops, which reduce the amount of waste products endangering the natural environment. The subsystems are characterized by generalized populations composed of the individuals (the cycles, each of them encompasses its period, its initial state, its local control, and its inventory interaction. An evolutionary optimization algorithm employing such generalized populations coordinated on the basis of the inventory interaction constraints is developed. It includes the stability requirements imposed on the cyclic control processes connected with particular subsystems. The algorithm proposed is applied to the global multiperiodic optimization of some interconnected chemical production processes.