• Bulletin of the Korean Chemical Society
• /
• 제23권9호
• /
• pp.1277-1320
• /
• 2002

A novel approach to ${\alpha}-amino-{\delta}-valerolactone$ derivatives 8 by the intramolecular Ugi five-center three-component reaction (U-5C-3CR) using the multifunctional starting material, L-pentahomoserine 5 is described.

• 한국경영과학회지
• /
• 제19권2호
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• 대한수학회보
• /
• 제8권1호
• /
• pp.1-7
• /
• 1971

This paper presents in detail the construction of an unsolvable Thue system on two letters. The approach employed consists of first constructing a Thue system ${\Gamma}$ on n letters whose decision problem is recursively unsolvable. Then along the lines suggested by Davis [1], a combinatorial system ${\Gamma}^*$ whose alphabet-consists of two letters is constructed whose decision problem is recursively solvable if and only if that for ${\Gamma}$ is.

• 호남수학학술지
• /
• 제27권1호
• /
• pp.115-129
• /
• 2005

In this paper, we give a digital graph-theoretical approach of the study of digital images with relation to a simplicial complex. Thus, a digital graph $G_k$ with some k-adjacency in ${\mathbb{Z}}^n$ can be recognized by the simplicial complex spanned by $G_k$. Moreover, we demonstrate that a graphically $(k_0,\;k_1)$-continuous map $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}}^{n_1}$ can be converted into the simplicial map $S(f):S(G_{k_0}){\rightarrow}S(G_{k_1})$ with relation to combinatorial topology. Finally, if $G_{k_0}$ is not $(k_0,\;3^{n_0}-1)$-homotopy equivalent to $SC^{n_0,4}_{3^{n_0}-1}$, a graphically $(k_0,\;k_1)$-continuous map (respectively a graphically $(k_0,\;k_1)$-isomorphisim) $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}^{n_1}$ induces the group homomorphism (respectively the group isomorphisim) $S(f)_*:{\pi}_1(S(G_{k_0}),\;v_0){\rightarrow}{\pi}_1(S(G_{k_1}),\;f(v_0))$ in algebraic topology.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권3호
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• 한국정보통신학회논문지
• /
• 제9권5호
• /
• pp.1149-1160
• /
• 2005

일반적으로 네트워크 설계 문제는 네트워크의 크기가 늘어남에 따라 지수적으로 복잡도가 증가하여 전통적인 방법으로는 풀이하기 힘든 NP-hard 조합 최적화 문제 중의 하나로 분류될 수 있다. 본 논문에서는 네트워크 신뢰도 제약을 고려하면서 네트워크 구축비용을 효과적으로 최소화하는, 높은 신뢰도의 네트워크 토폴로지 설계 문제를 풀기 위해 스패닝 트리를 효율적으로 표현할 수 있는 $Pr\ddot{u}fer$수(PN) 기반의 진화 연산법과 2-연결성을 고려하는 휴리스틱 방법으로 구성된 두 단계의 효율적인 해법을 제안한다. 즉, 먼저 스패닝 트리를 찾아내기 위해 진화 연산법 중에 보편적으로 널리 알려져 있는 유전자 알고리즘(GA)을 이용하고 그 다음으로 첫 번째 단계에서 발견한 스패닝 트리에 대해 최적의 네트워크 토폴로지를 찾기 위해서 2-연결성을 고려한 휴리스틱 방법을 적용한다. 마지막으로 수치예의 결과를 통해 제안한 해법의 성능에 대해서 살펴보도록 한다.

• Environmental Engineering Research
• /
• 제25권3호
• /
• pp.290-298
• /
• 2020

A large residual fraction of aliphatic components of diesel prevails in soil, which has adverse effects on the environment. This study identified the most bio-recalcitrant aliphatic residual fraction of diesel through total petroleum-hydrocarbon fractional analysis. For this, the strain Acinetobacter sp. K-6 was isolated, identified, and characterized and investigated its ability to degrade diesel and n-alkanes (C₁₈, C₂₀, and C₂₂). The removal efficiency was analysed after treatment with bacteria and nutrients in various soil microcosms. The fractional analysis of diesel degradation after treatment with the bacterial strains identified C₁₈-C₂₂ hydrocarbons as the most bio-recalcitrant aliphatic fraction of diesel oil. Acinetobacter sp. K-6 degraded 59.2% of diesel oil and 56.4% of C₁₈-C₂₂ hydrocarbons in the contaminated soil. The degradation efficiency was further improved using a combinatorial approach of biostimulation and bioaugmentation, which resulted in 76.7% and 73.7% higher degradation of diesel oil and C₁₈-C₂₂ hydrocarbons, respectively. The findings of this study suggest that the removal of mid-length, non-volatile hydrocarbons is affected by the population of bio-degraders and the nutrients used in the process of remediation. A combinatorial approach, including biostimulation and bioaugmentation, could be used to effectively remove large quantities of aliphatic hydrocarbons persisting for a longer period in the soil.

• 산업공학
• /
• 제23권2호
• /
• pp.139-146
• /
• 2010

In this paper, we present the study of a real passenger transportation system. Passenger transportation problem aims to transport passengers from bus stops to their destinations by a fleet of vehicles while satisfying various constraints such as vehicle capacity, maximum allowable riding time in a bus, and time windows at destinations. Our problem also has special issues such as mixed loading, consideration of afternoon problem together with morning problem, and transferring passengers between vehicles. Our solution approach consists of three serial procedures: bus route generation, bus scheduling, and post optimization. Efficient heuristic algorithms were developed and implemented for the procedures. The proposed solution approach has been successfully applied to several real world problem instances and could reduce about 10% to 15% of buses.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.369-371
• /
• 2012

Wireless sensor networks have taken immense interest in healthcare systems in recent years. One example of it is in an in vivo sensor that is deployed in critical and sensitive healthcare applications like artificial retina, cardiac pacemaker, drug delivery, blood pressure, internal heat calculation, glucosemonitoring etc. In vivo sensor nodes exhibit temperature that may be very dangerous for human tissues. However, existing in vivo thermal aware routing approaches suffer from hotspot creation, delay, and computational complexity. These limitations motivate us toward an in vivo virtual backbone, a small subset of nodes, connected to all other nodes and involved in routing of all nodes, -based solution. A virtual backbone is lightweight and its fault-tolerant version allows in vivo sensor nodes to disconnect hotspot paths and to use alternative paths. We have formulated the problem as m-connected k-dominating set problem with minimum temperature cost in in vivo sensor network. This is a combinatorial optimization problem and we have been motivated to use evolutionary approach to solve the problem.