• Advances in aircraft and spacecraft science
• /
• v.4 no.3
• /
• pp.297-316
• /
• 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.

• 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.

• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.20-24
• /
• 2003

The analysis of DNA microarry data is one of the most important things for functional genomics research. The matrix representation of microarray data and its successive 'optimal' incisional hyperplanes is a useful platform for developing optimization algorithms to determine the optimal partitioning of pairwise proximity matrix representing completely connected and weighted graph. We developed Deterministic Annealing (DA) approach to determine the successive optimal binary partitioning. DA algorithm demonstrated good performance with the ability to find the 'globally optimal' binary partitions. In addition, the objects that have not been clustered at small non­zero temperature, are considered to be very sensitive to even small randomness, and can be used to estimate the reliability of the clustering.

• Investigative Magnetic Resonance Imaging
• /
• v.6 no.2
• /
• pp.137-146
• /
• 2002

Purpose : This paper introduces an improved classification approach which adopts a deterministic relaxation method and an agglomerative clustering technique for the classification of MRI using neural network. The proposed approach can solve the problems of convergency to local optima and computational burden caused by a large number of input patterns when a neural network is used for image classification. Materials and methods : Application of Hopfield neural network has been solving various optimization problems. However, major problem of mapping an image classification problem into a neural network is that network is opt to converge to local optima and its convergency toward the global solution with a standard stochastic relaxation spends much time. Therefore, to avoid local solutions and to achieve fast convergency toward a global optimization, we adopt MFA to a Hopfield network during the classification. MFA replaces the stochastic nature of simulated annealing method with a set of deterministic update rules that act on the average value of the variable. By minimizing averages, it is possible to converge to an equilibrium state considerably faster than standard simulated annealing method. Moreover, the proposed agglomerative clustering algorithm which determines the underlying clusters of the image provides initial input values of Hopfield neural network. Results : The proposed approach which uses agglomerative clustering and deterministic relaxation approach resolves the problem of local optimization and achieves fast convergency toward a global optimization when a neural network is used for MRI classification. Conclusion : In this paper, we introduce a new paradigm to classify MRI using clustering analysis and deterministic relaxation for neural network to improve the classification results.

• 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.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.2
• /
• pp.268-283
• /
• 2016

Aircraft manufacturing companies have to consider multiple derivatives to satisfy various market requirements. They modify or extend an existing aircraft to meet new market demands while keeping the development time and cost to a minimum. Many researchers have studied the derivative design process, but these research efforts consider baseline and derivative designs together, while using the whole set of design variables. Therefore, an efficient process that can reduce cost and time for aircraft derivative design is needed. In this research, a more efficient design process is proposed which obtains global changes from local changes in aircraft design in order to develop aircraft derivatives efficiently. Sensitivity analysis was introduced to remove unnecessary design variables that have a low impact on the objective function. This prevented wasting computational effort and time on low priority variables for design requirements and objectives. Additionally, uncertainty from the fidelity of analysis tools was considered in design optimization to increase the probability of optimization results. The Reliability Based Design Optimization (RBDO) and Possibility Based Design Optimization (PBDO) methods were proposed to handle the uncertainty in aircraft conceptual design optimization. In this paper, Collaborative Optimization (CO) based framework with RBDO and PBDO was implemented to consider uncertainty. The proposed method was applied for civil jet aircraft derivative design that increases cruise range and the number of passengers. The proposed process provided deterministic design optimization, RBDO, and PBDO results for given requirements.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.780-787
• /
• 2017

The propellant grain configuration is a design variable that determines the shape and performance of a solid rocket motor. Grain configuration variables have complicated effects on the motor performance; so the global optimization problem has to be solved in order to design the configuration variables. The grain performance has been analyzed by means of the grain burn-back and internal ballistic analysis, and the optimization technique searches for the configuration variables that satisfy the requirements. The deterministic and stochastic optimization techniques have been applied for the grain optimization, but the results are imperfect. In this study, the optimization design of the configuration variables has been performed using the hybrid optimization technique, which combines those two techniques. As a result, the hybrid optimization technique has proved to be efficient for the grain optimization design.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.54-63
• /
• 1993

This paper proposes a method for improving the performances of the neural network for optimization by an optimal estimation of initial states. The optimal initial state that leads to the global minimum is estimated by using the stochastic approximation. And then the update rule of Hopfield model, which is the high speed deterministic algorithm using the steepest descent rule, is applied to speed up the optimization. The proposed method has been applied to the tavelling salesman problems and an optimal task partition problems to evaluate the performances. The simulation results show that the convergence speed of the proposed method is higher than conventinal Hopfield model. Abe's method and Boltzmann machine with random initial neuron output setting, and the convergence rate to the global minimum is guaranteed with probability of 1. The proposed method gives better result as the problem size increases where it is more difficult for the randomized initial setting to give a good convergence.

• Computational Structural Engineering
• /
• v.5 no.2
• /
• pp.93-104
• /
• 1992

The final objective of optimization methods is to find global optimum accurately and efficiently. The optmization processes by simulated annealing and genetic algorithm which have stochastic search process are examined and are applied to several mathematical models and truss, beam structures. Then the robustnesses of these two methods are studied and compared with the results of deterministic optimization methods from the viewpoints of reliability and running time in obtaining the global optimum.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.26 no.2
• /
• pp.54-60
• /
• 2018

This paper contains the multi-mission scheduling optimization of UAV within a given operating time. Mission scheduling optimization problem is one of combinatorial optimization, and it has been shown to be NP-hard(non-deterministic polynomial-time hardness). In this problem, as the size of the problem increases, the computation time increases dramatically. So, we applied the genetic algorithm to this problem. For the application, we set the mission scenario, objective function, and constraints, and then, performed simulation with MATLAB. After 1000 case simulation, we evaluate the optimality and computing time in comparison with global optimum from MILP(Mixed Integer Linear Programming).