• 농촌지도와개발
• /
• 제4권1호
• /
• pp.211-229
• /
• 1997

An environmental problem is the greatest barrier to pursuit of mankinds existence and development. The major traits of this problem are totality and complexity, therefore the finding of environmental problem's solutions is very difficult. The eco-friendly development that pursuing the ecological principles is the direction of environmental problem's solutions. Environmentally sound and sustainable development, deep ecological thought or environmentalism, the following of god's creation order and the old oriental thought are patterns and principles of eco-friendly development. Every creature has one ecological niche from the ecological principles of adoption, competition, evolution, variety, circulation, harmony and equilibrium. Ecological niche means that every creature has ecological status and duty. Therefore finding the mankinds ecological niche is important because it is desirable directions for eco-friendly development to solve environmental problems.

• 산업경영시스템학회지
• /
• 제25권2호
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제12권1호
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• Nuclear Engineering and Technology
• /
• 제56권1호
• /
• pp.92-99
• /
• 2024

To minimize the cumulative radiation dose, various path-finding approaches for single agent have been proposed. However, for emergence situations such as nuclear power plant accident, these methods cannot be effectively utilized for evacuating a large number of workers because no multi-agent method is valid to conduct the mission. In this study, a novel algorithm for solving the multi-agent path-finding problem is proposed using the conflict-based search approach and the objective function redefined in terms of the cumulative radiation dose. The proposed method can find multi paths that all agents arrive at the destinations with reducing the overall radiation dose. To verify the proposed method, three problems were defined. In the single-agent problem, the objective function proposed in this study reduces the cumulative dose by 82% compared with that of the shortest distance algorithm in experiment environment of this study. It was also verified in the two multi-agent problems that multi paths with minimized the overall radiation dose, in which all agents can reach the destination without collision, can be found. The method proposed in this study will contribute to establishing evacuation plans for improving the safety of workers in radiation-related facilities.

• 영재교육연구
• /
• 제21권4호
• /
• pp.1033-1053
• /
• 2011

본 연구는 역사적 발견을 이루어낸 과학자 가운데 멘델(Mendel, Gregor Johann, 1822-1884)의 과학적 사고과정을 활용하여 과학영재교육프로그램을 개발하고, 이 프로그램을 학습한 학생들의 문제발견 및 가설설정 능력의 변화를 측정하여, 프로그램의 효과성을 검증하는데 목적을 두었다. 이를 위해 먼저, 멘델이 유전법칙을 확립하는 과정에서 나타낸 과학적 사고과정을 분석하여 특징적 탐구요소를 추출하였다. 추출된 탐구요소 가운데 문제발견과 가설설정을 적용한 프로그램으로서 완두를 활용한 모의실험탐구중심의 과학영재교육프로그램을 개발하였다. 개발한 과학영재교육프로그램은 대학교 부설 과학영재교육원 소속 중학교 1, 2학년 학생 19명(남학생 11명, 여학생 8명)을 대상으로 적용되었다. 적용한 결과, 학생들은 문제발견 능력의 하위요소 융통성, 정교성, 독창성이 신장되었고, 가설설정 능력의 논리성도 신장되었다. 이에 개발된 과학영재교육프로그램은 중학교 과학영재로 선발된 학생들의 문제발견 및 가설 설정 능력을 향상시키는데 효과가 있는 것으로 고찰되었다.

• 한국공간정보시스템학회 논문지
• /
• 제11권4호
• /
• pp.39-46
• /
• 2009

일반적으로 휴리스틱을 이용한 알고리즘에서는 탐색 비용이 증가하는 문제가 발생할 수 있다. 휴리스틱에 의해 결정된 추정 경로에 실제 경로가 존재하지 않을 경우, 휴리스틱 가중치 값이 비슷한 2 가지 이상의 경로가 존재할 경우 탐색 비용이 증가한다. 이 논문에서는 탐색 비용 증가 문제점을 해결하기 위해 추상 그래프를 제안한다. 추상 그래프는 실제 도로를 단순화한 그래프로서, 전체 지도를 고정된 크기의 그리드 셀로 나누고, 셀과 도로 정보를 기반으로 생성된다. 경로 탐색은 추상 그래프 탐색, 실제 도로 네트워크 탐색 순으로 2단계로 수행된다. 106,254개의 간선으로 이루어진 실제 도로 네트워크 데이터에 대해서 성능 평가 실험을 수행한 결과와 탐색 비용 측면에서 그리드 셀 크기에 따라 그리드 기반 A* 알고리즘에 비해 최소 3%에서 최대 35% 좋은 성능을 보였다. 반면에 유효 셀을 제외한 영역에 대한 탐색이 이루어지지 않기 때문에, 생성된 경로의 이동 비용은 1.5~6.6% 증가하였다.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.453-465
• /
• 2000

In this paper, a new method for finding the approximate solution of a second order nonlinear partial differential equation is introduced. In this method the problem is transformed to an equivalent optimization problem. them , by considering it as a distributed parameter control system the theory of measure is used for obtaining the approximate solution of the original problem.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제19권4호
• /
• pp.363-381
• /
• 2012

Shortfall risk is considered by taking some exposed risks because the superhedging price is too expensive to be used in practice. Minimizing shortfall risk can be reduced to the problem of finding a randomized test ${\psi}$ in the static problem. The optimization problem can be solved via the classical Neyman-Pearson theory, and can be also explained in terms of hypothesis testing. We introduce the classical Neyman-Pearson lemma expressed in terms of mathematics and see how it is applied to shortfall risk in finance.

• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 B
• /
• pp.636-638
• /
• 1997

This paper deals with the problem of finding robust controller based upon a pole assignment method for a plant with parameter perturbations. This case is not a problem of Interval polynomial family but a problem of poly topic polynomial family. As a method of stability test, we used GKT(Generalized Kharitonov Theorem) having computational advantage.