• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.85-103
• /
• 2005

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.802-809
• /
• 2005

A hybrid genetic algorithm is proposed for the problem of generating laser torch paths to cut a stock plate nested with free-formed parts each having a set of sub-parts. In the problem, the total unproductive travel distance of the torch is minimized. The problem is shown to be formulated as a special case of the standard travelling salesman problem. The hybrid genetic algorithm for solving the problem is hierarchically structured: First, it uses a genetic algorithm to find the cutting path f3r the parts and then, based on the obtained cutting path, sequence of sub-parts and their piercing locations are optimally determined by using a combined genetic and heuristic algorithms. This process is repeated until any progress in the total unproductive travel distance is not achieved. Computational results are provided to illustrate the validity of the proposed algorithm.

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.2
• /
• pp.133-137
• /
• 2023

This study the problem of deposition uniformity observed during Mist-CVD deposition experiments. The TRIZ's ADRIGE algorithm, a problem-solving technique, is utilized to systematically analyze the issue and propose solutions. Through problem and resource analysis, technical contradictions are identified regarding the precursor's volume and its path when it encounters the substrate. To resolve these contradictions, the concept of applying the principle of dimensional change to transform the precursor's three-dimensional path into a one-dimensional path is suggested. The chosen solution involves the design of an enhanced Mist-CVD system, which is evaluated for feasibility and analyzed using computational fluid dynamics. The analysis confirms that the deposition uniformity consistently follows a pattern and demonstrates an improvement in uniformity. The improved Mist-CVD equipment is validated through analysis, providing evidence of its feasibility and yielding satisfactory results.

• Journal of the military operations research society of Korea
• /
• v.23 no.2
• /
• pp.103-119
• /
• 1997

This paper considers the shortest path problem combined with Min-Min-Sum objective for solving the problem of the military logistics. This paper develops a polynomial-time algorithm for the optimal solution. To analyze the real combat situation, the ability time and distance time of communication line are considered. The complexities of algorithm between previous study and the algorithm developed in this paper is presented. Finally we provide a simple example of application with randomly generated problem.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1150-1156
• /
• 2019

This paper explores a model-free value-based approach for solving survival gridworld problem. Survival gridworld problem opens up a challenge involving taking risks to gain better rewards. Classic value-based approach in model-free reinforcement learning assumes minimal risk decisions. The proposed method involves a hybrid on-policy and off-policy updates to experience roll-outs using a modified Q-based update equation that introduces a parametric linear rectifier and motivational discount. The significance of this approach is it allows model-free training of agents that take into account risk factors and motivated exploration to gain better path decisions. Experimentations suggest that the proposed method achieved better exploration and path selection resulting to higher episode scores than classic off-policy and on-policy Q-based updates.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Journal of The Korean Association For Science Education
• /
• v.14 no.1
• /
• pp.85-102
• /
• 1994

The purpose of this study was to analyze students' physics problem solving processes and to find the patterns of their problem spaces when high school and university students solved the physics problems. A total of 51 students in a high school and in two universities participated in this study. Their thinking processes in solving 5 physics problems on electric circuit were recorded by using 'thinking aloud' method and were transferal into protocols. 'The protocols were analyzed by the coding system of problem solving process. One of the major theoretical contributions of the computer simulation approach to problem solving is the idea of problem space. Such a concept of problem space was applied to physics problems on electric circuit in this study, and students' protocols were analyzed by the basic problem spaces which were made up from the item analysis by the researcher. The results are as follows: 1) On the average 4.0 test items among 5 ones were solved successfully by all subjects, and all of the items were solved correctly by only 19 persons among all of them. 2) In regard to the general steps of problem solving process, there was little difference for each item between the good solvers and the poor ones. But according to the degree of difficulty of task there was a good deal of difference. For a complex problem all of 4 steps were used by most of students, but for a simple one only 3 steps except evaluating step were used by most of them. 3) It was found in this study that most of students used mainly the microscopic approach, that is, a method of applying Ohm's law on electric circuit simply and immediately, not using the properties of electric circuits. And also it was observed that most of students used the soloing tom below, that is, a solving path in which they were the first to calculate physical Quantities of circuit elements, before they caught hold of the meaning of the given problem regardless of the degree of difficulty.

• Journal of the Korean Home Economics Association
• /
• v.37 no.1
• /
• pp.91-108
• /
• 1999

The purpose of this study was to investigate the correlation between children's perceptions of interpersonal relations (parents, family, and peers) and those of self, and to examine how the perceptions are related ot problem-solving and social preference. The subjects of this study were 625 children of 5th and 6th grade in 4 primary schools in Taejon City. Results showed positive correlations among four measures of social perceptions (to parents, to family, to peer, and to self). Therefore we have found generalization among children's representations across four interpersonal domains-that is, parents, family, self, and peer. Children's problem solving-behaviors were most significantly related with parents/family domains among interpersonal relationships. In the case of boys, direct path between the perceptions of parents/family and problem solving-behavior was significant, whereas girls' perception of parent/family was associated with problem solving-behavior both directly and indirectly, through girls' perceptions of self and peer. Social preference was highly correlated with perceptions of peer and of father. This study has found that both boys' and girls' peer representations were established for the role as mediators between parents/family representations and peer ratings of social preference. These findings revealed that the impact of family representations on peer rejection was mediated by children's beliefs about their peers.