• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.93-100
• /
• 2012

In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

• Journal of the Korean Mathematical Society
• /
• v.38 no.6
• /
• pp.1275-1284
• /
• 2001

In this paper, we introduce an iteration generated by countable nonexpansive mappings and prove a weak convergence theorem which is connected with the feasibility problem. This result is used to solve the problem of finding a solution of the countable convex inequality system and the problem of finding a common fixed point for a commuting countable family of nonexpansive mappings.

• Journal of the Korean Institute of Navigation
• /
• v.24 no.5
• /
• pp.361-371
• /
• 2000

This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

• 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.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• Journal of Environmental Impact Assessment
• /
• v.6 no.2
• /
• pp.123-135
• /
• 1997

The solid waste incineration facilities which cause environmental pollution. And those are some kind of loathing facilities for residents who do not want it. This problem could be solved by location feasibility study. The purpose of location feasibility study was to determine one site out of three candidate sites. This study which was done by the law, environmental and economic factor was considered for optimum site selection. Comparative evaluation among the candidate sites was done by ordinal scale and thus the optimum site was selected.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.1138-1144
• /
• 2008

To study the feasibility of applying wireless communication technology to the control of train for the effective control of train and for the reduction of cost and time to construct the necessary infra structure, we investigate into the application of the existing commercial WCDMA network to CBTC (communication-based train control) to grasp the obstacles and propose the solutions to circumvent them. The obstacles can be categorized into the hand-off problem, the interference problem near the stations, and the problem of radio shadow areas. We propose, as solutions, the cell overlap method and multi-terminal approach for the hand-off problem, the cell sectoring method for the interference problem, and establishment of new base stations along the railroad both to provide the wireless train control and communication service to the customers on the train which was otherwise impossible because of the shadowing effect.

• Korean Management Science Review
• /
• v.18 no.2
• /
• pp.1-10
• /
• 2001

Due to environmental change in market, delivery satisfaction to customer end redaction of LeadTime are critical In the Make-to-Order manufacturing system. This paper focuses on Order Feasibility Decision System Based on SNS System. We suggest BOP (Bill of Process) in which aggregated information is used When the load p1anning problem is solved while more detailed information is used when the scheduling problem is solved.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.752-758
• /
• 2005

The transportation problem (TP) is known as one of the important problems in Industrial Engineering and Operational Research (IE/OR) and computer science. When the problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of NP-hard problems which is difficult to solve it by traditional methods. This paper aims to show the application of spanning-tree based Genetic Algorithm (GA)approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.