• Title/Summary/Keyword: Annealing Algorithm

Search Result 439, Processing Time 0.025 seconds

A Global Robust Optimization Using the Kriging Based Approximation Model (크리깅 근사모델을 이용한 전역적 강건최적설계)

  • Park Gyung-Jin;Lee Kwon-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.9 s.240
    • /
    • pp.1243-1252
    • /
    • 2005
  • A current trend of design methodologies is to make engineers objectify or automate the decision-making process. Numerical optimization is an example of such technologies. However, in numerical optimization, the uncertainties are uncontrollable to efficiently objectify or automate the process. To better manage these uncertainties, the Taguchi method, reliability-based optimization and robust optimization are being used. To obtain the target performance with the maximum robustness is the main functional requirement of a mechanical system. In this research, a design procedure for global robust optimization is developed based on the kriging and global optimization approaches. The DACE modeling, known as the one of Kriging interpolation, is introduced to obtain the surrogate approximation model of the function. Robustness is determined by the DACE model to reduce real function calculations. The simulated annealing algorithm of global optimization methods is adopted to determine the global robust design of a surrogated model. As the postprocess, the first order second-moment approximation method is applied to refine the robust optimum. The mathematical problems and the MEMS design problem are investigated to show the validity of the proposed method.

Variable Selection in PLS Regression with Penalty Function (벌점함수를 이용한 부분최소제곱 회귀모형에서의 변수선택)

  • Park, Chong-Sun;Moon, Guy-Jong
    • Communications for Statistical Applications and Methods
    • /
    • v.15 no.4
    • /
    • pp.633-642
    • /
    • 2008
  • Variable selection algorithm for partial least square regression using penalty function is proposed. We use the fact that usual partial least square regression problem can be expressed as a maximization problem with appropriate constraints and we will add penalty function to this maximization problem. Then simulated annealing algorithm can be used in searching for optimal solutions of above maximization problem with penalty functions added. The HARD penalty function would be suggested as the best in several aspects. Illustrations with real and simulated examples are provided.

Two-Dimensional Sub-diffraction-limited Imaging by an Optimized Multilayer Superlens

  • Ahmadi, Marzieh;Forooraghi, Keyvan;Faraji-Dana, Reza;Ghaffari-Miab, Mohsen
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.6
    • /
    • pp.653-662
    • /
    • 2016
  • An optimized multilayer superlens is designed, using a rigorous and efficient approach based on the method of moments (MoM) in conjunction with a simulated annealing (SA) algorithm. For the MoM solution, fast evaluation of closed-form Green's functions (GFs) in the spatial domain is performed by applying the complex-image (CI) technique, which obviates the time-consuming numerical evaluation of Sommerfeld integrals. The imaging capability of the superlens is examined with the correlation coefficient; results show that using circular polarization for the incident wave can improve this coefficient. To validate the proposed method, finite-element-based simulations are exploited, which reveal the method's accuracy and computational efficiency. Simulation results indicate that the designed structure is capable of producing two-dimensional sub-diffraction-limited images in the visible range, which may make it more versatile for practical applications. Finally, as a considerable finding, it is demonstrated for the proposed design that using circularly polarized illumination provides improved super-resolving performance, compared to linearly polarized illumination.

Improved Automatic Lipreading by Multiobjective Optimization of Hidden Markov Models (은닉 마르코프 모델의 다목적함수 최적화를 통한 자동 독순의 성능 향상)

  • Lee, Jong-Seok;Park, Cheol-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.15B no.1
    • /
    • pp.53-60
    • /
    • 2008
  • This paper proposes a new multiobjective optimization method for discriminative training of hidden Markov models (HMMs) used as the recognizer for automatic lipreading. While the conventional Baum-Welch algorithm for training HMMs aims at maximizing the probability of the data of a class from the corresponding HMM, we define a new training criterion composed of two minimization objectives and develop a global optimization method of the criterion based on simulated annealing. The result of a speaker-dependent recognition experiment shows that the proposed method improves performance by the relative error reduction rate of about 8% in comparison to the Baum-Welch algorithm.

Optimization Process of Type 4 Composite Pressure Vessels Using Genetic and Simulated Annealing Algorithm (유전 알고리즘 및 담금질 기법을 활용한 Type 4 복합재료 압력용기 최적화 프로세스)

  • SONG, GWINAM;KIM, HANSANG
    • Journal of Hydrogen and New Energy
    • /
    • v.32 no.4
    • /
    • pp.212-218
    • /
    • 2021
  • In this study, we conducted a design optimization of the Type 4 composite pressure vessels to enhance the pressure-resistant performance of the vessels while keeping the thickness of the composite layer. The design variables for the optimization were the stacking angles of the helical layers of the vessels to improve the performance. Since the carbon fibers are expensive material, it is desirable to reduce the use of the carbon fibers by applying an optimal design of the composite pressure vessel. The structural analysis and optimization process for the design of Type 4 composite pressure vessels were carried out using a commercial finite element analysis software, Abaqus and a plug-in for automated simulation, Isight, respectively. The optimization results confirmed the performance and safety of the optimized Type 4 composite pressure vessels was enhanced by 12.84% compared to the initial design.

An Algorithm for the Loading Planning of Air Express Cargoes (항공 특송화물 탑재계획을 위한 알고리즘)

  • Son, Dong-Hoon;Kim, Hwa-Joong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.3
    • /
    • pp.56-63
    • /
    • 2016
  • For air express service providers offering various express delivery services such as overnight delivery and next-business day delivery services, establishing quickly cargo loading plans is one of important issues owing to the characteristics of air express business, i.e., a short amount of time is available to complete all cargo loading operations before flight departure after receiving air express containers, pallets and bulks. On the other hand, one of major concerns in the air cargo loading planning is to make a plan that insures the stability of an aircraft to avoid take-off, flight, and landing accidents. To this end, this paper considers an air cargo loading planning problem, which is the problem of determining locations in the aircraft cargo space where air containers, pallets and bulks to be loaded while insuring the aircraft stability, motivated from DHL and Air Hong Kong. The objective of the problem is to maximize the total revenue gained from loading air express containers, pallets and bulks. To solve the problem, this paper suggests a simulated annealing algorithm to overcome impracticality of the integer programming model developed by a previous study requiring excessive computation time. The results of computational experiments show that the heuristic algorithm is a viable tool for establishing express cargo loading plans as giving robust and good solutions in a short amount of computation time. Scenario analyses are performed to investigate the effect of the current activities of air express carriers on the revenue change and to draw practical implications for air express service providers.

Tool Path Optimization for NC Turret Operation Using Simulated Annealing (풀림모사 기법을 이용한 NC 터릿 작업에서의 공구경로 최적화)

  • 조경호;이건우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.5
    • /
    • pp.1183-1192
    • /
    • 1993
  • Since the punching time is strongly related to the productivity in sheet metal stamping, there have been a lot of efforts to obtain the optimal tool path. However, most of the conventional efforts have the basic limitations to provide the global optimal solution because of the inherent difficulties of the NP hard combinatorial optimization problem. The existing methods search the optimal tool path with limiting tool changes to the minimal number, which proves not to be a global optimal solution. In this work, the turret rotation time is also considered in addition to the bed translation time of the NCT machine, and the total punching time is minimized by the simulated annealing algorithm. Some manufacturing constraints in punching sequences such as punching priority constraint and punching accuracy constraint are incorporated automatically in optimization, while several user-interactions to edit the final tool path are usually required in commercial systems.

The Optimal Design of Air Bearing Sliders of Optical Disk Drives by Using Simulated Annealing Technique (SA 기법을 이용한 광디스크 드라이브 공기베어링 슬라이더의 최적설계)

  • Chang, Hyuk;Kim, Hyun-Ki;Kim, Kwang-Sun;Rim, Kyung-Hwa
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.8
    • /
    • pp.1545-1551
    • /
    • 2002
  • The optical storage device has recently experienced significant improvement, especially for the aspects of high capacity and fast transfer rate. However, it is necessary to study a new shape of air bearing surface for the rotary type actuator because the optical storage device has the lower access time than that of HDD (Hard Disk Drives). In this study, we proposed the air bearing shape by using SA (Simulated Annealing) algorithm which is very effective to achieve the global optimum instead of many local optimums. The objective of optimization is to minimize the deviation in flying height from a target value 100nm. In addition, the pitch and roll angle should be maintained within the operation limits.

Efficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs

  • Hirakawa, Yasuhiro;Ishigaki, Aya
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.2
    • /
    • pp.134-139
    • /
    • 2011
  • The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

Optimum Design of Sandwich Panel Using Hybrid Metaheuristics Approach

  • Kim, Yun-Young;Cho, Min-Cheol;Park, Je-Woong;Gotoh, Koji;Toyosada, Masahiro
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.6
    • /
    • pp.38-46
    • /
    • 2003
  • Aim of this article is to propose Micro-Genetic Simulated Annealing (${\mu}GSA$) as a hybrid metaheuristics approach to find the global optimum of nonlinear optimisation problems. This approach combines the features of modern metaheuristics such as micro-genetic algorithm (${\mu}GAs$) and simulated annealing (SA) with the general robustness of parallel exploration and asymptotic convergence, respectively. Therefore, ${\mu}GSA$ approach can help in avoiding the premature convergence and can search for better global solution, because of its wide spread applicability, global perspective and inherent parallelism. For the superior performance of the ${\mu}GSA$, the five well-know benchmark test functions that were tested and compared with the two global optimisation approaches: scatter search (SS) and hybrid scatter genetic tabu (HSGT) approach. A practical application to structural sandwich panel is also examined by optimism the weight function. From the simulation results, it has been concluded that the proposed ${\mu}GSA$ approach is an effective optimisation tool for soloing continuous nonlinear global optimisation problems in suitable computational time frame.