• Korean Management Science Review
• /
• v.14 no.2
• /
• pp.47-61
• /
• 1997

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.21-34
• /
• 2012

This paper addresses a network design problem in a supply chain system that involves locating both plants and distribution centers, and determining the best strategy for distributing products from the suppliers to the plants, from the plants to the distribution centers and from the distribution centers to the customers. This paper suggests a cooperative coevolutionary algorithm (CCEA) approach to solve the model. First, the problem is decomposed into three subproblems for each of which the chromosome population is created correspondingly. Each chromosome in each population is represented as a permutation denoting the priority. Then an algorithm generating a solution from the combined set of chromosomes from each population is suggested. Also an algorithm evaluating the performance of a solution is suggested. An experimental study is carried out. The results show that our CCEA tends to generate better solutions than the previous CCEA as the problem size gets larger and that the permutation representation for chromosome used here is better than other representation.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.499-514
• /
• 1996

Consider an additive regression model of Y on X = (X$_1$,X$_2$,. . .,$X_p$), Y = $sum_{j=1}^pf_j(X_j) + $\varepsilon$$, where $f_j$s are smooth functions to be estimated and $\varepsilon$ is a random error. If $X_j$s are fixed design points, we call it the fixed design additive model. Since the response variable Y is observed at fixed p-dimensional design points, the behavior of the nonparametric regression estimator depends on the design. We propose a fixed design called permutation fixed design, and fit the regression function by the kernel method. The estimator in the permutation fixed design achieves the univariate optimal rate of convergence in mean squared error for any p $\geq$ 2.

• Journal of Information Technology Applications and Management
• /
• v.22 no.2
• /
• pp.1-17
• /
• 2015

In this research, we develop and suggest branch and bound algorithms for a two-machine permutation flowshop scheduling problem with the objective of minimizing makespan. In this scheduling problem, after each job is operated on the machine 1 (first machine), the job has to start its second operation on machine 2 (second machine) within its corresponding limited waiting time. In addition, each job has its corresponding ready time at the machine 1. For this scheduling problem, we develop various dominance properties and three lower bounding schemes, which are used for the suggested branch and bound algorithm. In the results of computational tests, the branch and bound algorithms with dominance properties and lower bounding schemes, which are suggested in this paper, can give optimal solution within shorter CPU times than the branch and bound algorithms without those. Therefore, we can say that the suggested dominance properties and lower bounding schemes are efficient.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.6
• /
• pp.1557-1564
• /
• 2017

We take genomic sequences of high-dimensional low sample size (HDLSS) without ordering of response categories into account. When constructing an appropriate test statistics in this model, the classical multivariate analysis of variance (MANOVA) approach might not be useful owing to very large number of parameters and very small sample size. For these reasons, we present a pseudo marginal model based upon the Gini-Simpson index estimated via Bayesian approach. In view of small sample size, we consider the permutation distribution by every possible n! (equally likely) permutation of the joined sample observations across G groups of (sizes $n_1,{\ldots}n_G$). We simulate data and apply false discovery rate (FDR) and positive false discovery rate (pFDR) with associated proposed test statistics to the data. And we also analyze real SARS data and compute FDR and pFDR. FDR and pFDR procedure along with the associated test statistics for each gene control the FDR and pFDR respectively at any level ${\alpha}$ for the set of p-values by using the exact conditional permutation theory.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.47-47
• /
• 1989

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.213-228
• /
• 2010

A weighted version of the geometric mean of k ($\geq\;3$) positive invertible operators is given. For operators $A_1,{\ldots},A_k$ and for nonnegative numbers ${\alpha}_1,\ldots,{\alpha}_k$ such that $\sum_\limits_{i=1}^k\;\alpha_i=1$, we define weighted geometric means of two types, the first type by a direct construction through symmetrization procedure, and the second type by an indirect construction through the non-weighted (or uniformly weighted) geometric mean. Both of them reduce to $A_1^{\alpha_1}{\cdots}A_k^{{\alpha}_k}$ if $A_1,{\ldots},A_k$ commute with each other. The first type does not have the property of permutation invariance, but satisfies a weaker one with respect to permutation invariance. The second type has the property of permutation invariance. We also show a reverse inequality for the arithmetic-geometric mean inequality of the weighted version.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.434-440
• /
• 2006

In this paper, the eigenvalues of various non-Sylvester Hadamard matrices constructed by monomial permutation matrices are derived, which shows the relation between the eigenvalues of the newly constructed matrix and Sylvester Hadamard matrix.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.211-224
• /
• 2003

Good's lambda test, a permutation test used to detect the changes of microorganism composition under two pathological conditions, has been quite popular for studying the micro-flora responsible for periodontal disease. A vast number of different micro-flora in the mouth renders the traditional chi-square test inapplicable. The main purpose of this paper is to evaluate the power of this test so that the sample size can be determined at the design stage. The robustness of this test and its comparison to two other intuitive tests are also presented. It is found that a permutation test based on likelihood ratio is more powerful than the lambda test in our simulated cases.

• Communications for Statistical Applications and Methods
• /
• v.25 no.4
• /
• pp.329-339
• /
• 2018

In this study, we propose tests for equality of several variances with the normality assumption. First of all, we propose the likelihood ratio test by applying the permutation principle. Then by using the p-values for the pairwise tests between variances and combination functions, we propose combination tests. We apply the permutation principle to obtain the overall p-values. Also we review the well- known test statistics for the completion of our discussion and modify a statistic with the p-values. Then we illustrate proposed tests by numerical and simulated data and compare their efficiency with the reviewed ones through a simulation study by obtaining empirical p-values. Finally, we discuss some interesting features related to the resampling methods and tests for equality among several variances.