• 대한수학교육학회지:수학교육학연구
• /
• 제20권2호
• /
• pp.185-202
• /
• 2010

본 연구는 중등수학교육에서 도구화된 CAS에 기반한 최적화 문제해결 활동을 통해 CAS가 교육과정 내용제시 순서에 영향을 줄 수 있는지를 분석하기 위해 설계되었다. 이를 위하여 본 연구자는 CAS를 활용한 최적화 문제해결 활동을 구안하였으며 3개월간의 CAS 활용 수업 경험이 있으나 아직 미적분학을 접해 본 적이 없는 고등학교 2학년 7명을 선정하여 총 9차시의 수업을 실시하고, 수업녹화자료와 면담을 통해 학생들의 활동을 분석하였다. 분석 결과, 학생들은 CAS를 이용하여 미 학습된 교육내용인 미분과 삼차방정식, 무리방정식의 해구하기와 그래프 분석이 포함된 최적화 문제해결활동을 수준 높게 다룰 수 있는 것으로 나타나 CAS가 교육과정 내용제시 순서에 영향을 줄 수 있음을 확인할 수 있었다.

• 한국건축시공학회지
• /
• 제12권6호
• /
• pp.664-673
• /
• 2012

Determining the layout of temporary facilities that support construction activities at a site is an important planning activity, as layout can significantly affect cost, quality of work, safety, and other aspects of the project. The construction site layout problem involves difficult combinatorial optimization. Recently, various artificial intelligence(AI)-based algorithms have been applied to solving many complex optimization problems, including neural networks(NN), genetic algorithms(GA), and swarm intelligence(SI) which relates to the collective behavior of social systems such as honey bees and birds. This study proposes a site facility layout optimization algorithm based on self-organizing maps(SOM). Computational experiments are carried out to justify the efficiency of the proposed method and compare it with particle swarm optimization(PSO). The results show that the proposed algorithm can be efficiently employed to solve the problem of site layout.

• International Journal of Contents
• /
• 제16권4호
• /
• pp.26-38
• /
• 2020

Determining the optimal levels of the technical attributes (TAs) of a product to achieve a high level of customer satisfaction is the main activity in the planning process for quality function deployment (QFD). In real applications, the number of customer requirements for developing a single product is quite large, and the number of converted TAs is also high so the size of the house of quality (HoQ) becomes huge. Furthermore, the TA levels are often discrete instead of continuous and the product market can be divided into several market segments corresponding to the number of HoQ, which also unacceptably increases the size of the QFD optimization problem and the time spent on making decisions. This paper proposed a genetic algorithm (GA) solution approach to finding the optimum set of TAs in QFD in the above situation. A numerical example is provided for illustrating the proposed approach. To assess the computational performance of the GA, tests were performed on problems of various sizes using a fractional factorial design.

• 대한수학교육학회지:학교수학
• /
• 제11권3호
• /
• pp.527-546
• /
• 2009

본 연구는 CAS가 도입된 이후의 우리나라 수학교육에 대비하여 고등학교 수학활동에서 CAS의 도구발생 과정을 통찰하고, 중등수학교육에서 도구화된 CAS의 활용 가능성을 탐색하기 위해 설계되었다. 이를 위하여 본 연구자는 CAS에 기반 한 개념중심 수학과제 학습과 문제해결을 각각 고안하였으며 고등학교 1학년생 7명을 대상으로 총 12차시의 수업을 실시하고 수업녹화자료와 면담을 통해 학생들의 활동을 분석하였다. 분석결과 학생들은 CAS를 이용하여 수준 높은 응용문제를 다룰 수 있는 것으로 나타나 CAS가 교육과정 내용수준에 영향을 줄 수 있음을 확인할 수 있었고, 또 도구화된 CAS에 기반 한 무리방정식 문제해결활동을 통해 CAS가 교육과정의 제시 순서에 영향을 줄 수 있음을 발견하였다. 이 연구는 고등학교 수학교육에서 CAS의 도구발생을 분석하여 사례를 제공함으로써 CAS가 도입된 이후의 우리나라 수학교육에 대비한 기초연구가 될 것이다.

• 한국정밀공학회지
• /
• 제18권4호
• /
• pp.176-181
• /
• 2001

Due to the increasing complexity to handle conflicts and interruptions caused by resource failures and rush orders, shop control is obliged to redesign its organization according to the changing demands of the manufacturing control. These demands are leading to the development of decentralization and gradually to their permanent optimization. As a result, a powerful modeling method which can be adapted efficiently is required. The use of agent theory enables specific modeling of the relevant shop planning activities. The planning activities are modeled in a so-called activity modeling through the definition of three classes of agents; Plan Agent, Manufacturing System Agent and Control Agent as well as the description of the cooperative relationship among these agents. On the basis of the activity model the agent-based shop control method is developed which emphasizes the distributed problem-solving and the cooperation with relevant agents.

• 대한산업공학회지
• /
• 제30권3호
• /
• pp.190-196
• /
• 2004

In this paper, we address a layout design problem, PTL[3], for determining an optimal 3-class-based dedicated linear storage layout in a class of unit load storage systems. Our objective is to minimize the expected single command travel time. We analyze PTL[3] to derive a fundamental property that an optimal solution to PTL[3] is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. Using the property and partial enumeration, we construct an efficient exact algorithm with O $(n\;{\lceil}\;log\;n\;{\rceil}\;)$ for solving PTL[3].

• 대한산업공학회지
• /
• 제29권3호
• /
• pp.222-229
• /
• 2003

In this paper, we address a layout design problem, PTN[2], for determining an appropriate 2-class-based dedicated storage layout in a class of unit load storage systems. Our strong conjecture is that PTNI2] is NP-hard. Restricting PTN[2], we provide three solvable cases of PTN[2] in which an optimal solution to the solvable cases is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. However, we show with a counterexample that a solution based on the PAI-non increasing ordering does not always give an optimal solution to PTN[2]. Utilizing the derived properties, we construct an effective heuristic algorithm for solving PTN[2] based on a PAI-non increasing ordering with performance ratio bound. Our algorithm with O($n^2$) is effective in the sense that it guarantees a better class-based storage layout than a randomized storage layout in terms of the expected single command travel time.