수리 문제와 개념 문제 사이의 유도 효과

노태희 ( Tae Hee Noh ),강훈식 ( Hun Sik Kang ),전경문 ( Kyung Moon Jeon ) 한국과학교육학회 2004 한국과학교육학회지 Vol.24 No.2

This study investigated whether algorithmic problem solving and conceptual problem solving influenced each other or not. Four classes of 12th grade (N=112) that are equal in prior achievement were randomly assigned to group AC (Algorithmic-Conceptual problem) and group CA (Conceptual-Algorithmic problem). Students of group AC solved the conceptual problems after learning the related algorithmic problems, and those of group CA solved the same problems in reverse order. The results revealed that learning the algorithmic problems improved students` ability to solve the related conceptual problems, but learning the conceptual problems did not help students solve the related algorithmic problems. Regarding the confidence on problem solving, learning the algorithmic problems had little effect on the related conceptual problems. Learning the conceptual problems also had little effect on students` confidence on solving of the related algorithmic problems.

화학 문제 유형에 따른 고등학교 학생들의 수리 문제 해결력과 개념 이해도 비교

노태희,강훈식,전경문 한국과학교육학회 2005 한국과학교육학회지 Vol.25 No.2

본 연구에서는 세 가지 유형의 문제(수리 문제, 그림 문제, 문장 문제)를 이용하여 화학 수리 문제 해결력(수리 문제)과 개념 이해도(그림 문제, 문장 문제)를 비교하고 문제 유형에 대한 친숙도와 자신의 답에 대한 자신감 및 선호하는 문제 유형을 조사하였다. 경기도에 위치한 두개의 비평준화 고등학교 3학년 학생들 중 대학수학능력시험의 선택 과목으로 화학을 선택한 학생들(N=228)을 선별하여 화학 문제 해결력 검사와 문제 유형에 대한 친숙도, 자신감, 선호도 검사를 실시하였다. 연구 결과, 학생들의 수리 문제 성공률이 개념 문제(그림 문제, 문장 문제) 보다 유의미하게 높은 것으로 나타났다. 또한, 학생들은 그림 문제나 문장 문제보다 수리 문제에 더 친숙하다고 응답했다. 자신감에서는 학생들이 문장 문제보다 수리 문제와 그림 문제에 대해 더 자신 있어 하는 것으로 나타났으며, 선호도에서는 그림 문제보다 수리 문제와 문장 문제를 더 선호하는 것으로 나타났다. We compared algorithmic problem solving and conceptual understanding of chemistry with three types (algorithmic, pictorial- and wordy-formatted conceptual) of problems. The familiarity, confidence, and preference to the three type of problems were also examined. The chemistry problem solving ability test was administered to 228 students from two top high schools in the province of Gyeonggi who were preparing the chemistry examination among the four optional subjects (biology, chemistry, earth science, physics) for enter university. After administrating the chemistry problem solving ability test, the degree of familiarity to some problems and the degree of confidence of their answers in a Likert scale were asked to the students. Besides, the students were asked to place preference to the type of problems in order. The students scored better on the algorithmic problems than on the conceptual problems (pictorial and wordy problems), and were also most familiar with the algorithmic problems. The students were more confident of their answers on both of types pictorial and algorithmic problems, and preferred pictorial problems rather than both of types algorithmic and wordy problems.

Recent advances in hybrid evolutionary algorithms for multiobjective manufacturing scheduling

Gen, Mitsuo,Zhang, Wenqiang,Lin, Lin,Yun, YoungSu Elsevier 2017 COMPUTERS & INDUSTRIAL ENGINEERING Vol.112 No.-

<P><B>Abstract</B></P> <P>In real manufacturing systems there are many combinatorial optimization problems (COP) imposing on more complex issues with multiple objectives. However it is very difficult for solving the intractable COP problems by the traditional approaches because of NP-hard problems. For developing effective and efficient algorithms that are in a sense “good,” <I>i.e.</I>, whose computational time is small as within 3min, we have to consider three issues: quality of solution, computational time and effectiveness of the nondominated solutions for multiobjective optimization problem (MOP).</P> <P>In this paper, we focus on recent <I>hybrid evolutionary algorithms</I> (HEA) to solve a variety of single or multiobjective scheduling problems in manufacturing systems to get a best solution with a smaller computational time. Firstly we summarize <I>multiobjective hybrid genetic algorithm</I> (Mo-HGA) and <I>hybrid sampling strategy-based multiobjective evolutionary algorithm</I> (HSS-MoEA) and then propose <I>HSS-MoEA combining with differential evolution</I> (HSS-MoEA-DE). We also demonstrate those hybrid evolutionary algorithms to <I>bicriteria automatic guided vehicle</I> (B-AGV) dispatching problem, <I>robot-based assembly line balancing problem</I> (R-ALB), <I>bicriteria flowshop scheduling problem</I> (B-FSP), multiobjective scheduling problem in <I>thin-film transistor-liquid crystal display</I> (TFT-LCD) module assembly and <I>bicriteria process planning and scheduling</I> (B-PPS) problem. Also we demonstrate their effectiveness of the proposed hybrid evolutionary algorithms by several empirical examples.</P> <P><B>Highlights</B></P> <P> <UL> <LI> Various real manufacturing systems are considered. </LI> <LI> Multiobjective scheduling problems in manufacturing systems are considered. </LI> <LI> Recent hybrid evolutionary algorithms are proposed. </LI> </UL> </P>

무향 Rural Postman Problem 해법을 위한 유전 알고리즘에서 그래프 변환에 의한 디코딩 알고리즘

강명주(Kang Myung-Ju) 한국컴퓨터정보학회 2007 韓國컴퓨터情報學會論文誌 Vol.12 No.2

무향 Rural Postman Problem(URPP)은 주어진 네트워크에서 특정 아크를 적어도 한 번씩 경유하는 최단 경로를 찾는 문제이다. URPP는 실생활의 다양한 문제를 풀기 위한 기본적인 네트워크 문제 중에 하나이며 NP-Complete 문제로 알려져 있다. URPP는 아크 중심의 문제로 아크의 라우팅 방향을 고려하여야 하며, 노드 중심의 문제인 TSP(Traveling Salesman Problem) 해법을 그대로 적용하는 것은 힘들다. 본 논문에서는 URPP 해법을 위한 유전 알고리즘에서 그래프 변환에 의한 디코딩 방법을 제안한다. 즉, 아크 중심의 그래프를 노드 중심의 그래프로 변환함으로써 아크의 방향에 상관없이 전체 라우팅 경로를 구할 수 있도록 하였다. 실험을 통해 제안 알고리즘과 기존 알고리즘의 성능을 비교하였다. 실험 결과에서 제안 알고리즘은 기존 알고리즘보다 좋은 결과를 얻을 수 있음을 알 수 있었다. Undirected Rural Postman Problem(URPP) is a problem that finds a shortest tour traversing the given arcs at least once in a given network. The URPP is one of the basic network problems used in solving the various real-world problems. And it is known as NP-Complete. URPP is an arc-oriented problem that the direction of a tour in an arc has to be considered. Hence, in URPP, it is difficult to use the algorithm for Traveling Salesman Problem (TSP), which is a node-oriented problem, directly. This paper proposes the decoding algorithm using graph transformation in the genetic algorithm for URPP. That is, you can find the entire tour traversing without considering the direction of arcs by transforming the arc-oriented graph into the node-oriented graph. This paper compares the performances of the proposed algorithm with an existing algorithm. In the simulation results, the proposed algorithm obtained better than the existing algorithm.

컴퓨터교과교육 : 분할 정복 알고리즘 학습이 창의적 문제 해결에 미치는 효과

김윤영 ( Yoon Young Kim ),김영식 ( Yung Sik Kim ) 한국컴퓨터교육학회 2013 컴퓨터교육학회 논문지 Vol.16 No.2

정보 교과는 정보과학적 사고와 원리를 통해 창의적 문제해결력 함양을 교육목표로 하며, 문제 해결 방법과 절차 단원을 통하여 알고리즘 학습을 강조한다. 알고리즘 학습이 문제해결력 향상에 효과가 있다는 선행연구들을 바탕으로 창의적 문제해결력 향상에도 효과를 입증하는 연구들이 이루어지고 있다. 그러나 이러한 연구들이 알고리즘 내용보다는 CPS와 같은 교수학습 모형이나 콘텐츠에 의존하고 있기 때문에 알고리즘 학습의 중요성이 상대적으로 약해질 수 있다. 본 연구는 일반적인 문제해결과정과 창의적 문제해결 과정이 동일하다는 관점에서 알고리즘 학습이 창의적 문제해결력 향상에 효과가 있음을 검증한다. 이를 위하여 일반적인 사고 가운데 창의적인 사고로 간주되는 유추 추론(analogical reasoning)에 대하여 살펴보고, 유추 추론에 필요한 바탕 지식으로 분할 정복 알고리즘을 선택하였다. 퀵 정렬 알고리즘 학습 실험 결과, 분할 정복 알고리즘의 원리 학습한 실험집단과 알고리즘의 절차만 학습한 통제집단이 퀵 정렬 문제를 해결하는 비율에는 차이가 없었으나, 탐색 문제에서는 실험집단이 통제집단 보다 이진 탐색을 사용하는 비율이 더 높았다. 이는 분할 정복과 같은 추상적인 원리를 포함하는 알고리즘 학습이 새로운 영역의 문제를 해결하는 유추 추론에 효과가 있으며, 이는 창의적 문제해결력 향상으로 이어질 수 있음을 의미한다. In secondary education, learning a computer science subject has the purpose to improve creative problem solving ability of students by learning computational thinking and principles. In particular, learning algorithm has been emphasized for this purpose. There are studies that learning algorithm has the effect of creative problem solving based on the leading studies that learning algorithm has the effect of problem solving. However, relatively the importance of the learning algorithm can weaken, because these studies depend on creative problem solving model or special contents for creativity. So this study proves that learning algorithm has the effect of creative problem solving in the view that common problem solving and creative problem solving have the same process. For this, analogical reasoning was selected among common thinking skills and divide-and-conquer algorithm was selected among abstractive principles for analogical reasoning in sorting algorithm. The frequency which solves the search problem by using the binary search algorithm was higher than the control group learning only sequence of sorting algorithm about the experimental group learning divide-and-conquer algorithm. This result means that learning algorithm including abstractive principle like divide-and-conquer has the effect of creative problem solving by analogical reasoning.

An Algorithm for the High-speed Train Multi-leg Load Planning Problem

Dong-jin Noh,Byung-In Kim,Hyunbo Cho,Jun-Seo Park 대한산업공학회 2015 대한산업공학회 추계학술대회논문집 Vol.2015 No.11

This paper considers a load planning problem for a high-speed train called CTX (Cargo Transit eXpress), whose speed is up to 300 km/h. In the problem, a CTX train visits a sequence of predetermined stations and loads and unloads small containers called unit load device (ULD) from the stations. A CTX train has a given number of cars and each of which has available given positions for ULDs. A set of ULDs that are transported by the train is given and each of which has weight and origin and destination stations. Since the train moves fast, the weight balance among the cars and within each car of the train is critical for safety. Furthermore, since the train traverses multiple stations, the weight balance should be kept among all the legs between stations. The problem is to assign ULDs to positions of cars with consideration of load balancing and multiple stations. Thus, this problem is a multi-leg load planning problem, which has not been studied much. Because the problem is NP-hard, a heuristic algorithm is proposed. The computational results show the effectiveness of the proposed algorithm.

Numerical Simulation of Periodic and Oscillatory Problems by Using RK-Butcher Algorithms

Park, Dae-Chul,Gopal, Devarajan,Murugesh, V. The Korea Institute of Convergence Signal Processi 2008 융합신호처리학회 논문지 (JISPS) Vol.9 No.1

본 논문은 주기적 진동 문제를 연구하기 위해 Runge-Kutta(RK)-Butcher 알고리듬이 소개되었다. RK-Butcher 알고리듬을 사용하여 얻어진 시뮬레이션 결과와 고전적인 4차 RK(4) 방법을 통해 얻은 결과들을 제안한 알고리듬의 성능을 확인하기 위하여 몇몇 주기적 진동 문제들의 정확한 해와 비교하였다. RK-Butcher 알고리듬의 시뮬레이션 결과는 항상 문제의 정확한 해 RK(4) 방법보다 더 근접한 결과를 줌이 확인되었다. 정확도 측면에서 RK-Butcher 알고리듬이 RK(4) 방법과 비교해볼 때 우수함을 알 수 있다. 제안한 RK-Butcher 알고리듬은 프로그램 언어로 쉽게 구현할 수 있으며 임의 시간에 종료해도 훌륭한 근사적인 해를 얻을 수 있다. RK-Butcher 알고리듬은 짧은 시간내에 이상적인 정확한 해에 근접한 결과를 주기 때문에 궤도 와 두 물체의 문제를 연구하는데 훌륭한 수치 알고리듬으로 적용 가능하다. In this paper, Runge-Kutta (RK)-Butcher algorithm is proposed to study the periodic and oscillatory problems. Simulation results obtained using RK-Butcher algorithms and the classical fourth order Runge-Kutta (RK(4)) methods are compared with the exact solutions of a few periodic and oscillatory problems to confirm the performance of the proposed algorithm. The simulation results from RK-Butcher algorithms are always found to be very close to the exact solutions of these problems. Further, it is found that the RK-Butcher algorithm is superior when compared to RK(4) methods in terms of accuracy. The RK-Butcher algorithm can be easily implemented in a programming language and a more accurate solution may be obtained for any length of time. RK-Butcher algorithm is applicable as a good numerical algorithm for studying the problems of orbit and two body as it gives the nearly identical solutions.

RK-Butcher알고리듬의 사용에 의한 주기적 진동 문제의 수치적 시뮬레이션

박대철,Devarajan Gopal,V. Murugesh 한국융합신호처리학회 2008 융합신호처리학회 논문지 (JISPS) Vol.9 No.1

In this paper, Runge-Kutta (RK)-Butcher algorithm is proposed to study the periodic and oscillatory problems. Simulation results obtained using RK-Butcher algorithms and the classical fourth order Runge-Kutta (RK(4)) methods are compared with the exact solutions of a few periodic and oscillatory problems to confirm the performance of the proposed algorithm. The simulation results from RK-Butcher algorithms are always found to be very close to the exact solutions of these problems. Further, it is found that the RK-Butcher algorithm is superior when compared to RK(4) methods in terms of accuracy. The RK-Butcher algorithm can be easily implemented in a programming language and a more accurate solution may be obtained for any length of time. RK-Butcher algorithm is applicable as a good numerical algorithm for studying the problems of orbit and two body as it gives the nearly identical solutions. 본 논문은 주기적 진동 문제를 연구하기 위해 Runge-Kutta(RK)-Butcher 알고리듬이 소개되었다. RK-Butcher 알고리듬을 사용하여 얻어진 시뮬레이션 결과와 고전적인 4차 RK(4) 방법을 통해 얻은 결과들을 제안한 알고리듬의 성능을 확인하기 위하여 몇몇 주기적 진동 문제들의 정확한 해와 비교하였다. RK-Butcher 알고리듬의 시뮬레이션 결과는 항상 문제의 정확한 해 RK(4) 방법보다 더 근접한 결과를 줌이 확인되었다. 정확도 측면에서 RK-Butcher 알고리듬이 RK(4) 방법과 비교해볼 때 우수함을 알 수 있다. 제안한 RK-Butcher 알고리듬은 프로그램 언어로 쉽게 구현할 수 있으며 임의 시간에 종료해도 훌륭한 근사적인 해를 얻을 수 있다. RK-Butcher 알고리듬은 짧은 시간내에 이상적인 정확한 해에 근접한 결과를 주기 때문에 궤도 와 두 물체의 문제를 연구하는데 훌륭한 수치 알고리듬으로 적용가능하다.

Modified Genetic Operators for the TSP

Sang-Moon Soak,Yeon-Mo Yang,Hong-Girl Lee,Byung-Ha Ahn 한국항해항만학회 2005 한국항해항만학회지 Vol.29 No.2

For a long time, genetic algorithms have been recognized as a new method to solve difficult and complex problems and the performance of genetic algorithms depends on genetic operators, especially crossover operator. Various problems like the traveling salesman problem, the transportation problem or the job shop problem, in logistics engineering am be modeled as a sequencing problem. This paper proposes modified genetic crossover operators to be used at various sequencing problems and uses the traveling salesman problem to be applied to a real world problem like the delivery problem and the vehicle routing problem as a benchmark problem. Because the proposed operators use parental information as well as network information, they could show better efficiency in performance and computation time than conventional operators.

The Butterfly Algorithm: A Contradiction Solving Algorithm based on Propositional Logic for TRIZ

Jung Suk Hyun,Chan Jung Park 보안공학연구지원센터(IJSEIA) 2016 International Journal of Software Engineering and Vol.10 No.1

Among creative and innovative problem solving algorithms, TRIZ solves difficult problems by finding contradictions of the problems. In TRIZ, there are two types of contradictions. One is a technical contradiction and the other is physial contradiction. A technical contradiction occurs between two desirable functions of a system. We call it a trade-off contradiction. On the other hand, a physical contradiction appears when two opposite properties are required from the same part of a system. In TRIZ, the ARIZ has been developed by Altshuller for reducing trial-and-error while solving problems. It is known as an inventive problem solving. It transforms difficult technical contradictions of a given problem into the corresponding physical contradiction to solve the problem easily. However, ARIZ-85c, the most recent version of the ARIZ, has inefficient and time-consuming features that cause trial-and-errors. In this paper, we propose the Butterfly algorithm based on the Butterfly diagram to reduce trial-and-error features by giving the right solution strategy based on propositional logic when selecting technical contradictions and physical contradictions for a given problem. The Butterfly algorithm can systematically find the solution strategy for the problem, and thus it helps to solve contradictions efficiently.