• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• East Asian mathematical journal
• /
• v.36 no.2
• /
• pp.131-146
• /
• 2020

The isoperimetric problem is a well-known optimization problem from ancient Greek. Among plane figures with the same perimeter, which is the largest area surrounded? The answer to the question is circle. Zenodorus and Steiner's pure geometric proofs, which left a lot of achievements in this matter, looked beautiful with ideas at that time. But there was a fatal flaw in the proof. The weakness is related to the existence of the solution. In this paper, from a view of the existence of the solution, we investigate proofs of Zenodorus and Steiner and get educational implications.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.129-138
• /
• 2003

The traveling salesman problem (TSP) is an NP-hard problem. As the number of nodes increases, it takes a lot of time to find an optimal solution. Instead of considering all arcs, if we select and consider only some arcs more likely to be included in an optimal solution, we can find efficiently an optimal solution. Arc candidate set is a group of some good arcs. For the Lack of study in the asymmetric TSP. it needs to research arc candidate set for the asymmetric TSP systematically. In this paper, we suggest a regression function determining arc candidate set for the asymmetric TSP. We established the function based on 2100 experiments, and we proved the goodness of fit for the model through various 787problems. The result showed that the optimal solutions obtained from our arc candidate set are equal to the ones of original problems. We expect that this function would be very useful to reduce the complexity of TSP.

• Korean Management Science Review
• /
• v.30 no.2
• /
• pp.31-42
• /
• 2013

The vehicle routing problem (VRP) can be described as a problem to find the optimum traveling routes from one or several depot (s) to number of geographically scattered customers. This study executes a revised Heterogeneous Vehicle Routing Problem (HVRP) to minimize the cost that needs to conduct efficiently the snow removal operations of Air Wing under available resources and limited operations time. For this HVRP, we model the algorithm of an hybrid Ant Colony System (ACS). In the initial step for finding a solution, the modeled algorithm applies various alterations of a parameter that presents an amount of pheromone coming out from ants. This improvement of the initial solution illustrates to affect to derive better result ultimately. The purpose of this study proves that the algorithm using Hybrid heuristic incorporated in tabu and ACS develops the early studies to search best solution.

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

This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between $m{\times}n$ ground stations using on-board $k{\leq}_{min}\{m,n\}$ k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of $\({mn \atop c}\)$ combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.16 no.3
• /
• pp.181-192
• /
• 2012

Here in this paper, the steady paint film flow on a vertical wall of a non-Newtonian pseudo plastic fluid for drainage problem has been investigated. The exact solution of the nonlinear problem is obtained for the velocity profile. Also the average velocity, volume flux, shear stress on the wall, force to hold the wall in position and normal stress difference have been derived. We retrieve Newtonian case, when material constant ${\mu}_1$ and relaxation time ${\lambda}_1$ equal zero. The results for co-rotational Maxwell fluid is also obtained by taking material constant ${\mu}_1$ = 0. The effect of the zero shear viscosity ${\eta}_0$, the material constant ${\mu}_1$, the relaxation time ${\lambda}_1$ and gravitational force on the velocity profile for drainage problem are discussed and plotted.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.3
• /
• pp.781-802
• /
• 2024

In this paper, we propose an inertial method for solving a common solution to fixed point and Variational Inequality Problem in Hilbert spaces. Under some standard and suitable assumptions on the control parameters, we prove that the sequence generated by the proposed algorithm converges strongly to an element in the solution set of Variational Inequality Problem associated with a quasimonotone operator which is also solution to a fixed point problem for a demimetric mapping. Finally, we give some numerical experiments for supporting our main results and also compare with some earlier announced methods in the literature.

• Geomechanics and Engineering
• /
• v.35 no.6
• /
• pp.593-601
• /
• 2023

In this paper, an analytical solution of large-strain cylindrical cavity expansion in compaction grouting problem under temperature field is given. Considering the stress increment caused by temperature, the analytical solution of cavity expansion under traditional isothermal conditions is improved by substituting the temperature stress increment into the cavity expansion analysis. Subsequently, combined with the first law of thermodynamics, the energy theory is also introduced into the cylindrical cavity expansion analysis, and the energy dissipation solution of cylindrical cavity expansion is derived. Finally, the validity and reliability of solution are proved by comparing the results of expansion pressure with those in published literatures. The results show that the dimensionless expansion pressure increases with the increase of temperature, and the thermal response increases with the increase of dilation angle. The higher the exothermic temperature of grouting slurry, the greater the plastic deformation energy of the surrounding soil, that is, the greater the influence on the surrounding soil deformation and the surrounding environment. The proposed solution not only enrich the theoretical system of cavity expansion, but also can be used as a theoretical tool for energy geotechnical engineering problems, such as CPT, nuclear waste disposal, energy pile and chemical grouting, etc.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.877-882
• /
• 2010

In this paper, a third-order three-point boundary value problem on time scales is considered. We establish criteria for the existence of a solution and a positive solution by using the Leray-Schauder fixed point theorem. An example is also given to illustrate our results.

• Korean Journal of Logic
• /
• v.5 no.2
• /
• pp.115-131
• /
• 2002

The problem of disjunctive causal factors is generalized as follows. Suppose that there are no factors of the kind considered so far that need to be held fixed in background contexts. Nevertheless, it is still possible that within the background contexts, each disjunct of a disjunctive causal factor X v W confers a different probability on an effect factor in Question. So a problem arises of how we identify a single causally significant probability of the effect factor in the presence of the disjunctive causal factor, assuming that each disjunct of the disjunctive causal factor confers a different probability on the effect factor. In this paper, I first introduce an experiment in which disjunctive causal factors seem to pose a problem for the theory of probabilistic causation. Second, I show how Eells' solution to the problem of disjunctive causal factors meets the problem that arises in the experiment. Third, I examine Hitchcock's arguments against Eells' solution, arguing that Hitchcock misconstrues Eells' solution, and disregards the feature of the theory of probabilistic causation such that a factor is a causal factor for another factor relative to a population P of a population type Q.