• 한국소음진동공학회논문집
• /
• 제12권6호
• /
• pp.478-487
• /
• 2002

This paper presents a hybrid method to compute the solutions of an optimization Problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The artificial life algorithm has the most important feature called emergence. The emergence is the result of dynamic interaction among the individuals consisting of the system and is not found in an individual. The conventional artificial life algorithm for optimization is a stochastic searching algorithm using the feature of artificial life. Emergent colonies appear at the optimum locations in an artificial ecology. And the locations are the optimum solutions. We combined the feature of random-tabu search method with the conventional algorithm. The feature of random-tabu search method is to divide any given region into sub-regions. The enhanced artificial life algorithm (EALA) not only converge faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The enhanced artificial life algorithm is applied to the optimum design of high-speed, short journal bearings and its usefulness is verified through an optimization problem.

• 한국통신학회논문지
• /
• 제36권9B호
• /
• pp.1039-1048
• /
• 2011

Carrier Ethernet, which extend The algorithm based on constructing the mixed topology and performing link stretching, MT/s, has been proposed for designing cost-efficient Carrier Ethernet in optical network with multi-line-rate. However, the MT/s algorithm has high blocking ratio because the wavelength capacity is fully allocated without considering the load balance of network. In this paper, we propose an efficient mixed topology configuration (EMTC) algorithm by modifying MT/s algorithm. In order to reduce blocking ratio, we adapt a threshold for each link to restrict the link utilization so that traffic load can be distributed over whole network. We also apply the EMTC algorithm into optical hybrid switched network to evaluate the availability of our algorithm for different applications. The performance of the EMTC algorithm is compared with that of MT/s algorithm through OPNET simulation. The simulation results show that our algorithm achieve lower blocking ratio than the MT/s algorithm. Moreover, in hybrid switched network, our algorithm performs better than MT/s algorithm in terms of packet loss ratio and end-to-end delay.

• 한국컴퓨터정보학회논문지
• /
• 제17권9호
• /
• pp.139-147
• /
• 2012

본 논문에서는 할당 문제의 최적해를 간단히 찾을 수 있는 알고리즘을 제안하였다. 일반적으로 할당 문제의 최적해는 Hungarian 알고리즘으로 구한다. 제안된 알고리즘은 Hungarian 알고리즘의 4단계 수행 과정을 1단계로 단축시켰으며, 행과 열의 최소 비용만을 선택하여 비용을 감소시키는 최적화 과정을 거쳐 최적해를 구하였다. 제안된 알고리즘을 27개의 균형 할당 문제와 7개의 불균형 할당 문제에 적용한 결과 유전자 알고리즘으로 찾지 못한 최적해를 찾는데 성공하였다. 제안된 알고리즘은 Hungarian 알고리즘의 수행 복잡도 O($n^3$)을 O(n)으로 향상시켰다. 따라서 제안된 알고리즘은 Hungarian 알고리즘을 대체하여 할당 문제에 일반적으로 적용할 수 있는 알고리즘으로 널리 활용될 수 있을 것이다.

• 기본간호학회지
• /
• 제24권1호
• /
• pp.18-29
• /
• 2017

Purpose: The purpose of this study was to develop an algorithm for nursing care after percutaneous coronary intervention in order to improve patients' safety and prevent complications, because percutaneous coronary intervention is becoming a common treatment for coronary artery diseases. Methods: By reviewing related literatures and interviewing nurses, items and paths that were to be used in the algorithm for nursing care after percutaneous coronary intervention were drawn up and a draft algorithm was developed. The final algorithm was determined based on the results of the evaluation performed after clinical application. Results: According to the outcome after allowing nurses to apply the revised algorithm with 11 patients, suitability on items composing the algorithm were highly rated whereas promptness was lowly rated. Although the patients (n=11) to whom the algorithm was applied complained of less back pain (p=.001) and discomfort (p=.026) compared to the patients (n=17) to whom the algorithm was not applied, no significant difference in bleeding complication was found. Conclusion: The findings in the study support the clinical utilization of the algorithm for nursing care after percutaneous coronary intervention as the use of this algorithm reduced back pain and discomfort without increasing bleeding complications at the femoral puncture site.

• 대한교통학회지
• /
• 제20권6호
• /
• pp.99-113
• /
• 2002

교통량배분문제 가운데 다중계층 교통량배분문제는 유일해가 보장되지 않는 대표적 사례로 최근 들어 모형의 정식화 및 해법에 관해서 활발하게 전개되고 있다. 정식화에 있어서는 변동부등식이나 고정점 문제를 활용한 정식화가 보편적으로 활용되고 있으나 해법(알고리즘)에 관한 연구는 미흡한 실정이다. 본 연구에서는 변동부등식으로 정의된 다중계층 이용자균형 교통량배분문제의 해법으로서 GA알고리즘과 대각화알고리즘, 군집화알고리즘을 조합한 Hybrid Algorithm을 개발, 제안한다. GA알고리즘과 군집화알고리즘은 해의 탐색을 전역적이면서도 효과적으로 수행하기 위해서 도입된 대각화 알고리즘의 보완적 알고리즘이라 할 수 있다. 본 연구에서는 또한, 다중계층 이용자균형 교통량배분문제의 해법으로서의 제안된 AMSA(The Algorithm of Multiclass Static User Equilibrium Assignment)의 특징을 예제풀이를 통해서 설명하고 있다.

• 정보학연구
• /
• 제2권1호
• /
• pp.103-113
• /
• 1999

본 논문에서는 연판정지향 알고리즘에 Stop-and-Go 알고리즘의 개념을 결합한 연판정지향 Stop-and-Go 알고리즘을 제안한다. 제안한 알고리즘은 두 알고리즘보다 더 신뢰성 있는 오차신호를 사용함으로써 향상된 등화 성능을 가진다. 컴퓨터 모의실험을 통하여 제안한 알고리즘이 CMA, MCMA, Stop-and-Go 알고리즘, 단순화된 연판정지향 알고리즘에 비해 잔류 심벌간 간섭과 정상상태로의 수렴 속도면에서 우수한 성능을 가짐을 확인하였다.

• 한국국방경영분석학회지
• /
• 제6권1호
• /
• pp.119-124
• /
• 1980

An efficient algorithm which can be employed in obtaining the minimal cut sets of a fault tree containing repeated events is introduced. A sample fault tree illustrates this algorithm. Efficiency of an algorithm is defined as the ratio of the number of minimal cut sets to the number of cut sets determined by the algorithm. An efficiency of the proposed algorithm is compared with those of two existing algorithms : Fussell and Vesely's algorithm and Bengiamin et al. 's algorithm. The proposed algorithm is shown to be more efficient than the existing two algorithms.

• 한국국방경영분석학회지
• /
• 제26권1호
• /
• pp.47-55
• /
• 2000

The purpose of this paper is to develop a new heuristic algorithm for vehicle routing problem. The algorithm is composed of two steps. First step is to make a initial solution using sweeping algorithm. Second step is to improve initial solution for optimal solution using node exchange algorithm and tabu search algorithm. We have proven that our algorithm has produced better results than solutions obtained by saving algorithm and genetic in ten example problems with different unit size.

• 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.

• 정보학연구
• /
• 제8권3호
• /
• pp.105-115
• /
• 2005

The CMA and MMA blind equalization algorithm has the inevitable large residual error caused by mismatching between the symbol constellation at a steady state after convergence. Stop-and-Go algorithm has a very superior residual error characteristics at a steady state but a relatively slow convergence characteristics. In this paper, we propose a SAG-Flagged MMA as a new adaptive blind equalization algorithm with a Stop-and-Go flag which follows a flagged MMA in update scheme of tap weights as appling the flag obtaining from Stop-and-Go algorithm to MMA. Using computer simulation, it is confirmed that the proposed algorithm has an enhancing performance from the viewpoint of residual ISI, residual error and convergence speed in comparison with MMA and Stop-and-Go algorithm. Algorithm has a new error function using the decided original constellation instead of the reduced constellation. By computer simulation, it is confirmed that the proposed algorithm has the performance superiority in terms of residual ISI and convergence speed compared with the adaptive blind equalization algorithm of CMA family, Constant Modulus Algorithm with Carrier Phase Recovery and Modified CMA(MCMA).