• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1539-1542
• /
• 2002

In layout of LSI and PWB, block pack- ing problem is very important in order to reduce chip area. Sequence-pair is typical one of conventional pack- ing method and can search nearly-optimal solution by using Simulated Annealing(SA). SA takes huge computation time due to evaluating of various packing results. Therefore, Sequence-pair is not effective enough for fast layout evaluation including estimation of wire length and rotation of every blocks. This paper proposes an efficient block packing method to minimize wire length and chip area. Our method searches an optimal packing efficient- ly by using a cluster growth algorithm with changing the most valuable packing score on packing process.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.2
• /
• pp.359-370
• /
• 1997

We consider a facility layout problem with the objective of minimizing total transportation distance, which is the sum of rectilinear distances between facilities weighted by the frequency of trips between the facilities. It is assumed that facilities are required to have rectangular shapes and there is no empty space between the facilities in the layout. In this study, a graph theoretic heuristic is developed for the problem. In the heuristic, planar graphs are constructed to represent adjacencies between the facilities and then the graphs are converted to block layouts on a continual plane using a layout construction module. (Therefore, each graph corresponds to a layout.) An initial layout is obtained by constructing a maximal weighted planar graph and then the layout is improved by changing the planar graph. A simulated annealing algorithm is used to find a planar graph which gives the best layout. To show the performance of the proposed heuristic, computational experiments are done on randomly generated test problems and results are reported.

• Industrial Engineering and Management Systems
• /
• v.8 no.1
• /
• pp.29-36
• /
• 2009

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

• Proceedings of the KIEE Conference
• /
• 1999.07a
• /
• pp.486-488
• /
• 1999

This paper shows the form of the optimal solution and how to minimize energy of train driving control using SA(simulated annealing). In this paper, we consider the case where a train is to be driven by automatic operation mode along a non-constant gradient, curve and with speed limits. Using the combinational optimal technique, SA, we constructed optimal train driving strategy.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.9
• /
• pp.76-84
• /
• 1992

The DSP silicon compiler consists of language compiler, module generator, placement tool, router, layout generation tools, and simulator. In this paper, The language compiler, the module generator, placement tool, and simulator were developed and provided for the system designer. The language compiler translates the designer's system description language into the intermediate form file. The intermediate form file expresses the interconnections and specifications of the cells in the cell library. The simulator was developed and provided for the behavioral verification of the DSP system. For its implementation, the event-driven technique and the C$^{++}$ task library was used. The module generator was developed for the layout of the verified DSP system, and generates the functional block to be used in the DSP chip. And then the placement tool determines the appropriate positions of the cells in the DSP chip. In this paper, the placement tool was implemented by Min-Cut and Simulated Annealing algorithm. The placement process can be controlled by the several conditions input by the system designer.

• Journal of Mechanical Science and Technology
• /
• v.20 no.8
• /
• pp.1169-1182
• /
• 2006

Robust design technology has been applied to versatile engineering problems to ensure consistency in product performance. Since 1980s, the concept of robust design has been introduced to numerical optimization field, which is called the robust optimization. The robustness in the robust optimization is determined by a measure of insensitiveness with respect to the variation of a response. However, there are significant difficulties associated with the calculation of variations represented as its mean and variance. To overcome the current limitation, this research presents an implementation of the approximate statistical moment method based on kriging metamodel. Two sampling methods are simultaneously utilized to obtain the sequential surrogate model of a response. The statistics such as mean and variance are obtained based on the reliable kriging model and the second-order statistical approximation method. Then, the simulated annealing algorithm of global optimization methods is adopted to find the global robust optimum. The mathematical problem and the two-bar design problem are investigated to show the validity of the proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.585-588
• /
• 2001

현실 세계의 많은 조합 최적화 문제들은 변수들이 강하게 상호 작용함에 따라 만족해야하는 목표 함수가 매우 복잡하게 주어진다. 복잡한 목표 함수에는 많은 지역 최적해들이 존재하기 때문에 전역 최적해를 얻는 것은 엄청난 시간을 필요로 한다. 이러한 문제에 대해 해를 찾는 방법의 하나로 평균장 어닐링 알고리즘(MFA)이 있다. 본 논문에서는 기존의 이진 상태 공간에만 적용할 수 있었던 평균장 어닐링 알고리즘을 연속 상태 공간을 갖는 조합 최적화 문제에 적용할 수 있도록 알고리즘을 수정, 제안한다. 그리고 제안된 알고리즘을 제한된 연속 상태 공간을 가지는 단순 회귀 모델의 D-최적 설계에 적용하였다. 실험결과 제안된 알고리즘이 시뮬레이티드 어닐링 알고리즘(SSA)과 비교하여 비슷한 수준의 결과를 내면서도 계산 속도면에서는 수 배 정도의 빠른 좋은 결과를 얻었다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.4
• /
• pp.673-682
• /
• 2010

This paper describes and analyzes a various generation methods of the mutually orthogonal polyphase sequences with low cross-correlation peak sidelobe and low autocorrelation peak sidelobe levels. The mutual orthogonality is the key requirement of multi-static or MIMO(Multi-Input Multi-Output) radar systems which provides the good target detection and tracking performance. The polyphase sequences, which are generated by SA(Simulated Annealing) and GA(Genetic Algorithm), have been analyzed with ACF(Autocorrelation Function) PSL(Peak Sidelobe Level) and CCF(Crosscorrelation Function) level at the matched filter output. Also, the ambiguity function has been introduced and simulated for comparing Doppler properties of each sequence. We have suggested the phase selection rule for applying multi-static or MIMO systems.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.751-762
• /
• 2016

This paper presents an overview of the emerging field of quantum machine learning which promises an innovative expedited performance of current classical machine learning algorithms by applying quantum theory. The approaches and technical details of recently developed quantum machine learning algorithms that have been able to substantially accelerate existing classical machine learning algorithms are presented. In addition, the quantum annealing algorithm behind the first commercial quantum computer is also discussed.

• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.932-934
• /
• 1993

Optimum pole shape is designed to increase the levitation and propulsion force of magnetic levitation systems. Evolution Strategy is introduced as optimization method. Evolution Strategy is random based non-deterministic method, developed by combining Genetic Algorithm with Simulated Annealing. Trasnsrapid-06, which was developed in Germany, is referenced model to be analyze. Design variables are nodes which determine fields pole shape of a linear synchronous motor, and the model analyzed by F.E.M.