• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.142-146
• /
• 2000

This paper Presents a heuristic algorithm based on branch exchange method to solve ORP (Optimal Routing Problem) for distribution system planning. The ORP is a complex task which is generally formulated as a combinatorial optimization problem with various constraints. The cost function of ORP is consisted of the investment cost and the system operation cost that is generally expressed with system power loss. This paper also adopt an specialy designed selection method of maximum loss reduction loop and branch to reduce optimization time. The effectiveness of the proposed algorithm was shown with 32, 69 bus example system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.303-308
• /
• 1992

In this study, we propose a shared storage system which is more efficient policy than MIS(Mixed Intermediate Storage) policy for relatively rare storage system and can be called CIS(Common Intermediate Storage) policy. Using this strategy, we develop a new completion time algorithm and apply it to two kinds of optimal or near optimal scheduling method; combinatorial search and simulated annealing method. We also extend this strategy to other storage policy, for example MIS policy, with PLC(Programmable Logic Controller) logic and on/off action of electronic valves. It thus can be accepted as a basic form of FMS(Flexible Manufacturing System) for operating various storage policies. Finally we suggest the interlocking block to compansate for the shortcoming of CIS policy, i.e, complication of operation and safety, resulting in a basic batch process automation mode.

• 한국시뮬레이션학회논문지
• /
• 제14권2호
• /
• pp.25-34
• /
• 2005

Determination of component mounting sequence on printed circuit board assembly process is a typical NP-hard problem. It is a kind of traveling salesman problems, but it has one more hard to meet constraint of matching component type per mounting position as well as searching the shortest path. An efficient method is developed by separation of crowed area and allowing up to two slots per component type. A simulation model is constructed using Visual C++ for evaluation of the suggested heuristic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2162-2176
• /
• 2018

Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems.

• 한국멀티미디어학회논문지
• /
• 제7권6호
• /
• pp.841-850
• /
• 2004

This paper proposes a GA and GDM-based method for removing unnecessary rules and generating relevant rules from the fuzzy rules corresponding to several fuzzy partitions. The aim of proposed method is to find a minimum set of fuzzy rules that can correctly classify all the training patterns. When the fine fuzzy partition is used with conventional methods, the number of fuzzy rules has been enormous and the performance of fuzzy inference system became low. This paper presents the application of GA as a means of finding optimal solutions over fuzzy partitions. In each rule, the antecedent part is made up the membership functions of a fuzzy set, and the consequent part is made up of a real number. The membership functions and the number of fuzzy inference rules are tuned by means of the GA, while the real numbers in the consequent parts of the rules are tuned by means of the gradient descent method. It is shown that the proposed method has improved than the performance of conventional method in formulating and solving a combinatorial optimization problem that has two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy rules.

• 한국항공우주학회지
• /
• 제38권5호
• /
• pp.427-436
• /
• 2010

본 논문은 다수의 목표물과 다수의 임무가 존재하는 상황에서의 다수 무인항공기의 임무할당 문제를 다룬다. 다수 무인항공기의 임무할당 문제는 순회 세일즈맨 문제, 차량 라우팅 문제와 같은 조합최적화 문제의 일종으로 NP-hard의 계산 복잡도를 가지고 있다. 이런 성격의 문제는 문제의 크기가 커질수록 계산시간이 급격히 증가하는 특징을 지니기 때문에 문제를 효율적으로 풀기 위해서 근사화 방법 또는 발견적인 방법을 사용한다. 본 연구에서는 임무할당 문제를 혼합정수 선형계획 문제로 정식화하고, 혼합정수 선형계획법과 유전 알고리듬으로 해를 구하였다. 다수의 목표물, 다수의 임무, 장애물이 존재하는 환경에 대한 수치 시뮬레이션을 수행하여 각 방법의 최적성과 효율성에 대해 검토하였다.

• The Korean Journal of Physiology and Pharmacology
• /
• 제20권3호
• /
• pp.261-268
• /
• 2016

$Foxp3^+$ $CD25^+CD4^+$ regulatory T (Treg) cells are crucial for the maintenance of immunological self-tolerance and are abundant in tumors. Most of these cells are chemo-attracted to tumor tissues and suppress anti-tumor responses inside the tumor. Currently, several cancer immunotherapies targeting Treg cells are being clinically tested. Cisplatin is one of the most potent chemotherapy drugs widely used for cancer treatment. While cisplatin is a powerful drug for the treatment of multiple cancers, there are obstacles that limit its use, such as renal dysfunction and the development of cisplatin-resistant cancer cells after its use. To minimize these barriers, combinatorial therapies of cisplatin with other drugs have been developed and have proven to be more effective to treat cancer. In the present study, we evaluated the effect of the combination therapy using methyl gallate with cisplatin in EL4 murine lymphoma bearing C57BL/6 mice. The combinatorial therapy of methyl gallate and cisplatin showed stronger anti-cancer effects than methyl gallate or cisplatin as single treatments. In Treg cell-depleted mice, however, the effect of methyl gallate vanished. It was found that methyl gallate treatment inhibited Treg cell migration into the tumor regardless of cisplatin treatment. Additionally, in both the normal and cisplatin-treated tumor-bearing mice, there was no renal toxicity attributed to methyl gallate treatment. These findings suggest that methyl gallate treatment could be useful as an adjuvant method accompanied with cisplatin therapy.

• Journal of Mechanical Science and Technology
• /
• 제19권5호
• /
• pp.1072-1079
• /
• 2005

Conceptual design is the first step in the overall process of product design. Its intrinsic uncertainty, imprecision, and lack of information lead to the fact that current conceptual design activities in engineering have not been computerized and very few CAD systems are available to support conceptual design. In most of the current intelligent design systems, approach of principle synthesis, such as morphology matrix, bond graphic, or design catalogues, is usually adopted to deal with the concept generation, in which optional concepts are generally combined and enumerated through function analysis. However, as a large number of concepts are generated, it is difficult to evaluate and optimize these design candidates using regular algorithm. It is necessary to develop a new approach or a tool to solve the concept generation. Generally speaking, concept generation is a problem of concept synthesis. In substance, this process of developing design candidate is a combinatorial optimization process, viz., the process of concept generation can be regarded as a solution for a state-place composed of multi-concepts. In this paper, genetic algorithm is utilized as a feasible tool to solve the problem of combinatorial optimization in concept generation, in which the encoding method of morphology matrix based on function analysis is applied, and a sequence of optimal concepts are generated through the search and iterative process which is controlled by genetic operators, including selection, crossover, mutation, and reproduction in GA. Several crucial problems on GA are discussed in this paper, such as the calculation of fitness value and the criteria for heredity termination, which have a heavy effect on selection of better concepts. The feasibility and intellectualization of the proposed approach are demonstrated with an engineering case. In this work concept generation is implemented using GA, which can facilitate not only generating several better concepts, but also selecting the best concept. Thus optimal concepts can be conveniently developed and design efficiency can be greatly improved.

• 지능정보연구
• /
• 제3권2호
• /
• pp.1-9
• /
• 1997

본 논푼에서는 경수로 원자력 발전소의 사용 후 핵연료를 중수로의 핵연료로 재사용하기 위해 사용 후 경수로 핵연료의 최적 조합을 찾는데 진화 알고리즘(Evolutionary Algorithm)을 이용하여 해결해 보고자 한다. 진화 알고리즘은 대규모 문제 공간에서 최적화 문제를 해결하는데 적합한 알고리즘이다. 사용 후 경수로 핵연료에는 중수로에서 사용할 수 있는 유용한 원자들을 많이 포함하고 있지만 핵연료 봉마다 그 함량이 다양하고, 중수로 연료가 되기 위한 제약 조건 때문에 최적 조합 전략이 펼요하다. 사용후 핵연료의 조합 문제는 알고리즘 분야에서 대표적인 조합 최적화 문제인 0/1 Knapsack문제와 같이 Non-Polynomial (NP) Complete문제에 해당한다. 이러한 문제를 해결하기 위해셔는 고전적언 전화 알고리즘의 전략에 기반하여 랜덤 연산자를 이용하되 평가 함수 값이 좋은 방향으로만 탐색을 수행하는 방법이 있으나 이것은 탐색의 효율면에셔 좋지 않다. 따라서 본 연구에서는 벡터 연산자를 이용하여 최적의 해를 보다 빨리 얻을 수 있는 휴리스틱을 사용하는 방법을 제안한다. 본 논문에서는 경수로 핵연료 조합 문제 영역의 모든 지식을 벡터화하여 벡터의 연산만으로 가능성 검사, 해를 평가 하는 방법을 소개한다. 또한 벡터 휴리스틱이 고전적인 진화 알고리즘에 비해 어느 정도의 성능을 보이는지 비교한다.

• Journal of Microbiology and Biotechnology
• /
• 제24권3호
• /
• pp.408-420
• /
• 2014

Yeast surface-displayed antibody libraries provide an efficient and quantitative screening resource for given antigens, but suffer from typically modest library sizes owing to low yeast transformation efficiency. Yeast mating is an attractive method for overcoming the limit of yeast transformation to construct a large, combinatorial antibody library, but the optimal conditions have not been reported. Here, we report a large synthetic human Fab (antigen binding fragment) yeast surface-displayed library generated by stepwise optimization of yeast mating conditions. We first constructed HC (heavy chain) and LC (light chain) libraries, where all of the six CDRs (complementarity-determining regions) of the variable domains were diversified mimicking the human germline antibody repertoires by degenerate codons, onto single frameworks of VH3-23 and $V{\kappa}1$-16 germline sequences, in two haploid cells of opposite mating types. Yeast mating conditions were optimized in the order of cell density, media pH, and cell growth phase, yielding a mating efficiency of ~58% between the two haploid cells carrying HC and LC libraries. We constructed two combinatorial Fab libraries with CDR-H3 of 9 or 11 residues in length with colony diversities of more than $10^9$ by one round of yeast mating between the two haploid HC and LC libraries, with modest diversity sizes of ${\sim}10^7$. The synthetic human Fab yeast-displayed libraries exhibited relative amino acid compositions in each position of the six CDRs that were very similar to those of the designed repertoires, suggesting that they are a promising source for human Fab antibody screening.