• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.401-418
• /
• 2005

In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Thcker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.

• Korean Journal of Mathematics
• /
• 제26권4호
• /
• pp.777-798
• /
• 2018

In this paper, we study a new iterative method for solving mixed equilibrium problem and a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the framework of reflexive real Banach spaces. Moreover, we prove a strong convergence theorem for finding common fixed points which also are solutions of a mixed equilibrium problem.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.93-107
• /
• 2005

Based on the recently developed ABS algorithm for solving linear Diophantine equations, we present a special ABS algorithm for solving such equations which is effective in computation and storage, not requiring the computation of the greatest common divisor. A class of equations always solvable in integers is identified. Using this result, we discuss the ILP problem with upper and lower bounds on the variables.

• 한국국방경영분석학회지
• /
• 제23권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.

• 대한안전경영과학회지
• /
• 제6권4호
• /
• pp.155-170
• /
• 2004

Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제15권1호
• /
• pp.12-18
• /
• 2015

TRIZ is one of the most famous tools for creative problem solving. However, it is said that TRIZ is complicated and difficult to understand and apply to solve problems. In order to resolve these difficulties, this paper presents S-ARIZ, a simplified ARIZ(the algorithm for inventive problem solving). S-ARIZ revised ARIZ-85C on two ways. First, cause and effect analysis is used to define core technical contradictions and control parameters for the physical contradictions. Second, we add 5 inventive principles which revised SIT(systematic inventive thinking) partially to IFR-1 definition (Step 3-2 of ARIZ-85C) to solve the intensified technical contradictions systematically and effectively. It is expect that S-ARIZ can contribute to the rapid spread of TRIZ.

• 한국컴퓨터정보학회논문지
• /
• 제20권5호
• /
• pp.151-159
• /
• 2015

알고리즘은 문제를 효과적이고 효율적으로 해결하기 위해 필요한 문제 해결 과정을 설계하는 기법을 다루기 때문에 컴퓨터 과학을 배우는 사람이라면 반드시 학습해야 하는 영역이다. 알고리즘 교육은 학습자들이 알고리즘을 설계하는 기법을 익히는 것 뿐 아니라 학습한 알고리즘 기법을 문제를 해결하는 데 적절히 활용할 수 있는 능력을 함께 익힐 때 효과적이다. 특히 사회적으로 커다란 영향을 미칠 가능성을 가진 정보 영재 학생들을 대상으로 하는 교육 활성화에 대한 인식이 확산되기 시작하면서 이들을 어떻게 가르칠 것인가에 대한 관심이 고조되고 있다. 따라서 본 연구에서는 정보 영재 학습자들이 알고리즘 설계 기법을 보다 쉽게 학습하고 문제를 해결하는 데 활용하는 방법을 익힐 수 있도록 하기 위하여 퍼즐을 도입하였다. 연구 결과 퍼즐 기반의 알고리즘 학습이 전통적인 알고리즘 학습 방법에 비해 학습자들에게 긍정적인 영향을 준 것을 확인할 수 있었다. 이러한 결과는 학습자들이 퍼즐 기반 알고리즘 학습을 통해 알고리즘 설계 기법을 적용하는 다양한 문제 해결 경험을 함으로써 흥미와 학습의 전이가 향상된 것이라 해석할 수 있다.

• Journal of Electrical Engineering and Technology
• /
• 제12권4호
• /
• pp.1417-1426
• /
• 2017

Power system analysis, Non-Convex Economic Dispatch (NED) is considered as an open and demanding optimization problem. Despite the fact that realistic ED problems have non-convex cost functions with equality and inequality constraints, conventional search methods have not been able to effectively find the global answers. Considering the great potential of meta-heuristic optimization techniques, many researchers have started applying these techniques in order to solve NED problems. In this paper, a new and efficient approach is proposed based on imperialist competitive algorithm (ICA). The proposed algorithm which is named multi-operator ICA (MuICA) merges three operators with the original ICA in order to simultaneously avoid the premature convergence and achieve the global optimum answer. In this study, the proposed algorithm has been applied to different test systems and the results have been compared with other optimization methods, tending to study the performance of the MuICA. Simulation results are the confirmation of superior performance of MuICA in solving NED problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.1111-1116
• /
• 1993

In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

• 한국경영과학회지
• /
• 제34권3호
• /
• pp.125-136
• /
• 2009

The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.