• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 A
• /
• pp.70-72
• /
• 1998

This paper discusses the development of a new optimization algorithm for DC motor design. In principle, the new algorithm utilizes a mixed method that consists of genetic algorithms in conjunction with direct search method. The genetic algorithms are used for locating the global optimum region while the direct search method is used to achieve objective function convergence. In order to validate the effectiveness, the new algorithm has been applied to an actual DC motor. Field and torque characteristics of the DC motor are computed using finite element method and the principle of virtual work, respectively.

• Industrial Engineering and Management Systems
• /
• 제15권1호
• /
• pp.1-10
• /
• 2016

This paper presents a fast sequencing algorithm for a mixed model assembly line with multiple workstations which minimize the total utility work and idle time. We compare the proposed algorithms with another heuristic, the Tsai-based heuristic, for a sequencing problem that minimizes the total utility works. Numerical experiments are used to evaluate the performance and effectiveness of the proposed algorithm. The Tsai-based heuristic performs best in terms of utility work, but the fast sequencing algorithm performs well for both utility work and idle time. However, the computational complexity of the fast sequencing algorithm is O (KN) while the Tsai-based algorithm is O (KNlogN). Actual computational time of the fast sequencing heuristic is 2-6 times faster than that of the Tsai-based heuristic.

• 국제초고층학회논문집
• /
• 제1권4호
• /
• pp.247-254
• /
• 2012

In order to improve the seismic behaviors of traditional steel-concrete mixed structure, a novel steel concrete mixed structure consisting of steel frames braced with buckling restrained braces (BRBs) and a concrete tube is proposed. Based on several assumptions, the simplified mechanical model of the novel mixed structure is established, and the shear and bending stiffness formulas of the steel frames, BRBs and concrete tube are respectively introduced. The equilibrium differential equation of the novel mixed structure under horizontal load is developed based on the structural elastic theory. The simplified algorithms to determine the lateral displacement and internal forces of the novel mixed structure under the inverted-triangle distributed load, uniformly load and top-concentrated load are then obtained considering several boundary conditions and compatible deformation conditions. The effectiveness of the simplified algorithms is verified by FEM comparison.

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

A Branch-and-Cut algorithm is a branch-and-bound algorithm in which rutting planes are generated throughout the branch-and-bound tree. It is now one of the most widespread and successful methods for solving mixed integer programming problems. In this paper we presents efficient implementation techniques of branch-and-cut algorithm for miked integer programming problems.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권1호
• /
• pp.62-67
• /
• 2003

An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models of imperfect competition of a deregulated electricity system, the key task is to find the Nash equilibrium. In this paper, the bimatrix approach for finding Nash equilibria in electricity markets is investigated. This approach determines pure and mixed equilibria using the complementarity pivot algorithim. The mixed equilibrium in the matrix approach has the equal number of non-zero property. This property makes it difficult to reproduce a smooth continuous distribution for the mixed equilibrium. This paper proposes an algorithm for adjusting the quantization value of discretization to reconstruct a continuous distribution from a discrete one.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2019년도 제60차 하계학술대회논문집 27권2호
• /
• pp.7-8
• /
• 2019

In this paper, we applied the migration technique to real-time tasks that have relatively low criticality but still important to be dropped by the mixed-criticality scheduling algorithms. The proposed drop and migrate algorithm analyzes the schedulability by calculating CPU utilization and response time of using task migration. We provide analysis to guarantee the deadline of LO-tasks, by transforming the response time equation specified with migration time. The transformed response time equation was able to analyze the migration schedulability. This algorithm can be used with various mixed-criticality schedulers as a supplementary method. We expect this algorithm will be used for scheduling LO-tasks such as communication task that requires safety guarantee especially in platooning and autonomous driving by utilizing the advantages of multiple node connectivities.

• 한국경영과학회지
• /
• 제35권3호
• /
• pp.25-43
• /
• 2010

We consider a multi-objective balancing and sequencing problem in mixed model assembly lines, which is important for an efficient use of the assembly lines. In this paper, we present a neighborhood symbiotic evolutionary algorithm to simultaneously solve the two problems of balancing and model sequencing under multiple objectives. We aim to find a set of well-distributed solutions close to the true Pareto optimal solutions for decision makers. The proposed algorithm has a two-leveled structure. At Level 1, two populations are operated : One consists of individuals each of which represents a partial solution to the balancing problem and the other consists of individuals for the sequencing problem. Level 2, which is an upper level, works one population whose individuals represent the combined entire solutions to the two problems. The process of Level 1 imitates a neighborhood symbiotic evolution and that of Level 2 simulates an endosymbiotic evolution together with an elitist strategy to promote the capability of solution search. The performance of the proposed algorithm is compared with those of the existing algorithms in convergence, diversity and computation time of nondominated solutions. The experimental results show that the proposed algorithm is superior to the compared algorithms in all the three performance measures.

• 전자공학회논문지CI
• /
• 제41권5호
• /
• pp.17-23
• /
• 2004

본 논문은 십진 나눗셈에서 연산 속도를 향상시키기 위해 혼합 나눗셈 알고리즘을 제안한다. 이진수 체계에서는 비복원 알고리즘이 복원 알고리즘에 비해 항상 작은 횟수를 갖지만 십진 연산에서는 몫의 값에 따라 연산 횟수가 달라진다. 십진수는 한 자리로 나타낼 수 있는 수의 범위가 0～9 이므로 현재 부분 나머지의 절대 값과 이전 부분 나머지의 절대 값을 비교하여 이전 부분 나머지의 절대 값이 현재 부분 나머지의 절대 값 보다 크면 비복원 알고리즘을 선택하고 작으면 복원 알고리즘을 선택함으로써 연산 횟수를 줄일 수 있다. 몫이 64 자리일 경우 제안한 흔합 알고리즘은 복원 알고리즘에 비해 80.9%의 연산 횟수를 줄였고 비복원 알고리즘에 비해 64.5%의 연산 횟수를 줄였다.

• 대한산업공학회지
• /
• 제17권1호
• /
• pp.83-94
• /
• 1991

This study is concerned with the scheduling problem for mixed-model assembly lines in Just-In-Time(JIT) production systems. The most important goal of the scheduling for the mixed-model assembly line in JIT production systems is to keep a constant rate of usage for every part used by the systems. In this study, we develop two heuristic algorithms able to keep a constant rate of usage for every part used by the systems in the single-level and the multi-level. In the single-level, the new algorithm generates sequence schedule by backward tracking and prevents the destruction of sequence schedule which is the weakest point of Miltenburg's algorithms. The new algorithm gives better results in total variations than the Miltenburg's algorithms. In the multi-level, the new algorithm extends the concept of the single-level algorithm and shows more efficient results in total variations than Miltenburg and Sinnamon's algorithms.

• 한국경영과학회지
• /
• 제37권3호
• /
• pp.39-55
• /
• 2012

This paper presents an endosymbiotic evolutionary algorithm (EEA) to solve both problems of line balancing and model sequencing in a mixed-model two-sided assembly line (MMtAL) simultaneously. It is important to have a proper balancing and model sequencing for an efficient operation of MMtAL. EEA imitates the natural evolution process of endosymbionts, which is an extension of existing symbiotic evolutionary algorithms. It provides a proper balance between parallel search with the separated individuals representing partial solutions and integrated search with endosymbionts representing entire solutions. The strategy of localized coevolution and the concept of steady-state genetic algorithms are used to improve the search efficiency. The experimental results reveal that EEA is better than two compared symbiotic evolutionary algorithms as well as a traditional genetic algorithm in solution quality.