• 터널과지하공간
• /
• 제24권1호
• /
• pp.11-20
• /
• 2014

본 연구에서는 노천광산에서 다수의 작업 지점들을 경유하며 광산 전역을 순회해야하는 보조 작업 차량의 최적 이동경로를 분석하였다. Dijkstra's 알고리즘을 사용했던 기존의 연구들과 달리 휴리스틱 외판원 문제 알고리즘을 이용한 결과 다수의 작업지점들의 방문 순서까지 고려하여 보조 작업 차량의 최적 이동경로를 분석할 수 있다. 인도네시아 파시르 석탄 노천광산의 로또 채광장을 대상으로 광산 전역을 정차 없이 순회하는 보조작업 차량의 최적 이동경로를 분석하였다. 그 결과 분석자의 직관에 따라 작업지점들의 방문 순서를 결정하는 것보다 휴리스틱 TSP 알고리즘을 적용해 분석하는 것이 25개 지점 경유시 20분 정도의 이동시간을 단축할 수 있는 것으로 분석되었다. 본 연구에서 제시한 결과가 노천광산 보조 작업 차량들의 시스템 최적화와 관련된 향후 연구들의 방향설정 위해 기초자료로 활용될 수 있을 것이라 기대한다.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.62-67
• /
• 2004

Many ships in voyage experience weight and buoyancy distribution change by various reasons such as change of sea water density and waves, weather condition, and consumption of fuel, provisions, etc . The weight and buoyancy distribution change can bring the ships out of allowable trim, heeling angle. In these case, the ships should adjust trim and heeling angle by shifting of liquid cargo or ballasting, deballasting of ballast tanks for recovery of initial state or for a stable voyage. But, if the adjustment is performed incorrectly, ship's safety such as longitudinal strength, intact stability, propeller immersion, wide visibility, minimum forward draft cannot be secured correctly. So it is required that the adjustment of trim and heeling angle should be planned not by human operators but by optimization computer algorithm. To make an optimized plan to adjust trim and heeling angle guaranteeing the ship's safety and quickness of process, Uk! combined mechanical analysis and optimization algorithm. The candidate algorithms for the study were heuristic algorithm, meta-heuristic algorithm and uninformed searching algorithm. These are widely used in various kinds of optimization problems. Among them, heuristic algorithm $A^\ast$ was chosen for its optimality. The $A^\ast$ algorithm is then applied for the study. Three core elements of $A^\ast$ Algorithm consists of node, operator, evaluation function were modified and redefined. And we analyzed the $A^\ast$ algorithm by considering cooperation with loading instrument installed in most ships. Finally, the algorithm has been applied to tanker ship's various conditions such as Normal Ballast Condition, Homo Design Condition, Alternate Loading Condition, Also the test results are compared and discussed to confirm the efficiency and the usefulness of the methodology developed the system.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제29권1_2호
• /
• pp.91-97
• /
• 2002

본 논문에서는 자율수중운동체(AUVs, Autonomous Underwater Vehicles)의 실시간 충돌회피를 위한 휴리스틱 탐색기법을 논한다. 퍼지관계곱(fuzzy relational products)은 항행 환경에서 발생하는 장애물과 다음으로 이동 가능한 후보노드들과의 관계를 분석, 종합하는 수학적 도구로 사용된다. 본 논문은 영역전문가 보유한 장애물회피 관련 경험적 정보(heuristic information)를 반영하여 보다 효율적인 평가함수(evaluation function)를 고안하며 지능항행시스템의 상세경로설정(local path-planning)에 퍼지관계곱을 적용하여 보다 개선된 휴리스틱 탐색기법을 제안한다. 제안된 탐색기법의 성능검증을 위해 수행시간(cpu time), 경로의 최적화(optimization) 정도, 그리고 사용 메모리 관점에서 시뮬레이션을 통해 $A^{*}$ 탐색기법과 비교한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.59-62
• /
• 2001

This paper discusses a data mining technique for time series analysis of traffic data, which provides useful knowledge for network configuration management. Commonly, a network designer must employ a combination of heuristic algorithms and analysis in an interactive manner until satisfactory solutions are obtained. The problem of heuristic algorithms is that it is difficult to deal with large networks and simplification or assumptions have to be made to make them solvable. Various data mining techniques are studied to gain valuable knowledge in large and complex telecommunication networks. In this paper, we propose a traffic pattern association technique among network nodes, which produces association rules of traffic fluctuation patterns among network nodes. Discovered rules can be utilized for improving network topologies and dynamic routing performance.

• 경영정보학연구
• /
• 제22권3호
• /
• pp.119-142
• /
• 2020

본 연구는 유튜브 이용자들이 정보탐색 중 발견하게 되는 유튜브의 IT 기능들이 휴리스틱 단서로써 컨텐츠에 대한 태도 및 시청 의도에 미치는 영향에 대하여 살펴보고자 하였다. 휴리스틱-체계적 모델(Heuristic-Systematic Model: HSM)에 따르면 사람들은 유용한 정보를 빠르게 선택하여 처리해야 하므로 눈에 띄는 단서인 휴리스틱 단서에 의존하는 경향을 보인다. 본 연구에서는 유튜브 내 존재하는 IT 기능들을 기반으로 발현되는 휴리스틱 단서에 집중하였다. 문헌 연구 및 인터뷰를 기반으로, 콘텐츠에 대한 태도에 영향을 미치는 여러 가지 요소 중에서도 유튜브 내 IT 기능을 통해 발현될 수 있는 세 가지 요인인 사회적 지지, 유튜버의 자기표현, 상호작용성을 도출하여, 해당 요인들을 바탕으로 실험을 진행하였다. 유튜브 속 IT 기능들이 활발히 사용되어 사회적 지지, 유튜버의 자기표현, 상호작용성이 높게 인지되는 경우, 해당 콘텐츠에 대한 태도가 호의적으로 형성되어 시청 의도에 긍정적인 영향을 줄 수 있을 것이라 예상하였다. 데이터 분석 결과, 사용자들은 사회적 지지와 유튜버의 자기표현, 상호작용성을 높게 인지할수록 콘텐츠에 대한 태도를 호의적으로 형성하였으며 이는 시청 의도로까지 이어지는 것을 확인하였다. 본 연구는 유튜브 내 수많은 콘텐츠들 속에서 특정 콘텐츠에 대한 시청을 이끌어내기 위해서 유튜브에서 제공하는 어떠한 IT 기능 요소들을 활용해야 하는지 체계적으로 분류하여 그 역할을 검증함에 의의가 있다.

• 대한산업공학회지
• /
• 제24권2호
• /
• pp.185-197
• /
• 1998

Engineering design involves the specification of many variables that define a product, how it is made, and how it behaves. Before some variables can be determined, other variables must first be known or assumed. This fact implies a precedence order of the variables, and of the tasks of determining these variable consequently. Moreover, design of complex systems may involve a large number of design activities. In this paper, the activity-activity incidence matrix is considered as a representation of design activity analysis which mainly focuses on the precedence constraint. In order to analyze the activity-activity incidence matrix, a heuristic algorithm is proposed, which transforms an activity-activity, parameter-formula, and parameter-parameter incidence matrix into a lower triangular form. The analysis of the structured matrices can not only significantly reduce the overall project complexity by reorganizing few critical tasks in practice, but also aims at obtaining shorter times considering the solution structure by exploring concurrency.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제24권3호
• /
• pp.175-199
• /
• 2021

The Science Writing Heuristic (SWH) approach is described as an immersive argument-based science inquiry focusing particularly on learning through epistemic practices. In the literature, several previous studies indicate how academic achievement is positively influenced by the SWH. In addition to these previous studies, several meta-syntheses of qualitative data have been conducted on this particular topic. With these literatures in mind, a quantitative meta-analysis was conducted with ten studies (N = 724) to examine the effectiveness of the SWH on student achievement in Turkey. To present a thoroughly detailed report, this study also examined the following moderators: grade level, subject area, school location, intervention length, and report source. Overall, this study found that in Turkey, the SWH classrooms performed better in academic achievement tests than traditional lecture-based classrooms. Additionally, the SWH is more likely to be effective regardless of grade levels, subject areas, and school locations.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 2003년도 춘계학술발표대회 요약집
• /
• pp.98-98
• /
• 2003

• 한국경영과학회지
• /
• 제33권3호
• /
• pp.1-16
• /
• 2008

This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.

• 산업경영시스템학회지
• /
• 제34권4호
• /
• pp.152-161
• /
• 2011

The operation of vending machine system presents a decision-making problem which consists of determining the product allocation to vending-machine storage compartments, replenishment intervals of vending machines, and vehicle routes, all of which have critical effects on system profit. Especially, it becomes more difficult to determine the operation variables optimally when demand for a product that is out-of-stock spills over to another product or is lost. In this paper, we propose a heuristic for solving the operation problem of the vending machine system and evaluate it by comparing with Yang's algorithm on various test problems with respect to system profit via a computer simulation. The results of computational experiments show a substantial profit increase of the proposed heuristic over Yang's algorithm. Sensitivity analysis indicates that some input variables impact the profit increase significantly.