• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.1
• /
• pp.58-65
• /
• 2001

This paper proposes a self tuning fuzzy inference method by the genetic algorithm in the fuzzy-sliding mode control for a robot. Using this method, the number of inference rules and the shape of membership functions are optimized without an expert in robotics. The fuzzy outputs of the consequent part are updated by the gradient descent method. And, it is guaranteed that he selected solution become the global optimal solution by optimizing the Akaikes information criterion expressing the quality of the inference rules. The trajectory tracking simulation and experiment of the polishing robot show that the optimal fuzzy inference rules are automatically selected by the genetic algorithm and the proposed fuzzy-sliding mode controller provides reliable tracking performance during the polishing process.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.4
• /
• pp.129-136
• /
• 2007

This paper considers the sequencing of products in mixed model assembly lines under Just-In-Time (JIT) systems. Under JIT systems, the most important goal for the sequencing problem is to keep a constant rate of usage every part used by the systems. The sequencing problem is solved using Genetic Algorithm Genetic Algorithm is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.98-108
• /
• 2005

The assembly line balancing problem has been focused by many research works because the efficient management of the assembly line might influence not only the quality of the products but also the working conditions for the workers. This paper deals with U-shape mixed-model assembly line balancing and considers both the processing time and the physical workloads. We suggest the goal programming approach for this situation and to overcome some difficulties of finding optimal solution, we adopt the genetic algorithm that is one of the most promising solution techniques. We tested several test problems and present the results that indicate some improvement for the line balancing as well as the stable performance of the algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.77-81
• /
• 2016

This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with $O(mn)^2$ time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of ($s_i,t_i$) city pair satisfied with demand of ($s_i,t_i$). The proposed algorithm can be get the same optimal solution as LP for experimental data.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.87-92
• /
• 2002

Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a stochastic evolution algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.749-780
• /
• 2021

In this paper, we give the notion of M(., .)-𝜂-proximal mapping for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space and prove its existence and Lipschitz continuity. As an application, we introduce and investigate a new system of variational-like inclusions in Banach spaces. By means of M(., .)-𝜂-proximal mapping method, we give the existence of solution for the system of variational inclusions. Further, propose an iterative algorithm for finding the approximate solution of this class of variational inclusions. Furthermore, we discuss the convergence and stability analysis of the iterative algorithm. The results presented in this paper may be further expolited to solve some more important classes of problems in this direction.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.839-853
• /
• 2021

Let 𝕽ⁿ be an Euclidean space and g : 𝕽ⁿ → 𝕽ⁿ be a monotone and continuous mapping. Suppose the convex constrained nonlinear monotone equation problem x ∈ 𝕮 s.t g(x) = 0 has a solution. In this paper, we construct an inertial-type algorithm based on the three-term derivative-free projection method (TTMDY) for convex constrained monotone nonlinear equations. Under some standard assumptions, we establish its global convergence to a solution of the convex constrained nonlinear monotone equation. Furthermore, the proposed algorithm converges much faster than the existing non-inertial algorithm (TTMDY) for convex constrained monotone equations.

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.467-478
• /
• 2016

In this paper, we propose an Ishikawa-type extra-gradient iterative algorithm for finding a solution of split feasibility, fixed point problems and equilibrium problems of quasi-nonexpansive mappings. It is proven that under suitable conditions, the sequences generated by the proposed iterative algorithms converge weakly to a solution of the split feasibility, fixed point problems and equilibrium problems. An example is given to illustrate the main result of this paper.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.34-46
• /
• 1988

This paper deals with design problem of unit load automated storage/retrieval systems (AS/RS). We propose an optimal design model in which the investment and maintenance costs of AS/RS, operating under dual command model is minimized over a time horizon satisfying the warehouse dimensional constraints. The model is formulated as an integer nonlinear program and an algorithm is proposed to find an optimum solution. The valididty of the solution algorithm is illustrated through an example.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1069-1074
• /
• 2001

ASP(Active Server Page) is adopted in searching optimal solution for VAR planning algorithm by FUZZY mathemathical programming. FUZZY theory is powerful tool dealing with the fuzziness of satisfaction levels of the constraints and the goal of objective funnctions. The effectivness of the proposed algorithm has been verifyed by the test on the IEEE-30 bus system.