• Title/Summary/Keyword: 시뮬레이티드어닐링 알고리듬

Search Result 13, Processing Time 0.023 seconds

A Proposal of Combined Iterative Algorithm for Optimal Design of Binary Phase Computer Generated Hologram (최적의 BPCGH 설계를 위한 합성 반복 알고리듬 제안)

  • Kim Cheol-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.10 no.4
    • /
    • pp.16-25
    • /
    • 2005
  • In this paper, we proposed a novel algorithm combined simulated annealing and genetic algorithms for designing optimal binary phase computer generated hologram. In the process of genetic algorithm searching by block units, after the crossover and mutation operations, simulated annealing algorithm searching by pixel units is inserted. So, the performance of BPCGH was improved. Computer simulations show that the proposed combined iterative algorithm has better performance than the simulated annealing algorithm in terms of diffraction efficiency

  • PDF

Macro Block Placement Using Simulated Annealing (시뮬레이티드 어닐링을 이용한 마크로 블럭의 배치)

  • Park, In-Cheol;Kyung, Chong-Min
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.2
    • /
    • pp.147-154
    • /
    • 1989
  • An effective placement of macro blocks having arbitrary width and height is very important in reducing the chip area and the signal delay. In this paper, we proposed a method of macro block placement to obtain the globally optimal placement using simulated annealing, and an efficient algorithm for eliminating the overlaps between the rectangular macro blocks which may remain even after the simulated annealing process is terminated. Each macro block was enlarged to take into account minimal routing area, and these macro blocks were compacted as much as possible during the placement. This procedure was implemented in C language running on MV10000/UNIX computer system, and good placements were obtained by applying this procedure to two circuits which were consisted of 50 and 160 macro blocks respectively. Several parameters giving great effects to final placements were investigated.

  • PDF

Scheduling of a Flow Shop with Setup Time (Setup 시간을 고려한 Flow Shop Scheduling)

  • Kang, Mu-Jin;Kim, Byung-Ki
    • Proceedings of the KSME Conference
    • /
    • 2000.04a
    • /
    • pp.797-802
    • /
    • 2000
  • Flow shop scheduling problem involves processing several jobs on common facilities where a setup time Is incurred whenever there is a switch of jobs. Practical aspect of scheduling focuses on finding a near-optimum solution within a feasible time rather than striving for a global optimum. In this paper, a hybrid meta-heuristic method called tabu-genetic algorithm(TGA) is suggested, which combines the genetic algorithm(GA) with tabu list. The experiment shows that the proposed TGA can reach the optimum solution with higher probability than GA or SA(Simulated Annealing) in less time than TS(Tabu Search). It also shows that consideration of setup time becomes more important as the ratio of setup time to processing time increases.

  • PDF

Identification of Bearing Dynamic Coefficients Using Optimization Techniques (최적화기법에 의한 베어링 동특성 계수의 규명)

  • 김용한;양보석;안영공;김영찬
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.05a
    • /
    • pp.520-525
    • /
    • 2003
  • The determination of unknown parameters in rotating machinery is a difficult task and optimization techniques represent an alternative technique for parameter identification. The Simulated Annealing(SA) and Genetic Algorithm(GA) are powerful global optimization algorithm. This paper proposes new hybrid algorithm which combined GA with SA and local search algorithm for the purpose of parameter identification. Numerical examples are also presented to verify the efficiency of proposed algorithm. And, this paper presents the general methodology based on hybrid algorithm to identify unknown bearing parameters of flexible rotors using measured unbalance responses. Numerical examples are used to ilustrate the methodology used, which is then validated experimentally.

  • PDF

Image Encryption and Decryption Using SA Algorithm and Optical Correlator System (SA 알고리듬과 광 상관 시스템을 이용한 영상 암호화 및 복호화)

  • 김철수;조창섭
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.3
    • /
    • pp.349-356
    • /
    • 2004
  • In this paper, a practical image security system using SA algorithm and 4-f optical correlator system is proposed. The encrypted image and key image with binary phase components are generated using an iterative SA algorithm. a decrypted image is found through the correlation of the encrypted and key images using 4-f optical correlator system. The encrypted and key images are consisted of binary phase components. So, it is easy to implement the optical security system using the proposed technique. And if we fix the encrypted image in the optical security system and change the key images, we get different images, so it is possible to apply to the distinguished authorization system using different key images. Computer simulations show that despite the binary phase components of the two images(encrypted and key image), decrypted images are generated.

  • PDF

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.

A Robust Design of Simulated Annealing Approach : Mixed-Model Sequencing Problem (시뮬레이티드 어닐링 알고리듬의 강건설계 : 혼합모델 투입순서 결정문제에 대한 적용)

  • Kim, Ho-Gyun;Paik, Chun-Hyun;Cho, Hyung-Soo
    • IE interfaces
    • /
    • v.15 no.2
    • /
    • pp.189-198
    • /
    • 2002
  • Simulated Annealing(SA) approach has been successfully applied to the combinatorial optimization problems with NP-hard complexity. To apply an SA algorithm to specific problems, generic parameters as well as problem-specific parameters must be determined. To overcome the embedded nature of SA, long computational time, some studies suggested the parameter design methods of determining SA related parameters. In this study, we propose a new parameter design approach based on robust design method. To show the effectiveness of the proposed method, the extensive computation experiments are conducted on the mixed-model sequencing problems.

Computational Methods for Optimal Designs In Nonlinear Models using the Simulated Annealing Algorithm (비선형모형에서 최적실험계획법의 계산에 관한 연구 - 시뮬레이티드 어닐링 알고리듬의 응용 -)

  • Kahng, Myung-Wook
    • Journal of Korean Society for Quality Management
    • /
    • v.24 no.4
    • /
    • pp.59-69
    • /
    • 1996
  • The criteria for construction of D-optimal design in nonlinear models are derived. The procedures for finding these optimal designs using the simulated annealing algorithm are presented. It is claimed that the advantages of this method are its ability to make the given data useful by adding new observations as well as to obtain a new set of appropriate data when the model and parameters are known. Research so far indicates that there has never been a case in which there is more than one independent variable but this method can be used for such cases. The result indicates the effectiveness of the method using simulated annealing algorithm for situations in which there are many independent variables and the ranges of design spaces are wide.

  • PDF

A Simulated Annealing Algorithm for the Optimal Reliability Design Problem of a Series System with Multiple Component Choices (다중 부품선택이 존재하는 직렬구조 시스템의 최적 신뢰성설계를 위한 시뮬레이티드 어닐링 알고리듬)

  • Kim, Ho-Gyun;Bae, Chang-Ok;Paik, Chun-Hyun
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.69-78
    • /
    • 2004
  • This paper presents a simulated algorithm(SA) for the optimal reliability design problem of a series system with multiple component choices incorporated at each subsystem. The objective of the problem is to maximize the system reliability while satisfying some constraint on system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. The SA algorithm is developed by introducing some solution-improvements methods. Numerical examples are tested and the results are compared. The results have demonstrated the efficiency and the effectiveness of the proposed SA algorithm.

Optimizing Simulated Annealing Algorithms Using Taguchi Method (다구치 기법을 이용한 시뮬레이티드 어닐링 알고리듬의 최적화)

  • Kim Ho Gyun;Jo Hyeong Su;Bae Chang Ok
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.1077-1084
    • /
    • 2003
  • The performance of simulated annealing (SA) algorithm such as solution optimality and computation time mainly depends on how to determine the SA-related parameters Several schemes have been suggested to improve the performance of SA and several parameter design methods have been utilized to select parameter values of each scheme. In this paper, we propose a new SA algorithm design method that can determine schemes as well as parameter values simultaneously The new SA algorithm design method is based on the Taguchl method which primarily selects the design parameters for a product or process to minimize the effect of noise parameters. so that the response is close to the desired target with minimum variation. To show the effectiveness of the proposed method, extensive computation experiments are conducted.

  • PDF