• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.50.2-50
• /
• 2001

Optimal control problems are notoriously difficult to solve either analytically or numerically except for limited cases of having simple dynamics. Evolutionary programming is a promising method of solving various optimal control problem arising in practice since it does not require the expression of Lagrange´s adjoint system and that it can easily implement the inequality constraints on the control variable, In this paper, evolutionary programming is combined with spline method, so the smoother control profile and the Jumping times could be obtained. The optimal profiles obtained by the proposed method are compared with exact solution if it is available. With more complicated model equation, the proposed method showed better performance than other researchers´. It is demonstrated that the evolutionary programming with spline method can ...

• Archives of design research
• /
• v.9
• /
• pp.801-810
• /
• 1994

Design Problems are often both multidimensional and highly interactive. Very rarely does any part of a designed thing serve only one purpose. The activity of designing is thus a goal-directed activity and normally a goal-directed problem-solving activity. This means, problem solving is finding a way to get from some initial situation to a desired goal. Designers are transforming agents within a society whose goals are to improve the human condition through physical metamorphosis. Many theorist have agreed that designing involves problem solving or decision making. Accordingly evaluation plays an essential role in design activity. The evaluation factors include all attributes that have levels specified by quantitative and qualitative objectives Alternatives in multi-objective decision prOblems generally possess numerous attributes by which they can be described and compared. The evaluation factors include all attributes that have levels specified by quantitative and qualitative objectives. However since qualitative factors are difficult to quantify as numeral estimates, these factors have tended to be ignored without regard for their importance to human content. We adapted the Accumulative Evaluation Model as an evaluation algorithm for IDES. Industrial Design Evaluation System (IDES) consists of 3 major modules ( 1 Design Element, 2.Matrix, 3.Evaluation). It is intended to be an aid for design evaluation. The luther thinks IDES is a new design evaluation approach which could provide effective rating of design values to make value judgements. It is an attempt to provide industrial designers with access to design evaluation. The author's aim is to produce an Object-Oriented Evaluation System which can guide the designers and decision makers under complex design projects. It uses\ulcorner an Object-Oriented Programming for this prototype, Because of managing complexity (Flexibility and Reusability) and improving productivity(Extensibility & Maintainability and Programming by User) in software development process. The author has chose the C++ because it is a hybrid, rather than pure Object-Oriented Language.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.11
• /
• pp.787-794
• /
• 2019

In this paper, a Mixed Integer Linear Programming(MILP) approach for solving optimal Weapon-Target Assignment(WTA) problem of multiple dissimilar Closed-In Weapon Systems (CIWS) is proposed. Generally, WTA problems are formulated in nonlinear mixed integer optimization form, which often requires impractical exhaustive search to optimize. However, transforming the problem into a structured MILP problem enables global optimization with an acceptable computational load. The problem of interest considers defense against several threats approaching the asset from various directions, with different time of arrival. Moreover, we consider multiple dissimilar CIWSs defending the asset. We derive a MILP form of the given nonlinear WTA problem. The formulated MILP problem is implemented with a commercial optimizer, and the optimization result is proposed.

• Journal of The Korean Association of Information Education
• /
• v.15 no.1
• /
• pp.85-91
• /
• 2011

Programming training in informatics education have the means that algorithm design and problem solving. However, Because learning and using programming tools that should be done first, elementary school students learning the programming tools that are interested in the process has been reduced. But programming with using an Educational Programming Language(EPL) can show results directly and coding with a drag & drop method that keeps the elementary students' interests for programming. Now that, the students are possible to enhance their creativity and reasoning skills. Therefore, through the result of this study show how to apply the EPL in the elementary information classes and comparing with before this study and after the study, we analyzed to applicate prosperity of EPL.

• Journal of The Korean Association of Information Education
• /
• v.14 no.3
• /
• pp.301-310
• /
• 2010

In this paper, to instruct elementary programming concepts based on flowchart programming for elementary school students, we proposed sensor-based elementary robot programming PBL problems using line-tracer robots. Proposed PBL problems are designed to have various correct-answer algorithms. For this purpose, we present PBL-based robot programming instruction steps. Through applying the proposed sensor-based PBL problems using line-tracer robots, experimental results are analyzed in views of the problem-solving ability and suitability of allocating degrees of difficulties to the proposed elementary robot programming problems.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.680-689
• /
• 2013

In recent, much attention has been paid to the educational serious games that provide both fun and learning effects. However, most educational games have been targeted at the infants and children, and it is still hard to use such games in higher education. On the contrary, this paper aims to develop an educational game for teaching mathematical programming to the undergraduates. It is well known that most puzzle games can be transformed into associated optimization problem and vice versa, and this paper proposes a simple educational game based on the subset sum problem. This game enables the users to play the puzzle and construct their own mathematical programming model for solving it. Moreover, the users are provided with appropriate instructions for modeling and their models are evaluated by using the data automatically generated. It is expected that the educational game in this paper will be helpful for teaching basic programming models to the students in industrial engineering or management science.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.450-452
• /
• 2021

Recently, as interest in programming and artificial intelligence has increased, software education has been compulsory from elementary school. In order to achieve this goal of programming education, it is necessary to basically establish a lab environment suitable for students and teachers. However, there is a problem with performance problems caused by old computers in the lab environment of the school, and there is a problem that students must purchase and use the existing online platform while implementing an algorithm contest program in which students access and evaluate their problem-solving ability at the same time. Therefore, in this paper, to solve this problem, we propose a web-based online practice environment and algorithm contest scoring system using React and Spring boot. Through this, it is believed that even in a computer with low specifications, programming can be studied using only a web browser.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.67-78
• /
• 1992

MODM (multiobjective decision-making) problem is very complex system for the analyst. The problem is more complex if the goals of each of the objective functions are expressed imprecisely. It requires suitable MODM method to deal with imprecisions. Therefore, we present a new interactive fuzzy decision making method for solving multiobjective nonlinear programming problems by assuming that the decision maker (DM) has imprecise goals that assume fuzzy linguistic variable for each of the objective functions. The imprecise goals of the DM are quantified by eliciting corresponding membership functions through the interactive with the DM out of six membership functions. After determining membership functions, in order to generate the compromise or satisficing solution which is .lambda.-pareto optimal, .lambda.-max problem is solved. The higher degree of membership is chosen to satisfy imprecise goals of all objective functions by combining the membership functions. Then, the values are the compromise or satisficing solution. On the basis of the proposed method, and interactive computer programming is written to implement man-machine interactive procedures. Our programming is a revised version of sequential unconstrained minimization technique. Finally, a numerical example illustrates various aspects of the results developed in this paper.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.485-498
• /
• 1996

For a tree T rooted at a concentrator location in a telecommunication system, we assume that the capacity H for the concentrator is given and a profit $c_v$, and a demand $d_v$, on each node $\upsilon$ of T are also given. Then, the capacitated subtree of a tree problem (CSTP) is to find a subtree of T rooted at the concentrator location so as to maximize the total profit, the sum of profits over the subtree, under the constraint satisfying that the sum of demands over the subtree does not exceed H. In this paper, we develop a pseudopolynomial-time algorithm for CSTP, the depth-first dynamic programming algorithm. We show that a CSTP can be solved by our algorithm in $\theta$ (nH) time, where n is the number of nodes in T. Our algorithm has its own advantage and outstanding computational performance incomparable with other approaches such as CPLEX, a general integer programming solver, when it is incorporated to solve a Local Access Telecommunication Network design problem. We report the computational results for the depth-first dynamic programming algorithm and also compare them with those for CPLEX. The comparison shows that our algorithm is competitive with CPLEX for most cases.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.4
• /
• pp.513-522
• /
• 2019

We calculate the benefit of distributed combined heat power generators from avoiding a transmission expansion cost by building distributed generators near electricity demand centers. We determine a transmission expansion plan by solving a mixed integer linear problem, where we modify capacities of existing transmission lines and build new transmission lines. We calculate the benefit by comparing the sum of generation and transmission expansion costs with or without distributed generators through two simulation frames. In the first frame, for the current demand, we substitute existing distributed generators for non-distributed generators and measure an additional cost to balance the generation and demand. In the second frame, for increased future demand, we compare the cost to invest only in distributed generators to the cost to invest only in non-distributed generators. As a result, we show that the distributed generators have at least 5.8 won/kWh of the benefit from avoiding the transmission expansion cost.