• Journal for History of Mathematics
• /
• v.31 no.3
• /
• pp.151-166
• /
• 2018

The rule of the game of Chomp is simple and the existence of a winning strategy can easily be proved. However, the existence tells us nothing about what strategies are winning in reality. Like in Chess or Baduk, many researchers studied the winning moves using computer programs, but no general patterns for the winning actions have not been found. In the paper, we aim to construct practical winning strategies based on backward induction. To do this we develop how to analyze Chomp and prove and find the winning strategies of the simple games of Chomp.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.936-943
• /
• 2002

The Simulated Annealing (SA) algorithm has been successfully applied to various difficult combinatorial optimization problems. Since the performance of a SA algorithm, generally depends on values of the parameters, it is important to select the most appropriate parameter values. In this paper the SA algorithm is optimally designed for performance acceleration, by using the Taguchi method. Several test problems are solved via the SA algorithm optimally designed, and the solutions obtained are compared to solution results McMullen & Frazier(2000). The performance of the SA algorithm is evaluated in terms of solution quality and computation times. Computational results show that the proposed SA algorithm is effective and efficient in finding near-optimal solutions.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1415-1423
• /
• 2016

Interference in device-to-device (D2D) communication underlaying cellular network needs to be elaborately investigated because of channel sharing. The objective is to improve the quality of D2D communications while maintaining high performance for cellular users. In this paper, we solve the above problem by jointly considering channel allocation and power control using coalition formation game. Our cooperative game theoric approach allows to enhance network-wide performance. We design a merge-and-split algorithm to deal with the complexity of the combinatorial structure in coalition formation problem. The analytical and numerical results show that our algorithm converges to a stable point which achieves high network performance.

• Proceedings of the Polymer Society of Korea Conference
• /
• 2006.10a
• /
• pp.142-143
• /
• 2006

Combinatorial methods are being used increasingly to develop the next generation of polymers, coatings and adhesive formulations. Allied to this approach, a new genre of measurement and characterization methods are emerging. These characterization techniques are required to handle and take measurements from small samples. This has led to a number of uses for this technology which usefully fall between convention test specimen and micro- or nano-scale test methods. A versatile measurement platform will be presented which can offer useful indentation, puncture, compression, adhesion and scratch resistance data for a wide variety of material types and that continues to develop and evolve in capability.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.57-78
• /
• 2005

The vehicle routing problem (VRP) is to determine a set of feasible vehicle routes, one for each vehicle, such that each customer is visited exactly once and the total distance travelled by the vehicles is minimized. A feasible route is defined as a simple circuit including the depot such that the total demand of the customers in the route does not exceed the vehicle capacity. While there have been significant advances recently in exact solution methodology, the VRP is not a well solved problem. We find most approaches still relying on the branch and bound method. These approaches employ various methodologies to compute a lower bound on the optimal value. We introduce a new modelling approach, termed route-splitting, for the VRP that allows us to address problems whose size is beyond the current computational range of set-partitioning models. The route-splitting model splits each vehicle route into segments, and results in more tractable subproblems. Lifting much of the burden of solving combinatorially hard subproblems, the route-splitting approach puts more weight on the LP master problem, Recent breakthroughs in solving LP problems (Nemhauser, 1994) bode well for our approach. Lower bounds are computed on five symmetric VRPs with up to 199 customers, and eight asymmetric VRPs with up to 70 customers. while it is said that the exact methods developed for asymmetric instances have in general a poor performance when applied to symmetric ones (Toth and Vigo, 2002), the route splitting approach shows a competent performance of 93.5% on average in the symmetric VRPs. For the asymmetric ones, the approach comes up with lower bounds of 97.6% on average. The route-splitting model can deal with asymmetric cost matrices and non-identical vehicles. Given the ability of the route-splitting model to address a wider range of applications and its good performance on asymmetric instances, we find the model promising and valuable for further research.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.323-329
• /
• 2009

This paper presents a new approach for thermal unit commitment (UC) using a differential evolution (DE) algorithm. DE is an effective, robust, and simple global optimization algorithm which only has a few control parameters and has been successfully applied to a wide range of optimization problems. However, the standard DE cannot be applied to binary optimization problems such as UC problems since it is restricted to continuous-valued spaces. This paper proposes binary differential evolution (BDE), which enables the DE to operate in binary spaces and applies the proposed BDE to UC problems. Furthermore, this paper includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in UC problems. Since excessive spinning reserves can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BDE, it is applied to largescale power systems of up to 100-units with a 24-hour demand horizon.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.2015-2018
• /
• 2005

In this paper, we are willing to prepare the reasonable optimization, Combinatorial Optimization and Genetic Algorithm. Thus we define position status of end-effect (or terminative link module) using promised form, (G, M(G), A(G), and so on.). For this preparing step, the reorganizing procedure of Link and Joint Module is necessary, like as enumerating the kinematically identical assembly group of several links and joints. Thus, we draw a G, directed graph in a first step. Because, directed graph contains the path information between adjacent Link Module and Joint Module. From the directed graph,G, we can incite the Incidence Matrix, M(G). The incidence matrix, M(G), contains the contact information of the Link (Joint) Module and the type of Link (Joint). At the end of this paper, we generalize the modular information as a matrix form, A(G). From this matrix, we can make a population of assembly status. That is the finial output of this paper.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1309-1314
• /
• 2007

The assignment of cells to reporting or non-reporting cells is an NP-hard problem having an exponential complexity in the Reporting Cell Location Management (RCLM) system. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. T1is paper compares Max-Min ant system (MMAS), rank-based ant system (RAS) and hybrid method of MMAS and RAS that generally used to solve combinatorial optimization problems. Experimental results demonstrate that hybrid method of MMAS and RAS is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.193-199
• /
• 2005

One of the important fields for heuristics algorithm is how to balance between Intensificationand Diversification. Ant Colony System(ACS) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we propose Multi Colony Interaction Ant Model that achieves positive negative interaction through elite strategy divided by intensification strategy and diversification strategy to improve the performance of original ACS. And, we apply multi colony interaction ant model by this proposed elite strategy to TSP and compares with original ACS method for the performance.

• International Journal of Contents
• /
• v.2 no.2
• /
• pp.17-24
• /
• 2006

The work presented in this paper is divided into two parts. The first part presents finite urn problems which generate truncated negative binomial random variables. Some combinatorial identities that arose from the negative binomial sampling and truncated negative binomial sampling are established. These identities are constructed and serve important roles when we deal with these distributions and their characteristics. Other important results including cumulants and moments of the distributions are given in somewhat simple forms. Second, the distributions of the maximum of two chi-square variables and the distributions of the maximum correlated F-variables are then derived within the negative binomial sampling scheme. Although multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information and deeper insight regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of these distributions. We supplement our findings with exact simple computational methods where no interpolations are involved.