• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.13-21
• /
• 2014

The set covering problem (SCP) is one of representative combinatorial optimization problems, which is defined as the problem of covering the m-rows by a subset of the n-columns at minimal cost. This paper proposes a method utilizing Integer Programming-based Local Search (IPbLS) to solve the set covering problem. IPbLS is a kind of local search technique in which the current solution is improved by searching neighborhood solutions. Integer programming is used to generate neighborhood solution in IPbLS. The effectiveness of the proposed algorithm has been tested on OR-Library test instances. The experimental results showed that IPbLS could search for the best known solutions in all the test instances. Especially, I confirmed that IPbLS could search for better solutions than the best known solutions in four test instances.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.443-448
• /
• 2013

Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the total frequency of visits of the currently selected node in the previous iteration. I used the ACS algoritm using subpath for search. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.4
• /
• pp.1-8
• /
• 2024

The traveling salesman problem(TSP) is one of the well known combinatorial optimization problems. Local search has been used as a method to solve TSP. Greedy Random Insertion(GRI) is known as an effective neighbor generation method for local search. GRI selects some cities from the current solution randomly and inserts them one by one into the best position of the current partial solution considering only one city at a time. We first propose another greedy neighbor generation method which is named Full Greedy Insertion(FGI). FGI determines insertion location one by one like GRI, but considers all remaining cities at once. And then we propose a method to combine GRI with FGI, in which GRI or FGI is randomly selected and executed at each iteration in simulated annealing. According to the experimental results, FGI alone does not necessarily perform very well. However, we confirmed that the combined method outperforms the existing local search methods including GRI.

• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2230-2241
• /
• 2006

This paper presents a sole application of boundary element method to the conjugate heat transfer problem of thermally developing laminar flow in a thick walled pipe when the fluid velocities are fully developed. Due to the coupled mechanism of heat conduction in the solid region and heat convection in the fluid region, two separate solutions in the solid and fluid regions are sought to match the solid-fluid interface continuity condition. In this method, the dual reciprocity boundary element method (DRBEM) with the axial direction marching scheme is used to solve the heat convection problem and the conventional boundary element method (BEM) of axisymmetric model is applied to solve the heat conduction problem. An iterative and numerically stable BEM solution algorithm is presented, which uses the coupled interface conditions explicitly instead of uncoupled conditions. Both the local convective heat transfer coefficient at solid-fluid interface and the local mean fluid temperature are initially guessed and updated as the unknown interface thermal conditions in the iterative solution procedure. Two examples imposing uniform temperature and heat flux boundary conditions are tested in thermally developing region and compared with analytic solutions where available. The benchmark test results are shown to be in good agreement with the analytic solutions for both examples with different boundary conditions.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.47-51
• /
• 2005

Using satellite images, an optimal solution to water motion has been presented in this study. Since temperature patterns are suitable tracers in water motion, Sea Surface Temperature (SST) images of Caspian Sea taken by MODIS sensor on board Terra satellite have been used in this study. Two daily SST images with 24 hours time interval are used as input data. Computation of templates correspondence between pairs of images is crucial within motion algorithms using non-rigid body objects. Image matching methods have been applied to estimate water body motion within the two SST images. The least squares matching technique, as a flexible technique for most data matching problems, offers an optimal spatial solution for the motion estimation. The algorithm allows for simultaneous local radiometric correction and local geometrical image orientation estimation. Actually, the correspondence between the two image templates is modeled both geometrically and radiometrically. Geometric component of the model includes six geometric transformation parameters and radiometric component of the model includes two radiometric transformation parameters. Using the algorithm, the parameters are automatically corrected, optimized and assessed iteratively by the least squares algorithm. The method used in this study, has presented more efficient and robust solution compared to the traditional motion estimation schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.295-303
• /
• 2007

An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.3
• /
• pp.183-192
• /
• 2003

This paper presents the real-time implemented distance relay algorithm which the fault distance is estimated with only local terminal information. When a single-phase-to-earth fault on a two-parallel transmission line occurs, the reach accuracy of distance relay is considerably affected by the unknown variables which are fault resistance, fault current at the fault point and zero- sequence current of sound line The zero-sequence current of sound line is estimated by using the zero sequence voltage which is measured by relaying location Also. the fault resistance is removed at the Process of numerical formula expansion. Lastly, the fault current through a fault point is expressed as a function of the zero-sequence current of fault line, zero-sequence current of sound line, and line, and fault distance. Therefore, the fault phase voltage can be expressed as the quadratic equation of the fault distance. The solution of this Quadratic equation is obtained by using a coefficient of the modified quadratic equation instead of using the square root solution method. After tile accurate fault distance is estimated. the mote accurate impedance is measured by using such an information.

• Structural Engineering and Mechanics
• /
• v.76 no.4
• /
• pp.505-512
• /
• 2020

This paper presents an error estimation technique for 2-D crack analysis by an enriched natural element (more exactly, enriched Petrov-Galerkin NEM). A bare solution was approximated by PG-NEM using Laplace interpolation functions. Meanwhile, an accurate quasi-exact solution was obtained by a combined use of enriched PG-NEM and the global patch recovery. The Laplace interpolation functions are enriched with the near-tip singular fields, and the approximate solution obtained by enriched PG-NEM was enhanced by the global patch recovery. The quantitative error amount is measured in terms of the energy norm, and the accuracy (i.e., the effective index) of the proposed method was evaluated using the errors which obtained by FEM using a very fine mesh. The error distribution was investigated by calculating the local element-wise errors, from which it has been found that the relative high errors occurs in the vicinity of crack tip. The differences between the enriched and non-enriched PG-NEMs have been investigated from the effective index, the error distribution, and the convergence rate. From the comparison, it has been justified that the enriched PG-NEM provides much more accurate error information than the non-enriched PG-NEM.

• Structural Engineering and Mechanics
• /
• v.72 no.2
• /
• pp.229-244
• /
• 2019

Weak form integral equations are developed to investigate the flapwise bending vibration of the rotating beams. Rayleigh and Eringen nonlocal elasticity theories are used to investigate the rotatory inertia and Size-dependency effects on the flapwise bending vibration of the rotating cantilever beams, respectively. Through repetitive integrations, the governing partial differential equations are converted into weak form integral equations. The novelty of the presented approach is the approximation of the mode shape function by a power series which converts the equations into solvable one. Substitution of the power series into weak form integral equations results in a system of linear algebraic equations. The natural frequencies are determined by calculation of the non-trivial solution for resulting system of equations. Accuracy of the proposed method is verified through several numerical examples, in which the influence of the geometry properties, rotatory inertia, rotational speed, taper ratio and size-dependency are investigated on the natural frequencies of the rotating beam. Application of the weak form integral equations has made the solution simpler and shorter in the mathematical process. Presented relations can be used to obtain a close-form solution for quick calculation of the first five natural frequencies of the beams with flapwise vibration and non-local effects. The analysis results are compared with those obtained from other available published references.

• Smart Structures and Systems
• /
• v.18 no.3
• /
• pp.425-448
• /
• 2016

In this paper, a new Pigeon Colony Algorithm (PCA) based on the features of a pigeon colony flying is proposed for solving global numerical optimization problems. The algorithm mainly consists of the take-off process, flying process and homing process, in which the take-off process is employed to homogenize the initial values and look for the direction of the optimal solution; the flying process is designed to search for the local and global optimum and improve the global worst solution; and the homing process aims to avoid having the algorithm fall into a local optimum. The impact of parameters on the PCA solution quality is investigated in detail. There are low-dimensional functions, high-dimensional functions and systems of nonlinear equations that are used to test the global optimization ability of the PCA. Finally, comparative experiments between the PCA, standard genetic algorithm and particle swarm optimization were performed. The results showed that PCA has the best global convergence, smallest cycle indexes, and strongest stability when solving high-dimensional, multi-peak and complicated problems.