• Smart Structures and Systems
• /
• 제2권1호
• /
• pp.1-24
• /
• 2006

The optimal design of multiple tuned mass dampers (multiple TMD's) to suppress multi-mode structural response of beams and floor structures was investigated. A new method using a numerical optimizer, which can effectively handle a large number of design variables, was employed to search for both optimal placement and tuning of TMD's for these structures under wide-band loading. The first design problem considered was vibration control of a simple beam using 10 TMD's. The results confirmed that for structures with widelyspaced natural frequencies, multiple TMD's can be adequately designed by treating each structural vibration mode as an equivalent SDOF system. Next, the control of a beam structure with two closely-spaced natural frequencies was investigated. The results showed that the most effective multiple TMD's have their natural frequencies distributed over a range covering the two controlled structural frequencies and have low damping ratios. Moreover, a single TMD can also be made effective in controlling two modes with closely spaced frequencies by a newly identified control mechanism, but the effectiveness can be greatly impaired when the loading position changes. Finally, a realistic problem of a large floor structure with 5 closely spaced frequencies was presented. The acceleration responses at 5 positions on the floor excited by 3 wide-band forces were simultaneously suppressed using 10 TMD's. The obtained multiple TMD's were shown to be very effective and robust.

• Journal of the Korean Institute of Telematics and Electronics
• /
• 제26권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.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1989년도 추계학술대회 논문집 학회본부
• /
• pp.355-359
• /
• 1989

An inverted pendulum is made practically and controlled by optimal controller and pole placement controller. An IBM PC/XT plays a part of the controller. The control algorithm is implemented with C language. An integrator is added to the controller to solve the high frequency problem. Experiment is performed according to the results of simulation.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 한국통신학회 1983년도 추계학술발표회논문집
• /
• pp.27-31
• /
• 1983

It is the aim of the placement studies of telephone exchanges to provide facility plans which give the most economic investiment time and size to satisfy the future telephone demand of the area. Main subjects of the stuies are usually the optimal number, locations, service areas, final capacity of the telephone exchanges. This paper explains about the basic methodologies and algorithms expressed in PLAX, a software developed by KETRI to tackle the placement problem in urban areas.

• Journal of KIISE:Computer Systems and Theory
• /
• 제30권10호
• /
• pp.595-602
• /
• 2003

This Paper presents an efficient hybrid techniques for a standard cell placement. The prototype tool adopts a middle-down methodology in which an n${\times}$m grid is imposed over the layout area and cells are assigned to bins forming a global placement. The optimization technique applied in this phase is based on the Relaxation-Based Local Search (RBLS) framework [12］in which a combinatorial search mechanism is driven by an analytical engine. This enables a more global view of the problem and results in complex modifications of the placement in a single search“move.”Details of this approach including a novel placement legalization procedure are presented. When a global placement converges, a detailed placement is formed and further optimized by the optimal interleaving technique[13］. Experimental results on MCNC benchmarking circuits are presented and compared with the Feng Shui's results in［14］. Solution Qualifies are almost the same as the Feng Shui's results.

• Journal of Korean Institute of Industrial Engineers
• /
• 제20권4호
• /
• pp.23-35
• /
• 1994

Efficient operation of a component placement machine with a multi-head in a PCB assembly process is considered. The problem consists of two subproblems, which are the optimal allocation of the component tape reels in the rack and the optimal mounting sequence of the components on a printed circuit board. We analyze the problem and propose a heuristic algorithm to solve it. The heuristic can be used for the one head case too. Computational experiences on some real world problems show the effectiveness of the heuristic in terms of speed and solution quality.

• Journal of Electrical Engineering and Technology
• /
• 제4권4호
• /
• pp.492-498
• /
• 2009

The placement of the UPFC is the major concern to ensure the full potential of utilization in the transmission network. Voltage stability enhancement with the optimal placement of UPFC using stability index such as modal analysis, Voltage Phasor method is made and the loss minimization including UPFC is formulated as an optimization problem. This paper proposes particle swarm optimization for the exact real power loss minimization including UPFC. The implementation of loss minimization for the optimal location of UPFC was tested with IEEE-14 and IEEE-57 bus system.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.510-512
• /
• 1999

In this paper, we present a method for the analysis and design of fuzzy controller for nonlinear systems. In the design procedure, we represent the dynamics of nonlinear systems using a Takagi-Sugeno fuzzy model and formulate the controller rules, which shares the same fuzzy sets with the fuzzy system, using parallel distributed compensation method. Then, after the feedback gain of each local state feedback controller is obtained using the existing optimal pole-placement scheme, we construct an overall fuzzy logic controller by blending all local state feedback controller. Finally, the effectiveness and feasibility of the proposed fuzzy-model-based controller design method has been evaluated through an inverted pendulum system.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1176-1179
• /
• 2002

This paper presents the use of a Genetic Algorithm to find the optimal layout for the placement of garment patterns on a fabric of fixed width to minimize fabric waste. We developed a program to simulate garment pieces and their layout on a fixed-width fabric. Each piece in the order book is placed with 2 possible orientations: 0 degrees and 180 degrees. The efficiency is measured by the length of fabric used after all the patterns in the order book have been laid out. A comparison is made between the placement using our proposed genetic algorithm to that made by an expert human using our simulation program. The results from our experiments on various pattern designs indicate that our genetic algorithm can effectively be used to obtain highly efficient solutions, comparable to that done by an expert while using a reasonable amount of time. The algorithm can also be adapted for use in other areas related to optimal consumption of sheet material such as metal, paper, and leather.

• Journal of the Korea Society of Computer and Information
• /
• 제21권2호
• /
• pp.97-103
• /
• 2016

This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.