• Journal of Electrical Engineering and Technology
• /
• v.5 no.4
• /
• pp.511-521
• /
• 2010

This paper presents a new algorithm to determine accurate bus-wise transmission loss allocation utilizing path-integrals dictated by the transaction strategy. For any transaction strategy, the total sum of the allocated transmission losses of all buses is equal to the actual loss given by the AC power-flow calculation considering the distributed slack. In this paper, the bus-wise allocation of the transmission loss is calculated by integrating the differential loss along a path determined by the transaction strategy. The proposed algorithm is also compared with Galiana's method, which is the well-known transmission loss allocation algorithm based on integration. The performance of the proposed algorithm is evaluated by case studies carried out on the WSCC 9-bus, IEEE 14-bus, New England 39-bus, and IEEE 118-bus systems. The simulation results show that the proposed algorithm is fast and accurate with a large step size.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.69-75
• /
• 2015

This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.3
• /
• pp.157-164
• /
• 2008

While developing physical prototype from CAD model, rapid prototyping mainly focuses on two key points reducing time and material consumption. So, we have to change from a traditional solid model to building a hollowed prototype. In this paper, a new method is presented to hollow out solid objects with uniform wall thickness to increase RP efficiency. To achieve uniform wall thickness, it is necessary to generate internal contour by slicing the offset model of an STL model. Due to many difficulties in this method, this paper proposes a new algorithm that computes internal contours computing offset model which is generated from external contour using wall thickness. Proposed method can easily compute the internal contour by slicing the offset surface defined by the sum of circle swept volumes of external contours without actual offset and the circle wept volumes. Internal contour existences are confirmed by using the external point. Presented algorithm uses the 2D geometric algorithm allowing RP implementation more efficient. Various examples have been tested with implementation of the algorithm, and some examples are presented for illustration.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.58-66
• /
• 2001

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.79-84
• /
• 2016

In this paper we consider the problem of finding the triplet (S,${\pi}$,f), where $S{\subseteq}V$, ${\pi}$ is a sequence of nodes in S and $f:V{\backslash}S{\rightarrow}S$ for a given complete graph G=(V,E). In particular, there exist two costs, $c^V_{uv}$ and $c^D_{uv}$ for $(u,v){\in}E$, and the cost of triplet (S,${\pi}$,f) is defined as $\sum_{i=1}^{{\mid}S{\mid}}c^V_{{\pi}(i){\pi}(i+1)}+2$ ${\sum_{u{\in}V{\backslash}S}c^D_{uf(u)}$. This problem is motivated by the integrated routing of the vehicle and drone for urban delivery services. Since a well-known NP-complete TSP (Traveling Salesman Problem) is a special case of our problem, we cannot expect to have any polynomial-time algorithm unless P=NP. Furthermore, for practical purposes, we may not rely on time-exhaustive enumeration method such as branch-and-bound and branch-and-cut. This paper suggests the simple heuristic which is motivated by the MST (minimum spanning tree)-based approximation algorithm and neighborhood search heuristic for TSP.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.1-13
• /
• 2018

Boosting, one of the most successful algorithms for supervised learning, searches the most accurate weighted sum of weak classifiers. The search corresponds to a convex programming with non-negativity and affine constraint. In this article, we propose a novel Conjugate Gradient algorithm with the Modified Polak-Ribiera-Polyak conjugate direction. The convergence of the algorithm is proved and we report its successful applications to boosting.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.179-187
• /
• 2005

In this paper, we consider the problem of regrouping a number of service sites into a smaller number of service sites called centers. Each service site is represented as a point in the plane and has an associated value of service demand. We aim to group the sites so that each group has the balanced service demand and the sum of distances from the sites in the group to their corresponding center is minimized. To solve this problem, we propose a hybrid genetic algorithm that is combined with Voronoi diagrams. We provide a variety of experimental results by changing the weights of the two factors: service demands and distances. Our hybrid algorithm finds better solutions in a shorter computation time in comparison with a pure genetic algorithm.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.307-314
• /
• 2007

In this paper, we propose an image contrast enhancement algorithm for an LCD TV. The proposed algorithm consists of two processes: the image segmentation process and the tone curve control process. The first process uses an automatic threshold technique to decompose an input image into two regions and then utilizes a hierarchical structure for real-time processing. The second process generates a gray level tone curve for contrast enhancement using a weighted sum of average tone curves for two segmented regions. Experimental result shows that the proposed algorithm outperforms the conventional contrast enhancement methods for an LCD TV.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.8
• /
• pp.786-792
• /
• 2009

Topology optimization is to find the optimal material distribution of the specified design domain minimizing the objective function while satisfying the design constraints. Since the genetic algorithm (GA) has its advantage of locating global optimum with high probability, it has been applied to the topology optimization. To guarantee the structural connectivity, the concept of compliance pattern is proposed and to improve the convergence rate, small number of population size and variable probability in genetic operators are incorporated into GA. The rank sum weight method is applied to formulate the fitness function consisting of compliance, volume, connectivity and checkerboard pattern. To substantiate the proposed method design examples in the previous works are compared with respect to the number of function evaluation and objective function value. The comparative study shows that the compliance pattern based GA results in the reduction of computational cost to obtain the reasonable structural topology.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.9
• /
• pp.806-811
• /
• 2012

In this paper Hartley functions are used to approximate the solutions of continuous time linear dynamical system. The Hartley function and its integral operational matrix are first presented, an efficient algorithm to solve the Stein equation is proposed. The algorithm is based on the compound matrix and the inverse of sum of matrices. Using the structure of the Hartley's integral operational matrix, the full order Stein equation should be solved in terms of the solutions of pure algebraic matrix equations, which reduces the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.