• Title/Summary/Keyword: Global Optimization

Search Result 1,114, Processing Time 0.03 seconds

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 2

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.317-334
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

Economic Power Dispatch with Valve Point Effects Using Bee Optimization Algorithm

  • Kumar, Rajesh;Sharma, Devendra;Kumar, Anupam
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.1
    • /
    • pp.19-27
    • /
    • 2009
  • This paper presents a newly developed optimization algorithm, the Bee Optimization Algorithm (BeeOA), to solve the economic power dispatch (EPD) problem. The authors have developed a derivative free and global optimization technique based on the working of the honey bee. The economic power dispatch problem is a nonlinear constrained optimization problem. Classical optimization techniques fail to provide a global solution and evolutionary algorithms provide only a good enough solution. The proposed approach has been examined and tested on two test systems with different objectives. A simple power dispatch problem is tested first on 6 generators and then the algorithm is demonstrated on 13 thermal unit systems whose incremental fuel cost function takes into account the value point loading effect. The results are promising and show the effectiveness and robustness of the proposed approach over recently reported methods.

Comparative study of some algorithms for global optimization (광역최적화 방법론의 비교 연구)

  • Yang, Seung-Ho;Lee, Hyeon-Ju;Lee, Jae-Uk
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.693-696
    • /
    • 2006
  • Global optimization is a method for finding more reliable models in various fields, such as financial engineering, pattern recognition, process optimization. In this study, we compare and analyze the performance of the state-of-the-art global optimization techniques, which include Genetic Algorithm (DE,SCGA), Simulated Annealing (ASA, DSSA, SAHPS), Tabu & Direct Search (DTS, DIRECT), Deterministic (MCS, SNOBIT), and Trust-Region algorithm. The test functions for the experiments are Benchmark problems in Hedar & Fukushima (2004), which are evaluated with respect to efficiency and accuracy. Through the experiment, we analyse the computational complexity of the methods and finally discuss the pros and cons of them.

  • PDF

A Study on the Global Optimization Technique Based upon Molecular Dynamics (분자 동역학 방식을 사용한 전역 최적화 기법에 관한 연구)

  • Choi, Deok-Kee;Kim, Jae-Yoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.23 no.7 s.166
    • /
    • pp.1223-1230
    • /
    • 1999
  • This paper addresses a novel optimization technique based on molecular dynamics simulation which has been utilized for physical model simulation at various disciplines. In this study, objective functions are considered to be potential functions, which depict molecular interactions. Comparisons of typical optimization method such as the steepest descent and the present method for several test functions are made. The present method shows applicability and stability in finding a global optimum.

Applications of Soft Computing Techniques in Response Surface Based Approximate Optimization

  • Lee, Jongsoo;Kim, Seungjin
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.8
    • /
    • pp.1132-1142
    • /
    • 2001
  • The paper describes the construction of global function approximation models for use in design optimization via global search techniques such as genetic algorithms. Two different approximation methods referred to as evolutionary fuzzy modeling (EFM) and neuro-fuzzy modeling (NFM) are implemented in the context of global approximate optimization. EFM and NFM are based on soft computing paradigms utilizing fuzzy systems, neural networks and evolutionary computing techniques. Such approximation methods may have their promising characteristics in a case where the training data is not sufficiently provided or uncertain information may be included in design process. Fuzzy inference system is the central system for of identifying the input/output relationship in both methods. The paper introduces the general procedures including fuzzy rule generation, membership function selection and inference process for EFM and NFM, and presents their generalization capabilities in terms of a number of fuzzy rules and training data with application to a three-bar truss optimization.

  • PDF

Optimum distribution of steel frame assembly for seismic retrofit of framed structures

  • Michael Adane;Seungho Chun;Jinkoo Kim
    • Steel and Composite Structures
    • /
    • v.50 no.3
    • /
    • pp.337-345
    • /
    • 2024
  • This research proposed a particle swarm optimization (PSO) based seismic retrofit design of moment frame structures using a steel frame assembly. Two full scale specimens of the steel frame assembly with different corner details were attached to one-story RC frames for seismic retrofit, and the lateral load resisting capacities of the retrofitted frames subjected to cyclic loads were compared with those of a bare RC frame. The open source software framework Opensees was used to develop an analytical model for validating the experimental results. The developed analytical model and the optimization scheme were applied to a case study structure for economic seismic retrofit design, and its seismic performance was assessed before and after the retrofit. The results show that the developed steel frame assembly was effective in increasing seismic load resisting capability of the structure, and the PSO algorithm could be applied as convenient optimization tool for seismic retrofit design of structures.

An Enhanced Genetic Algorithm for Global and Local Optimization Search (전역 및 국소 최적화탐색을 위한 향상된 유전 알고리듬의 제안)

  • Kim, Young-Chan;Yang, Bo-Suk
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.6
    • /
    • pp.1008-1015
    • /
    • 2002
  • This paper proposes a combinatorial method to compute the global and local solutions of optimization problem. The present hybrid algorithm is the synthesis of a genetic algorithm and a local concentrate search algorithm (simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm, but also gives a more accurate solution. In addition, this algorithm can find both the global and local optimum solutions. An optimization result is presented to demonstrate that the proposed approach successfully focuses on the advantages of global and local searches. Three numerical examples are also presented in this paper to compare with conventional methods.

A Novel Hybrid Intelligence Algorithm for Solving Combinatorial Optimization Problems

  • Deng, Wu;Chen, Han;Li, He
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.4
    • /
    • pp.199-206
    • /
    • 2014
  • The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

Water Flowing and Shaking Optimization

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.2
    • /
    • pp.173-180
    • /
    • 2012
  • This paper proposes a novel optimization algorithm inspired by water flowing and shaking behaviors in a vessel. Water drops in our algorithm flow to the gradient descent direction and are sometimes shaken for getting out of local optimum areas when most water drops fall in local optimum areas. These flowing and shaking operations allow our algorithm to quickly approach to the global optimum without staying in local optimum areas. We experimented our algorithm with four function optimization problems and compared its results with those of particle swarm optimization. Experimental results showed that our algorithm is superior to the particle swarm optimization algorithm in terms of the speed and success ratio of finding the global optimum.

A Tailless UAV Multidisciplinary Design Optimization Using Global Variable Fidelity Modeling

  • Tyan, Maxim;Nguyen, Nhu Van;Lee, Jae-Woo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.18 no.4
    • /
    • pp.662-674
    • /
    • 2017
  • This paper describes the multidisciplinary design optimization (MDO) process of a tailless unmanned combat aerial vehicle (UCAV) using global variable fidelity aerodynamic analysis. The developed tailless UAV design framework combines multiple disciplines that are based on low-fidelity and empirical analysis methods. An automated high-fidelity aerodynamic analysis is efficiently integrated into the MDO framework. Global variable fidelity modeling algorithm manages the use of the high-fidelity analysis to enhance the overall accuracy of the MDO by providing the initial sampling of the design space with iterative refinement of the approximation model in the neighborhood of the optimum solution. A design formulation was established considering a specific aerodynamic, stability and control design features of a tailless aircraft configuration with a UCAV specific mission profile. Design optimization problems with low-fidelity and variable fidelity analyses were successfully solved. The objective function improvement is 14.5% and 15.9% with low and variable fidelity optimization respectively. Results also indicate that low-fidelity analysis overestimates the value of lift-to-drag ratio by 3-5%, while the variable fidelity results are equal to the high-fidelity analysis results by algorithm definition.