• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.46-58
• /
• 1998

In this paper, we propose a synthesis algorithm for the design of low powe rcombinational circuits under area constraints. The proposed algorithm partitions a given circuit into several subcircuits such that only a selected subcircuit is activated at a time, hence reduce unnecessary signal transitions. Partitioning of a given circuit is performed through adaptive simulated annealing algorithm employing the cost function reflecting poer consumption under area constraints. Experimental reuslts for the MCNC benchmark circuits show that the proposed algorithm generates the circuits which consume less power by 61.1% and 51.1%, when compared to those generated by the sis 1.2 and the precomputation algorithm, respectively.

• Proceeding of KASS Symposium
• /
• 2005.05a
• /
• pp.246-253
• /
• 2005

The design of structural engineering optimization is to minimize the cost. This problem has many objective functions formulating section and shape as a function of the included discrete variables. simulated annealing, genetic algerian and TABU algorithm are searching methods for optimum values. The object of this reserch is comparing the result of TABU algorithm, and verifying the efficiency of TABU algorithm in structural optimization design field. For the purpose, this study used a solid truss of 25 elements having 10 nodes, and size optimization for each constraint and load condition of Geodesic one, and shape optimization of Cable Dome for verifying spatial structures by the application of TABU algorithm

• Advances in aircraft and spacecraft science
• /
• v.10 no.5
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• Industrial Engineering and Management Systems
• /
• v.4 no.2
• /
• pp.184-191
• /
• 2005

In this article we study the feasibility of the Ant Colony Optimisation (ACO) algorithm for finding optimal Kanban allocations in Kanban systems represented by Stochastic Petri Net (SPN) models. Like other optimisation algorithms inspired by nature, such as Simulated Annealing/Genetic Algorithms, the ACO algorithm contains a large number of adjustable parameters. Thus we study the influence of the parameters on performance of ACO on the Kanban allocation problem, and identify the most important parameters.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.02a
• /
• pp.242-243
• /
• 2003

A CGH is a hologram generated by computer. It is widely applied to wavefront manipulation, synthesis, optical information processing and interferometer. Some methods have been used to determine the optimum phase pattern to achieve high diffraction efficiency and uniform intensity such as DBS (Direct Binary Search), SA (Simulated Annealing), GA(Genetic Algorithm). These methods require long computation time to generate a hologram. (omitted)

• Nuclear Engineering and Technology
• /
• v.30 no.4
• /
• pp.353-363
• /
• 1998

The H$_{\infty}$ algorithms of the mixed weight sensitivity is used for the robust design of the reactor power control system. The mixed weight sensitivity method requires the selection of the proper weighting functions for the loop shaping in frequency domain. The complexity of the system equation and the non-convexity of the problem make it very difficult to determine the weighting functions. The genetic algorithm which is improved and hybridized with the simulated annealing is applied to determine the weighting functions. This approach permits an automatic calculation and the resultant system shows good robustness and performance.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.591-593
• /
• 1998

As evolution of the process technology, we proposed the Over-The-Cell channel routing algorithm for the advanced three-layer process. The proposed algorithm simplifies the channel routing problem, and then makes use of Simulated Annealing Technique to converge at global optimal solution. Also, we proposed a new method to remove the cyclic vertical constraints which are known to be the hardest element in the channel routing problem and a way to detect the local minimal solution and escape from it successfully.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.317-320
• /
• 2003

본 논문에서는 각 도시마다 가중치가 있는 City domain을 tour하기 위한 문제를 해결하기 위해 Simulated Annealing Algorithm을 확장한 알고리즘을 제시하였고 Capacitated vehicle routing problem을 변형한 Augmented multiple salesman traveling problem을 정의하고 이를 해결하기 위한 에너지 함수와 알고리즘을 제시하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.267-267
• /
• 1998

• Communications for Statistical Applications and Methods
• /
• v.3 no.2
• /
• pp.1-11
• /
• 1996

The detection of multiple outliers in nonlinear regression models can be computationally not feasible. As a compromise approach, we consider the use of simulated annealing algorithm, an approximate approach to combinatorial optimization. We show that this method ensures convergence and works well in locating multiple outliers while reducing computational time.