• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.263-278
• /
• 2004

This paper reviews dynamic programming (DP), surveys approximate solution methods for it, and considers their applicability to process control problems. Reinforcement Learning (RL) and Neuro-Dynamic Programming (NDP), which can be viewed as approximate DP techniques, are already established techniques for solving difficult multi-stage decision problems in the fields of operations research, computer science, and robotics. Owing to the significant disparity of problem formulations and objective, however, the algorithms and techniques available from these fields are not directly applicable to process control problems, and reformulations based on accurate understanding of these techniques are needed. We categorize the currently available approximate solution techniques fur dynamic programming and identify those most suitable for process control problems. Several open issues are also identified and discussed.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.719-728
• /
• 2012

In this paper, we develop a numerical method to solving an optimal control problem, which is governed by a parabolic partial differential equations(PDEs). Our approach is to approximate the PDE problem to initial value problem(IVP) in $\mathbb{R}$. Then, the homogeneous part of IVP is solved using semigroup theory. In the next step, the convergence of this approach is verified by properties of one-parameter semigroup theory. In the rest of paper, the original optimal control problem is solved by utilizing the solution of homogeneous part. Finally one numerical example is given.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.571-577
• /
• 2017

Through the 2015 Revised Curriculum, programming education is introduced into the elementary school regular curriculum as part of the software education. Effective teaching & learning methods can be presented through an analysis of the effects of programming education on the problem-solving abilities. In this paper, students were divided into two groups according to their academic achievement, a learning program was developed for five times of implementation using the entry and the sensor board for the entry, and classes to which it was applied were conducted. Before and after the classes, a problem-solving test tool was used to measure and analyze the changes in Gamma waves and EEG concentration indicators. As a result, the gamma waves and the concentration indices of the students in the group with high academic achievement showed a tendency to be improved through the programming lessons, and those of the students in the group with poor academic achievement showed no such tendency. Through this, the necessity of the level-specific programming education in consideration of students' academic abilities was suggested.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.11-17
• /
• 2010

In this paper, we propose a recommendation system for supporting self-directed programming language education. The system is a recommendation system using collaborative filtering based on learners' level and stage. In this study, we design a recommendation system which uses collaborative filtering based on learners' profile of their level and correlation profile between learning topics in order to increase self-directed learning effects when students plan their learning process in e-learning environment. This system provides a way for solving a difficult problem, that is providing programming problems based on problem solving ability, in the programming language education system. As a result, it will contribute to improve the quality of education by providing appropriate programming problems in learner"s level and e-learning environment based on teaching and learning method to encourage self-directed learning.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.459-467
• /
• 2012

In this work, we develop an instructional method in which students create 3D animations based on problem-solving techniques and computational thinking. The educational, easy-to-learn programming environment/language called "Alice 2.3", which supports story-telling, is used for the delivery of the instructional method. Unlike typical 3D animation instructional methods using command-based demonstrations and/or 3D animation tools, learners engage in a group project in which they develop a story and solve problems by creativity, computational thinking and reasoning skills. Then they develop animations based on the story by programming with Alice. The analysis based on the collected data showed that learners had to put much effort while working on the project, but their critical-thinking skills were improved. It also showed they were more involved and their interests were heightened in developing animation through programming.

• Structural Engineering and Mechanics
• /
• v.6 no.8
• /
• pp.857-870
• /
• 1998

This paper deals with a special class of inverse problems in discrete structural plasticity involving the identification of elastic limits and hardening moduli on the basis of information on displacements. The governing equations lead naturally to a special and challenging optimization problem known as a Mathematical Program with Equilibrium Constraints (MPEC), a key feature of which is the orthogonality of two sign-constrained vectors or so-called "complementarity" condition. We investigate numerically the application of two simple algorithms, both based on the use of the general purpose nonlinear programming code CONOPT accessed via the GAMS modeling language, for solving the suitably reformulated problem. Application is illustrated by means of two numerical examples.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.8
• /
• pp.1898-1909
• /
• 1993

In this paper, a convenient scheme for solving multi-objective optimization problems including fuzzy information in both objective functions and constraints is presented. At first, a multi-objective problem is converted into single objective problem based on the norm method, and a merbership function is constructed by selecting its type and providing the parameters defined by the norm method. Finally, this fuzzy programming problem is converted into an ordinary optimization problem which can be solved by usual nonlinear programming techniques. With this scheme, a designer can conveniently obtain pareto optimal solutions of a fuzzy system only by providing some parameters corresponding to the importance of the objectiv functions. Proposed scheme is simple and efficient in treating multi-objective fuzzy systems compared with and method by with membership function value is provided interactively. To show the validity of the scheme, a simple 3-bar truss example and optimal cutting problem are solved, and the results show that the scheme is very useful and easy to treat multi-objective fuzzy systems.

• Journal of Korean Port Research
• /
• v.10 no.2
• /
• pp.7-15
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. A berth can be assigned to incoming vessels and operated in tow different ways: as a common user berth, as a preference berth. A common user berth is a berth that any ship calling at a port may be permitted to use according to her time of arrival and to priorities as determined by the port authority. In this paper, we concerned with various types of mathematical programming models for a berth assignment problem to achive an efficient berth operation. In this paper, we focus on a reasonable berth assignment programming in a public container terminal in consideration of trade-off between server and user. We propose a branch and bound algorithm & heuristic algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) with which the trade-off between servers and users can be considered. The berth assignment problem is formulated by min-max and 0-1 integer programming and developed heuristic algorithm to solve the problem more easily instead of branch and bound method. Finally, we gave the numerrical solutions of the illustrative examples.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.81-84
• /
• 2003

The ability to determine the optimal frequencies and offsets for independent and unrestricted ordering cycles for multiple items can be very valuable for managing storage capacity constrained facilities in a supply chain. The complexity of this problem has resulted in researchers focusing on more tractable surrogate problems that are special cases of the base problem. Murthy et al. (European Journal of Operation Research 2003) developed insights leading to solution of the original problem and present a heuristic for offsetting independent and unrestricted ordering cycles for items to minimize their joint storage requirements. However, their study cannot find optimal solution due to the Greedy Heuristic solution procedure. In this paper, we present a complete procedure to find the optimal solution for the model with a integer programming optimization approach and genetic algorithm. Numerical examples are included to compare each model with that of Murthy et at. Research of this type may prove useful in solving the more general problem of selecting order policies to minimize combined holding, ordering, and storage costs.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.116-127
• /
• 2008

In the $7^{th}$ education curriculum, computer education curriculum in the elementary and secondary schools is composited into the contents for the use of computers so that there are some limitations in teaching students the abilities for solving various problems of several areas using computers. Recently, the research has done to change the computer education curriculum for enhancing creativity and problem solving ability required by the future education. The contents of the main subject for enhancing them is of computer programming, however, there was not enough research on systematic programming education curriculum for leading to motivating learners and enhanced knowledge transfer to those learners. In this paper, we analysis the contents mathematics education curriculum with consecutive contents and in tight connection with computer education and then extract its programming related elements. Based on those, we propose a programming education curriculum with which we can teach systematically computer programing according to continual and systematic guidance in the elementary and secondary schools. And we develop a teaching model and learning guidance for teaching students programming methods with the computer programming education curriculum proposed in this paper.