• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1994년도 하계학술대회 논문집 A
• /
• pp.162-164
• /
• 1994

This paper presents the optimal design method of an induction motor for electric vehicle which minimizes the weight of motor and satisfies maximum power rating at the same time. Effects of motor parameters on the dimensions and weight of motor is investigated. Optimal routine which is used in this paper is simulated annealing technique.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 추계학술대회 논문집
• /
• pp.894-897
• /
• 1995

This paper focuses on self-organization of fuzzy rules for performance management of computer communication networks serving manufacturing systems. The performance management aims to improve the network performance in handling various types of messages by on-line adjustment of protocol parameters. The principle of fuzzy logic has been used in representing the knowledge of human expert on the performance management and in deriving management decisions. In this paper, we present applications of genetic algorithm, simulated annealing, and evolution strategies to find a better set of rules for various network conditions. The efficacy of this self-organization is demonstrated by discrete simulation of an IEEE 802.4 network.

• 한국군사과학기술학회지
• /
• 제20권3호
• /
• pp.441-453
• /
• 2017

In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

• 융합신호처리학회논문지
• /
• 제3권2호
• /
• pp.89-95
• /
• 2002

글로벌 라우팅(global routing)은 VLSI 설계 과정중의 하나로, 네트리스트의 모든 네트들을 연결하기 위하여 각 네트들을 라우팅 영역(routing area)에 할당시키는 문제이며, 글로벌 라우팅에서 최적의 해를 얻기 위해 maze routing 알고리즘, line-probe 알고리즘, shortest path 기반 알고리즘, Steiner tree 기반 알고리즘등이 이용된다. 본 논문에서는 라우팅 그래프에서 최단 경로 Steiner tree 탐색방법인 weighted network heuristic(WNH)과 이를 기반으로 하는 글로벌 라우팅 유전자 알고리즘(genetic algorithm; GA)을 제안하였으며, 제안한 방식을 시뮬레이티드 어닐링(SA) 방식과 비교, 분석하였다.

• BMB Reports
• /
• 제37권5호
• /
• pp.565-573
• /
• 2004

Orexin-A and orexin-B (hypocretin-1 and hypocretin-2, respectively) are important hypothalamic neuro-peptides, which are encoded by a single mRNA transcript and stimulate food intake as well as regulate wakefulness. Here we determined the solution structure of orexin-A by NMR spectroscopy and by simulated-annealing calculation. The structural features of orexin-A involve two $\alpha$-helices, with the hydrophobic residues disposed to on one side of helix, and hydrophilic residues to the other. A hydrophilic turn induced by two disulfide bonds provides the key difference between orexin-A and -B. With previous mutagenic studies, the derived structure of orexin-A provides us with a structure-functional view for novel drug design.

• 한국국방경영분석학회지
• /
• 제35권3호
• /
• pp.47-59
• /
• 2009

A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.

• 전자공학회논문지A
• /
• 제33A권3호
• /
• pp.152-162
• /
• 1996

Diffraction gratings were designed to generate multiple beams for the real-time optical interconnection in free-space using a liquid crsytal television. Multi-level phase gratings consisted of stepped phase value, 0 to 2$\pi$, and generate a 5$\times$5 spot array, and V-shaped spot patterns which have a maximum diffraction efficiency of 78.84%. Simulated annealing technique was used to determine phase states of each pixel having uniform intensity and high diffraction efficiency. Through the optical interconnection experiments, we compared the diffraction characteristics of beam paterns obtained by binary-level, four-level, and eight-level phase gratings.

• 사상체질의학회지
• /
• 제13권1호
• /
• pp.17-23
• /
• 2001

Purpose This study was carried out ro apply the knowledge of bioinformatics to the quantification of constitutional information. Methods To objectify consitirutional knowledge, several uselful methods including Bayesian estimate, position specific score matrix, entropy, phylogenetic tree, simulated annealing were discussed. Results and Conclusion It is obvious that bioinformatic methods can be the most important tool for the objectification of constitutional medicine.

• 한국생물물리학회:학술대회논문집
• /
• 한국생물물리학회 1999년도 학술발표회 진행표 및 논문초록
• /
• pp.18-18
• /
• 1999

A sweet protein monellin was originally isolated from the berries of the West African plant Dioscoreophyllum cumminsii. The studies for molecular interaction of different sweeteners with receptor as well as receptor binding model have been proposed previously. The high-resolution solution structure of single-chain monellin (SCM) has been determined to investigate structural origin of sweet taste by NMR spectroscopy and simulated annealing calculations.(omitted)

• 대한산업공학회지
• /
• 제33권1호
• /
• pp.86-98
• /
• 2007

This paper presents a heuristic algorithm for the traveling salesman problem with time windows (TSPTW). Aniterative insertion algorithm as a constructive search heuristic and a hybrid meta heuristic combining simulatedannealing and tabu search with the randomized selection of 2-interchange and a simple move operator as animproving search heuristic are proposed, Computational tests performed on 400 benchmark problem instancesshow that the proposed algorithm generates optimal or near-optimal solutions in most cases. New best knownheuristic values for many benchmark problem sets were obtained using the proposed approach.