• 대한지구과학교육학회지
• /
• 제7권1호
• /
• pp.54-63
• /
• 2014

This study explored the effect of using the inquiry-based science writing heuristic approach in class on metacognition and scientific creativity to enhance the ability of solving problems in science classrooms of elementary students. The results of this study were as follows. First, the science writing heuristic had a positive influence on the usage of metacognition necessary for learners to solve the problem with science. Second, the science writing heuristic contributed to the improvement of scientific creativity. In the process of inquiry-based approach, learners used scientific knowledge to come up with ideas and produce outcomes, therefore they could seek sanswers to scientific problems for themselves. Third, the science writing heuristic produced a positive awareness of science process skill because learners had more opportunities to think on their own than an existing passive class. In conclusion, this study found that the inquiry-based science writing heuristic approach encouraged learners to do inquiring activities in school classrooms, therefore contributing to the application of metacognition and the improvement of scientific creativity.

• 한국전자거래학회:학술대회논문집
• /
• 한국전자거래학회 2005년도 e-Biz World Conference 2005
• /
• pp.195-200
• /
• 2005

As the workflow systems are becoming complex and obscure, there are discrepancies between actual workflow process and designed process. Therefore, we have developed techniques for discovering workflow models. The starting point for such techniques is a so-called 'workflow log' containing information about the workflow process as it is actually being executed. This paper presents an algorithm of workflow process mining based on heuristic approach from the workflow log, which can be happen to business process system.

• 한국경영과학회지
• /
• 제32권1호
• /
• pp.53-60
• /
• 2007

We consider the discrete-time $Geo^x/G/1$ queues under N-policy with multiple vacations (a single vacation) and setup time. In this queueing system, the server takes multiple vacations (a single vacation) whenever the system becomes empty, and he begins to serve the customers after setup time only if the queue length is at least a predetermined threshold value N. Using the heuristic approach, we derive the mean waiting time for both vacation models. We demonstrate that the heuristic approach is also useful for the discrete-time queues.

• 한국산업정보학회논문지
• /
• 제29권1호
• /
• pp.49-62
• /
• 2024

본 연구는 국내 모바일폰 산업을 위한 지속가능한 폐쇄루프 공급망 (Sustainable closed-loop supply chain: SCLSC) 네트워크 모델을 제안한다. 제안된 SCLSC 네트워크 모델의 지속 가능성을 위해 경제적, 환경적, 사회적 요인들이 각각 고려된다. 이들 세 가지 요인들은 SCLSC 네트워크 모델의 각 단계에서 고려되는 설비의 구축 및 운영으로부터 발생하는 총비용 최소화, CO₂ 방출 총량 최소화, 사회적 영향력 최대화를 목표로 한다. 이러한 목표들은 SCLSC 네트워크의 모델링 단계에서 각각 개별적인 목적함수로 고려되어야 하기 때문에 SCLSC 네트워크 모델은 다목적 최적화 문제로 간주할 수 있다. SCLSC 네트워크 모델은 수리모델을 사용하여 표현되며, 혼합형 메타휴리스틱 접근법을 수리모델에 적용하여 그 해를 구한다. 수치실험에서는 제안된 혼합형 메타휴리스틱 접근법의 수행도가 기존의 메타휴리스틱 접근법들의 수행도와 비교된다. 실험결과는 본 연구에서 제안된 혼합형 메타휴리스틱 접근법이 기존의 메타휴리스틱 접근법들과 비교하여 더 뛰어난 수행도를 보여주는 것을 알 수 있다.

• International Journal of Ocean System Engineering
• /
• 제3권1호
• /
• pp.22-32
• /
• 2013

A heuristic physical theory of diffraction (PTD) for an acoustic impedance wedge is proposed. This method is based on Ufimtsev's three-dimensional PTD, which is derived for an acoustic soft or hard wedge. We modify the original PTD according to the process of physical optics (or the Kirchhoff approximation) to obtain a 3D heuristic diffraction model for an impedance wedge. In principle, our result is equivalent to Luebbers' model presented in electromagnetism. Moreover, our approach provides a useful insight into the theoretical basis of the existing heuristic diffraction methods. The derived heuristic PTD is applied to an arbitrary impedance polygon, and a simple PTD formula is derived as a supplement to the physical optics formula.

• 산업경영시스템학회지
• /
• 제5권6호
• /
• pp.41-48
• /
• 1982

This paper analyzed md developed flow - shop sequencing heuristic method. The essence of the heuristic approach is in the application of selective routine that reduce the size of a problem. The advantages of this approach are consistency. Speed, endurance and the ability to cope with more data and larger systems than is humanly possible, In recent years many heuristic procedures have been suggested for the flow - shop sequencing problem. Although limited comparisons of these procedures have been made, a full scale test and evaluation have not been reported previously. The maximum flow - time criterion is selected as the evaluation criterion is selected as the evaluation criterion of flow - shop's efficiency. The author evaluated these 3 heuristic method's performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow - time than the original methods.

• 한국산학기술학회논문지
• /
• 제7권1호
• /
• pp.89-95
• /
• 2006

공급사슬망에서 분산되어있는 제조시스템에 대한 생산 계획수립은 공급사슬관리의 주요 연구분야 중의 하나이다. 본 논문은 공급사슬망에서 자원제약을 갖는 다단계 다품목 로트사이즈 결정 문제(Multi-Level, multi-item Capacitated Lot Sizing Problem: MLCLSP)를 위한 알고리즘을 제시한다. MLCLSP는 MIP(mixed integer program) 문제에 해당한다. 제안된 알고리즘은 휴리스틱과 최적화 패키지인 LINGO를 이용해 서로 반복적인 방식으로 해를 풀어나가는 혼성적인 성격을 갖는다. 휴리스틱을 이용하여 정수형 변수를 결정한 후, 얻게 되는 LP(linear program) 문제를 LINGO를 이용하여 해를 개선해 나가는 방식을 기본으로 한다. 본 논문에서는 탐색 휴리스틱 기법으로 임의 재시작 타부탐색 알고리즘을 제시한다. 다양한 시나리오의 실험을 통해 제안된 알고리즘들의 성능을 평가한다.

• 경영과학
• /
• 제20권1호
• /
• pp.141-148
• /
• 2003

Vehicle routing problem Is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing problem. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COHSOAL can be a good possible approach to solve the vehicle routing problem.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.15-15
• /
• 2003

We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

• 전자공학회논문지B
• /
• 제30B권11호
• /
• pp.84-92
• /
• 1993

Calibration of Engine models is a painstaking process but very important for successful application to automotive industry problems. A combined heuristic and machine learning approach has therefore been adopted to improve the efficiency of model calibration. We developed an intelligent calibration program called ICALIB. It has been used on a daily basis for engine model applications, and has reduced the time required for model calibrations from many hours to a few minutes on average. In this paper, we describe the heuristic control strategies employed in ICALIB such as a hill-climbing search based on a state distance estimation function, incremental problem solution refinement by using a dynamic tolerance window, and calibration target parameter ordering for guiding the search. In addition, we present the application of amachine learning program called GID3*for automatic acquisition of heuristic rules for ordering target parameters.