• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1169-1182
• /
• 2020

The ant colony optimization (ACO) algorithm is a classical metaheuristic optimization algorithm. However, the conventional ACO was liable to trap in the local minimum and has an inherent slow rate of convergence. In this work, we propose a novel combinatorial ACO algorithm (CG-ACO) to alleviate these limitations. The genetic algorithm and the cloud model were embedded into the ACO to find better initial solutions and the optimal parameters. In the experiment section, we compared CG-ACO with the state-of-the-art methods and discussed the parameter stability of CG-ACO. The experiment results showed that the CG-ACO achieved better performance than ACO_R, simple genetic algorithm (SGA), CQPSO and CAFSA and was more likely to reach the global optimal solution.

• 전기의세계
• /
• 제31권5호
• /
• pp.375-382
• /
• 1982

The optimum control of voltage and reactive power in large system requires large amounts of complicated calculation. If the large power system is controlled by the centralized control scheme, the necessary computing time, memory requirments and data transmission channels increase exponetially, and computer control of the system becomes difficult. Piecewise method which aims at the reduction of the difficulties of centralized control scheme is to decompose a large power system into several subsystems, each of which is controlled by a local computer and the control efforts of each subsystem are coordinated by a central computer. Unless sufficient coordination is made between subsystems, the control quality may become very poor. This paper describes how piecewise method can be applied in the optimal control of voltage and reactive power in large system, and presents effective calaulating algorithm for the solution of the problem. The numerical example for model system is presented here.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 A
• /
• pp.197-199
• /
• 2001

This paper presents a Tabu Search (TS) based algorithm to solve the Optimal Power Flow (OPF) problem, converses rapidly to global optima by means of escaping local minima. In this paper, a new approach based on the random TS algorithm with continuous variable is proposed to find that a solution to the OPF problem within reasonable time complexity. To verify the efficiency of the proposed approach, case studies are made for IEEE 30-bus system.

• Advances in aircraft and spacecraft science
• /
• 제9권5호
• /
• pp.433-447
• /
• 2022

This work deals with an explicit guidance and control architecture for autonomous lunar ascent and orbit injection, i.e., the locally-flat near-optimal guidance, accompanied by nonlinear reduced-attitude control. This is a new explicit guidance scheme, based on the local projection of the position and velocity variables, in conjunction with the real-time solution of the associated minimum-time problem. A recently-introduced quaternion-based reduced-attitude control algorithm, which enjoys quasi-global stability properties, is employed to drive the longitudinal axis of the ascent vehicle toward the desired direction. Actuation, based on thrust vectoring, is modeled as well. Extensive Monte Carlo simulations prove the effectiveness of the guidance, control, and actuation architecture proposed in this study for precise lunar orbit insertion, in the presence of nonnominal flight conditions.

• Asian Pacific Journal of Cancer Prevention
• /
• 제15권14호
• /
• pp.5799-5804
• /
• 2014

Background: Radiofrequency ablation (RFA) is the most widely used and studied method internationally for the local treatment of liver tumors. However, the extension of coagulation necrosis in one RFA procedure is limited and incomplete coverage of the damaged area can lead to a high local recurrence rate. Objective: In this study, we compared the effects of different solutions in enhancing hepatic radiofrequency by establishing a rabbit VX2 liver cancer model. We also determined the optimal solution to maximise effects on the extent of RFA-induced coagulation necrosis. Methods: Thirty VX2 tumor rabbits were randomly assigned to five groups: group A, RFA alone; group B, RFA with anhydrous ethanol injection; group C, RFA with 5% hypertonic saline injection; group D, RFA with lidocaine injection; and group E, RFA with a mixed solution. Routine ultrasound examinations and contrast-enhanced ultrasound (CEUS) of the ablation areas were performed after RFA. Then, we measured the major axis and transverse diameter and compared the areas of coagulation necrosis induced by RFA. Results: The mean ablation area range increased in groups B, C and especially E, and the scopes were greater compared with group A. Preoperative application of anhydrous ethanol, hypertonic saline, lidocaine and the mixed solution (groups B, C, D and E, respectively) resulted in larger coagulation necrosis areas than in group A (p<0.05). Among the groups, the coagulation necrosis areas in group E was largest, and the difference was statistically significant compared with other groups (p<0.05). Pathological findings were consistent with imaging results. Conclusions: A mixture of dehydrated alcohol, hypertonic saline and lidocaine injected with RFA increases the extent of coagulation necrosis in the liver with a single application, and the mixed solution is more effective than any other injection alone.

• 대한산업공학회지
• /
• 제24권1호
• /
• pp.77-93
• /
• 1998

It is discussed how to locate idle vehicles of AGVS on unidirectional guide paths. The problem is modeled as a median location problem on a cyclic network. The characteristics of the optimal location are analyzed and some useful properties are suggested to reduce the solution space. Based on the properties found, several special types of networks - a pure single-loop type, the loop type with a single branching intersection and the loop type with local branching node - are also analyzed as well as the general cyclic network. In each case of the networks, a solution procedure is suggested. Some numerical examples are provided to illustrate the algorithms developed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.522-524
• /
• 1999

This paper addresses the systematic approach to the fuzzy modeling of the class of complex and uncertain nonlinear systems. While the conventional genetic algorithm (GA) only searches the global solution, Virus-Evolutionary Genetic Algorithm(VEGA) can search the global and local optimal solution simultaneously. In the proposed method the parameter and the structure of the fuzzy model are automatically identified at the same time by using VEGA. To show the effectiveness and the feasibility of the proposed method, a numerical example is provided. The performance of the proposed method is compared with that of conventional GA.

• 산업경영시스템학회지
• /
• 제23권59호
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• 예술인문사회 융합 멀티미디어 논문지
• /
• 제6권6호
• /
• pp.469-477
• /
• 2016

이 연구에서는 주어진 공장의 공간에 여러 개의 직사각형 형태 부서의 위치를 할당하고 문헌에 있는 다른 설비배치 기법과 비교하고자 한다. 이 연구는 초기 설비배치가 주어졌을 때 물류비용을 최소화하는 개선적 접근방법을 제시하였다. 기존의 문헌에 있는 접근 방법과 같이 이 연구에서 제시된 접근 방법도 하나의 설비배치에서 부서를 교환하여 더 좋은 해를 찾고자 하였으며, 물류비용을 개선하는 자기발견적 절차를 적용하였다. 수직적 교환, 수평적 교환, 통합 절차 및 분리 절차를 통해 더 좋은 해를 발견할 가능성을 높이고 크기가 같은 설비의 경우에는 설비 배치의 회전도 가능하게 하였다. 그러나 CRAFT와 달리 이 연구에서 제시되는 알고리즘은 설비 형태의 왜곡이 일어나지 않고 직사각형을 유지하는 좋은 해를 제공한다. 또한 Tabu 탐색기법을 활용하여 지역적인 최적해에서 전체 최적해를 찾아가고자 하였다. 문헌에 있는 25개의 설비배치 문제에 대하여 다른 접근 방법과 비교한 결과 제시된 접근방법이 설비의 수가 많을 때 훨씬 더 좋은 해를 제공하는 것으로 나타났다.

• 한국수자원학회논문집
• /
• 제46권1호
• /
• pp.73-85
• /
• 2013

저류함수법의 최적 매개변수를 추정하기 위한 연구는 오랜 동안 여러 가지 방법으로 수행되어왔다. 그러나 여전히 최적 매개변수를 결정하는 것은 시간이 오래 걸리는 일이며, 유역의 물리적인 특성과 상관없는 매개변수가 결과로 제시되는 경우가 잦다는 인식이 팽배하다. 본 구에서는 저류함수모형의 연속방정식과 저류함수식을 충실히 분석하고 민감도 분석을 수행하였다. 그 결과, 많은 수의 국지해 중에서 유일해를 결정하는 방법을 제안할 수 있었다. 또한 유역의 직접유출 시작 시간을 고려하여 저류함수법의 지체시간을 결정할 수 있다는 것을 보였으며, 매개변수의 민감도 분석 결과, 모형의 지체시간을 결정하는 것이매우 중요하다는 것을 알수 있었다. 지체시간을 결정한 후에는 유일한해를 비교적 쉽게 찾을 수 있었다. 그러므로 제안된 방법은 기존의 최적화 방법과 같이 시간이 오래 걸리지 않으며, 강우사상별로 비교적 정확한 매개변수를 산정할 수 있다는 장점이 있다. 제안된 방법을 이용하여 기존의 저류함수법의 매개변수를 추정하기 위한 다양한 방법 중 상수고정법을 수정하였으며, 그 결과 실무에서 업무효율을 높일 수 있을 것으로 기대된다. 또한 제안된 방법은 기존의 유출수문곡선의 계산오차에만 의지하여 매개변수를 최적화하는 방법과는 다르게 유역의 특성을 고려할 수 있다는 점에서 그 의미가 있다.