• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.289-295
• /
• 2000

The triangulation problem is to make triangles using the given points on the space. The Minimum Weight Triangulation(MWT) is the problem of finding a set of triangles with the minimum weight among possible set of the triangles. In this paper, a modified genetic algorithm(GA) based on an existing genetic algorithm and multispace smoothing technique is proposed. Through the computational results, we can find the tendency that the proposed GA finds good solutions though it needs longer time than the existing GA does as the problem size increases.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1263-1275
• /
• 2010

In this paper, we introduce a new iterative scheme for finding a common element of the set of common fixed points of infinite family of nonexpansive mappings and the set of solutions to a generalized equilibrium problem and the set of solutions to a variational inequality problem in a real Hilbert space. Then strong convergence of the scheme to a common element of the three sets is proved. As applications, three new strong convergence theorems are obtained. Our theorems extend important recent results.

• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.89-106
• /
• 2022

We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.

• Korean Journal of Hydrosciences
• /
• v.6
• /
• pp.107-118
• /
• 1995

The water distribution system problem consists of finding a minimum cost system design subject to hydraulic and operation constraints. The design of new branchin network in a paddy irrigation system is presented here. The program based on the linear programming formulation is aimed at finding the optimal economical combination of two main factors : the capital cost of pipe network and the energy cost. Two loading conditions and booster pumps for design of pipe network are considered to obtain the least cost design.

• Management & Information Systems Review
• /
• v.5
• /
• pp.287-300
• /
• 2000

Project Managers want to reduce the cost and the completion time of the project simultaneously. But the project completion time tends to increase as the project cost is reduced, and the project cost has a tendency to increase as the project completion time is reduced. In this paper, the resource constrained project scheduling problem with multiple crashable modes is considered. An exact solution method for finding the efficient solution set and the computational results are introduced.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.21-28
• /
• 1999

The TSP(Traveling Salesman Problem) is one of the most widely studied problems in combinatorial optimization. The most common interpretation of TSP is finding a shortest Hamiltonian tour of all cities. The objective of this paper proposes a new heuristic algorithm MCH(Multi-Convex hulls Heuristic). MCH is a algorithm for finding good approximate solutions to practical TSP. The MCH algorithm is using the characteristics of the optimal tour. The performance results of MCH algorithm are superior to others algorithms (NNH, CCA) in CPU time.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.895-902
• /
• 2022

The aim of this paper is to construct a new method for finding the zeros of the sum of two maximally monotone mappings in Hilbert spaces. We will define a simple function such that its set of zeros coincide with that of the sum of two maximal monotone operators. Moreover, we will use the Newton-Raphson algorithm to get an approximate zero. In addition, some illustrative examples are given at the end of this paper.

• Journal of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.849-875
• /
• 2018

The purpose of this paper is to present an operator method of regularization for the problem of finding a solution of a system of nonlinear ill-posed equations with a monotone hemicontinuous mapping and N inverse-strongly monotone mappings in Banach spaces. A regularization parameter choice is given and convergence rate of the regularized solutions is estimated. We also give the convergence and convergence rate for regularized solutions in connection with the finite-dimensional approximation. An iterative regularization method of zero order in a real Hilbert space and two examples of numerical expressions are also given to illustrate the effectiveness of the proposed methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.223-234
• /
• 1997

Companies often have to locate their facilities considering competitors' response to their locational decision. One model available in the literature is due to Dobson and Karmarkar, in which a firm has to decide locations so as to prevent competitors from entering the market after the firm's entry. In this paper, we provide new compact binary integer program formulations for their competitive location model and also present an efficient Genetic Algorithm(GA) for finding a (near-)optimal stable set. The GA we propose utilizes a penalty function to handle the feasibility of the problem and modified elitism for better performance of the algorithm. Computational comparisons indicate the superior performance of the GA over the Dobson and Karmarkar's branch and fathom algorithm.

• International Journal of Internet, Broadcasting and Communication
• /
• v.6 no.1
• /
• pp.5-8
• /
• 2014

Social networking services that connect a person to other people are attracting our attention and various types of on-the-network services are provided. Library has been playing a role of social media by providing with materials such as books and magazines, and with a place for reading, studying, getting lectures, etc. In this paper, we present a method for finding candidates of groups of the library's patrons who share interest areas by utilizing the loan records, which are obtainable by every library. Such a homogeneous group can become a candidate for a study group, a community for exchange ideas, and other activity group. We apply the method to a collection of loan records of a university library, find some problem to be solved, and propose measures for more detailed solutions. Even though the potential group finding problem still remains a lot of problems to be solved, its potential importance is very high and thus to be studies even more for future applications.