• Earthquakes and Structures
• /
• 제7권6호
• /
• pp.895-908
• /
• 2014

The main objective of critical excitation methods is to reveal the worst possible response of structures. This goal is accomplished by considering the uncertainties of ground motion, which is subjected to the appropriate constraints, such as earthquake power and intensity limit. The concentration of this current study is on the theoretical optimization aspect, as is the case with the majority of conventional critical excitation methods. However, these previous studies on critical excitation lead to a discontinuous power spectral density (PSD). This paper introduces some critical excitations which contain proper continuity in frequency domain. The main idea for generating such continuous excitations stems from the combination of two continuous functions. On the other hand, in order to provide a non-stationary model, this paper attempts to present an appropriate envelope function, which unlike the previous envelope functions, can properly cover the natural earthquakes' accelerograms based on multi-peak conditions. Finally, the proposed method is developed into the multiple-degree-of-freedom (M.D.O.F) structures.

• 한국시뮬레이션학회논문지
• /
• 제14권4호
• /
• pp.1-8
• /
• 2005

In a metal grating manufacturing process, the cutting operation allocates the gratings and cut them out from given panels or a plate sheets. Before the cutting operation an operator generates a cutting plan. The cutting plan should decide how pieces of metal rectangles i.e., gratings, are allocated and cut from the panel. This plan generation is a deal of weight on the production cost. the generation of cutting plan is similar to the general two-dimensional cutting problem. In this paper, we first define cutting problem and Af algorithm of Artificial Intelligence to solve the problem. Also, through a simulation, we compare the proposed cutting algorithm to an existing method in terms of material loss

• Industrial Engineering and Management Systems
• /
• 제10권3호
• /
• pp.203-208
• /
• 2011

Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

• 한국경영과학회지
• /
• 제14권2호
• /
• pp.47-47
• /
• 1989

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• 한국국방경영분석학회지
• /
• 제22권2호
• /
• pp.200-214
• /
• 1996

In this paper, the problem of determining the probability of kill(or survival) of a vulnerable target by one or more missiles is considered. The general formulas are obtained for the kill or survival probability the target is killed or survival. Several well-known concepts such as those of vulnerability, lethality, multi-component target, and a general combinatorial theorem of probability are introduced and used. For the convenience in this paper, the word missile is used in a very general sense and the target is generally taken to be a point target. And, this paper, is concentrated primarily with the probabilistic aspects of the problem, also a general numerical procedures are also described. Two examples are shown to illustrate the use of some of the formulas in this study, but also illustrate a few points which may not have been sufficiently emphasized. The extension study to complete a software package will be followed.

• 한국자동차공학회논문집
• /
• 제10권2호
• /
• pp.193-200
• /
• 2002

Simple spring-damper-mass models have been widely used to investigate whole-body vortical biodynamic response characteristics of the seated vehicle driver. Most previous models have not considered the effect of wobbling masses; i.e. heart, lungs, liver, intestine, etc. In this study, 4 -DOF seated driver model including one non-rigid mass representing wobbling visceral mass, 5-DOF model including intestine, and 10-DOF model including five lumbar vertebral masses were proposed. The model parameters were identified by a combinatorial optimization technique. simulated annealing method. The objective function was chosen as the sum of error between model response of seat-to-head transmissibility and driving point mechanical impedance and those of experimental data for subjects seated erect without backrest support. The model response showed a good agreement with the experimental response characteristics. Using a 10-DOF model, calculated resonance frequency of lumbar spine at 4Hz was matched well with experimental results of Panjabi et al.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.936-943
• /
• 2002

The Simulated Annealing (SA) algorithm has been successfully applied to various difficult combinatorial optimization problems. Since the performance of a SA algorithm, generally depends on values of the parameters, it is important to select the most appropriate parameter values. In this paper the SA algorithm is optimally designed for performance acceleration, by using the Taguchi method. Several test problems are solved via the SA algorithm optimally designed, and the solutions obtained are compared to solution results McMullen & Frazier(2000). The performance of the SA algorithm is evaluated in terms of solution quality and computation times. Computational results show that the proposed SA algorithm is effective and efficient in finding near-optimal solutions.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.245-248
• /
• 2000

This paper proposes a cooperative parallel tabu search which incorporates with the historical information exchange among processors in addition to its own searching of each processor. We investigate the influence of our proposed cooperative parallel tabu search by comparison with a serial tabu search. We also propose two extensions of the cooperative parallel tabu search which are the cooperative construction of tabu memory and the selection of cooperative partner. Through computational experiment, we observe the improvement of solutions by our proposed method.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.232-235
• /
• 2000

In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve the Traveling Salesman Problem(TSP). Because TSP is a well-known combinatorial optimization problem and belongs to a NP-complete problem, there is a huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. In addition, we have the non-schema part to be applied to inversion as well as for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

• 한국정보디스플레이학회:학술대회논문집
• /
• 한국정보디스플레이학회 2009년도 9th International Meeting on Information Display
• /
• pp.1002-1004
• /
• 2009

Solution-processed indium-gallium-zinc-oxide thin-film transistors were fabricated by sol-gel method. By a combinatorial study of InGaZnO multi-component system, optimum molar ratio of In, Ga, and Zn has been selected. By adjusting the In:Ga:Zn molar ratio, TFTs with field-effect mobility of 0.5 ~ 1.5 $cm^2$/V-s, threshold voltage of -5 ~ 5 V, and subthreshold slope of 1.5 ~ 2.5 V/decade were achieved.